Digital Electronics Part I - University of Cambridge

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)


Loved it? Download it, Share it!!
Share

Preview 2

Image

Preview 3

Image

Preview 4

Image

Preview 5

Image

Preview 6

Image

Thumbnails


Image
Image