Академический Документы
Профессиональный Документы
Культура Документы
CS/EE-220: Lecture 7
K-Maps
A diagram made of squares
Graphical representation of the truth table
Each square represent a Minterm
B 1
A 0
0 1
0
2 3
1
K-Maps
Graphical representation of Sum of Minterms
Example: F(A, B) = m (0, 1, 3)
B 1
A 0
AB 0 AB 1
0 1 1
AB 2 AB 3
1
1
K-Maps
No. of squares are equal to no. of minterms in truth table
3-variable
BC
K-Maps
00 01 11 10
A
m0 m1 m3 m2
0
m4 m5 m7 m6
1
4-variable K-Maps
CD 01
AB 00 11 10
m0 m1 m3 m2
00
m4 m5 m7 m6
01
m8 m9 m11 m10
10
4-variable K-Maps
We can observe that
All rows have terms that are adjacent
All columns have terms that are adjacent as well
Even the boundary terms of each row are adjacent
Can be wrapped to make a cylinder
And finally the boundary terms of each column are adjacent
Can be wrapped vertically to convert the cylinder into a
donut/tube shape