Karnaugh Maps

• Karnaugh Maps (K-Maps) are a graphical method of visualizing the 0’s and 1’s of a boolean function

  • K-Maps are very useful for performing Boolean minimization.

• Will work on 2, 3, and 4 variable K-Maps in this class.

• Karnaugh maps can be easier to use than boolean equation minimization once you get used to it.

Previous slide

Next slide

Back to first slide

View graphic version