34 ms·
EE/CS here. Kmaps only work for 4-5 variables unless you're some sort of 4D-chess wizard. And they're meant for manual, human pattern-matching rather than autom
by paypalcust83 7y ago
EE/CS here. Kmaps only work for 4-5 variables unless you're some sort of 4D-chess wizard. And they're meant for manual, human pattern-matching rather than automated evaluation.
There are numerous, specialized bi/tri/quad boolean logic prime implicant optimization algorithms for combinational logic and expressions like QM and MQM.
- tasty_freeze 7y agoI once did the reverse karnaugh mapping on a set of expressions to minimize their complexity; the input set was 7 bits. Specifically, I created an instruction mapping on a 7b opcode space such that the decode logic for the critical paths was short (eg, branch decode). It took multiple sheets of paper, a few tries, and a couple of days, but it wasn't too bad.