Karnaugh Maps
v
Problem
- Canonical forms contain
redundant terms.
-
Redundant terms
cost hardware.
-
Applying rules
of digital algebra is length process and error prone.
v
Solution
- Karnaugh Map à matrix of squares and each square represents
a max. term or a min. term from the Boolean equation.
- Karnaugh maps permits the
identification of groups of min. terms that contain redundant variables of the
form X +
X’ = 1
|
C \ AB |
00 |
01 |
11 |
10 |
|
0 |
0 |
2 |
6 |
4 |
|
1 |
1 |
3 |
7 |
5 |
Only one bit changes between adjacent squares for each column and
row. Why?
|
YZ \ WX |
00 |
01 |
11 |
10 |
|
00 |
0 |
4 |
12 |
8 |
|
01 |
1 |
5 |
13 |
9 |
|
11 |
3 |
7 |
15 |
11 |
|
10 |
2 |
6 |
14 |
10 |