Preview 1
Logic Minimisation • Any Boolean function can be implemented directly using combinational logic (gates) • However, simplifying the Boolean function will enable the number of gates required to be reduced. Techniques available include: – Algebraic manipulation (as seen in examples) – Karnaugh (K) mapping (a visual approach)
Preview 1
Preview 2
Preview 3
Preview 4
Preview 5
Preview 6