Map Simplification (K-Map)
Karnaugh Map is a graphical technique to simplify Boolean expressions, reduce logic gates, and design efficient digital circuits.
1. What is Karnaugh Map?
A Karnaugh Map (K-Map) is a visual method used to simplify Boolean expressions without using Boolean algebra rules repeatedly.
- Reduces number of logic gates
- Minimizes hardware cost
- Used for up to 4–6 variables (practically)
Exam Tip: K-Map provides the minimum SOP or POS expression.
2. Gray Code Ordering (Very Important)
K-Map cells follow Gray code ordering so that adjacent cells differ by only one bit.
Example (2-bit Gray code):
00 → 01 → 11 → 10
This allows adjacent 1s to be grouped even if binary values look non-adjacent.
3. K-Map Types
2-Variable
4 cells
3-Variable
8 cells
4-Variable
16 cells
4. Grouping Rules
- Group size must be power of 2 (1,2,4,8…)
- Groups must be rectangular
- Wrap-around adjacency allowed
- Largest possible groups give simplest result
- Overlapping groups allowed
5. Worked Example (2-Variable)
Given function: F(A,B) = Σm(1,2,3)
| A\B | 0 | 1 |
|---|---|---|
| 0 | 0 | 1 |
| 1 | 1 | 1 |
Simplified Expression: F = A + B
6. Interactive Playground (2-Variable)
Enter minterms (0–3) separated by comma
7. Common Exam Mistakes
- Ignoring wrap-around adjacency
- Making smaller groups instead of larger ones
- Diagonal grouping (not allowed)
- Forgetting eliminated variables
8. Where K-Map is Used
- Combinational circuit design
- ALU control logic
- Decoder & encoder optimization
- Digital system minimization
9. 3-Variable K-Map Solver
Enter minterms (0–7)
10. 4-Variable K-Map (Step Grouping)
Enter minterms (0–15)
11. Don’t-Care Based Simplification
12. POS Simplification (Grouping 0s)
Illustrated 2-Variable K-Map
F(A,B) = Σm(1,2,3)
Illustrated 3-Variable K-Map
F(A,B,C) = Σm(1,3,5,7)
Illustrated 4-Variable K-Map
Corner grouping (wrap-around)
Don’t-Care Condition Visualization
F(A,B,C) = Σm(1,3,5) + d(7)
POS K-Map Illustration (Grouping 0s)
F(A,B) = ΠM(0,2)
Auto-Generated K-Map from Truth Table (3-Variable)
Enter output values for all combinations of A, B, C. The K-Map will be generated automatically using Gray code order.
Truth Table Order: 000,001,010,011,100,101,110,111
Build Your Own K-Map (Click to Toggle)
Click on cells to toggle values: 0 → 1 → X → 0
Exam Tip: Always form the largest possible groups. If don’t-care helps increase group size, use it.