4 ms·
> 2. Simplify the function using a Karnaugh Map https://en.wikipedia.org/wiki/Karnaugh_map https://en.wikipedia.org/wiki/Karnaugh_map > 3. From the Karnaugh Ma
by signa11 11y ago
> 2. Simplify the function using a Karnaugh Map https://en.wikipedia.org/wiki/Karnaugh_map https://en.wikipedia.org/wiki/Karnaugh_map
> 3. From the Karnaugh Map, implement it with AND-OR gates.
oh dear, that brings back so many memories. however, for modern day optimizations with millions of primitives, kmaps are totally unfeasible. binary-decision-diagrams aka BDD, no not the other one ;), are the ones which makes things somewhat reasonable.
edit: if you are really curious about these things, then the text by zvi-kohavi (switching and finite automata theory) is an excellent primer.
- javcasas 11y agoSure, I will not use Karnaugh maps when I design a processor. They are awesome for teaching logic gates, but useless for building big logic. It's like pretending to build a skyscrapper with just bricks and mortar. Given enough effort you will succeed, but you are likely to die of old age long before.