Karnaugh Maps

A Karnaugh map (K-map) is a graphical method for simplifying Boolean expressions. It is an alternative to algebraic simplification that is often faster and less error-prone, especially for expressions with 3 or 4 variables. The OCR H446 specification requires you to understand and use K-maps.

---

Why Use Karnaugh Maps?

Method	Advantages	Disadvantages
Algebraic simplification	Works for any number of variables	Easy to make mistakes; no guaranteed path to simplest form
Karnaugh maps	Visual; systematic; guaranteed minimal SoP form	Practical only for up to 4 variables (5-6 possible but complex)

---

The Key Idea: Gray Code Ordering

K-maps arrange truth table rows so that adjacent cells differ by exactly one variable. This is called Gray code ordering. Because adjacent cells differ by one bit, groups of adjacent 1s correspond to terms where that variable can be eliminated.

---

2-Variable Karnaugh Map

For variables A and B, the K-map is a 2x2 grid:

	B=0	B=1
A=0	Cell 00	Cell 01
A=1	Cell 10	Cell 11