Lecture

On
Karnaugh Map (K-Map)
Delivered By: Mr. RAJESH KUMAR
A.P.- ECE
 K-Maps, like truth tables, are a way to show
the relationship between logic inputs and
desired outputs.
 K-Maps are a graphical technique used to
simplify a logic equation.
 K-Maps are very procedural and much cleaner
than Boolean simplification.
 K-Maps can be used for any number of input
variables, BUT are only practical for fewer than
six.
 Each minterm in a truth table corresponds to a cell
in the K-Map.
 K-Map cells are labeled so that both horizontal and
vertical movement differ only in one variable.
 Once a K-Map is filled (0’s & 1’s) the sum-of-
products expression for the function can be
obtained by OR-ing together the cells that contain
1’s.
 Since the adjacent cells differ by only one variable,
they can be grouped to create simpler terms in the
sum-of-product expression.
 X X
X Y Z 0 1

minterm 0  0 0 1 Y 1 1
minterm 1  0 1 0 0 0 2

minterm 2  1 0 1 0 1
Y 1 3
minterm 3  1 1 1 1
 X X X X

Y 1 0 X Y Y 0 1 X Y

Y 0 0 Y 0 0

X X X X

Y 0 0 Y 0 0

Y 1 0 Y 0 1 X Y
X Y
 X Y X X X Y

Y 1 1

Y 0 0
1
Z = X Y + X Y = Y (X + X) = Y

X X

Y 1 1 Y=Z

Y 0 0
 Grouping a pair of adjacent 1’s eliminates the
variable that appears in complemented and
uncomplemented form.
 Grouping a quad of 1’s eliminates the two

variables that appear in both complemented and

uncomplemented form.
 Grouping an octet of 1’s eliminates the three

variables that appear in both complemented and

uncomplemented form, etc…..
 X X X X

Y 1 1 Y Y 1 0 X

Y 0 0 Y 1 0

X X X X

Y 0 0 Y 0 1

X
Y 1 1 Y Y 0 1
 X X
1
Y 1 1

Y 1 1
R S T R R
0 0 1
S 1 1
0 1 0 0 2

S
1 0 1 S 0 0
1 1 0
1 3

T = F(R,S) = S
 A B C Y A A

minterm 0  0 0 0 1 B C 1 0
0 4
minterm 1  0 0 1 0
minterm 2  0 1 0 1 B C 0 0
1 5
minterm 3  0 1 1 1
B C 13 0
minterm 4  1 0 0 0 7
minterm 5  1 0 1 0
B C 1 1
minterm 6  1 1 0 1 2 6

minterm 7  1 1 1 0
 A B C Y
minterm 0  0 0 0 1
minterm 1  0 0 1 0 A B A B A B A B
minterm 2  0 1 0 1 C 1 1 1 0
0 2 6 4
minterm 3  0 1 1 1
minterm 4  1 0 0 0 C 0 1 0 0
1 3 7 5
minterm 5  1 0 1 0
minterm 6  1 1 0 1
minterm 7  1 1 1 0
 A B A B A B A B

C 001
0 10
010 1001 01
0101
A
AB
B
B C
C
C
B
C 010
0
1 001
0 100
01 0101
0
 A B A B A B A B

C 0
1 1
0 1
0 0
1
B
AB
C
C 0
1 1
0 1
0 0
1
 A B A B A B A B

C 1 1 1 1
1
C 1 1 1 1
1. Construct the K-Map and place 1’s in cells corresponding to
the 1’s in the truth table. Place 0’s in the other cells.
2. Examine the map for adjacent 1’s and group those 1’s which
are NOT adjacent to any others. These are called isolated 1’s.
3. Group any hex.
4. Group any octet, even if it contains some 1’s already grouped,
but are not enclosed in a hex.
5. Group any quad, even if it contains some 1’s already grouped,
but are not enclosed in a hex or octet.
6. Group any pair, even if it contains some 1’s already grouped,
but are not enclosed in a hex, octet or quad.
7. Group any single cells remaining.
8. Form the OR sum of all the terms grouped.
J K L M
J K J K J K J K
0 0 0 1
0 0 1 0 L 1 1 0 0
0 2 6 4

0 1 0 1 J L
L 0 1 0 1
0 1 1 1 1 3 7 5

1 0 0 0
1 0 1 1
1 1 0 0 J K J K L
1 1 1 0

M = F(J,K,L) = J L + J K + J K L
A B C Z
0 0 0 1 BC A B A B A B A B
0 0 1 0 1 0 0 1
C
0 1 0 0 0 2 6 4

0 1 1 0 C 0 0 1 1
1 3 7 5
1 0 0 1
1 0 1 1
AC
1 1 0 0
1 1 1 1
Z = F(A,B,C) = A C + B C
A B C F2
0 0 0 1 B C B C B C B C
0 0 1 0 1 0 1 0 AC
A 0 1
0 1 0 0 AB
3 2

0 1 1 1 A 1 1 1 0
4 5 7 6
1 0 0 1
1 0 1 1
1 1 0 0 BC BC
1 1 1 1 F2 = F(A,B,C) = B C + B C + A B
F2 = F(A,B,C) = B C + B C + A C
 W X Y Z F1
minterm 0  0 0 0 0 1
minterm 1  0 0 0 1 0 WX WX WX WX
minterm 2  0 0 1 0 0
minterm 3  0 0 1 1 0 Y Z 1 1 0 1
minterm 4  0 1 0 0 1 0 4 12 8

minterm 5  0 1 0 1 1
minterm 6  0 1 1 0 0 Y Z 0 1 1 1
1 5 13 9
minterm 7  0 1 1 1 1
minterm 8  1 0 1
0 0
Y Z 0 1 1 0
minterm 9  1 0 0 1 1 3 7 15 11
minterm 10  1 0 1 0 0
minterm 11  1 0 1 1 0
Y Z 0 0 1 0
minterm 12  1 1 0 0 0 2 6 14 10

minterm 13  1 1 0 1 1
minterm 14  1 1 1 0 1
minterm 15  1 1 1 1 1
 WX WX WX WX

Y Z 1
0 0
1 0
1 1
0

Y Z 0
1 0 0 0
1
XXXZZZ
Y Z 0
1 0 0 0
1

Y Z 1
0 0
1 0
1 1
0
 W X Y Z F1
WX WX WX WX
min 0  0 0 0 0 1 WXY
0 0 0 1 0 Y Z 1 1 1 0
0 0 1 0 1 0 4 12 8

0 0 1 1 0
0 1 0 0 1 Y Z 0 0 1 0
1 5 13 9
0 1 0 1 0
0 1 1 0 1
Y Z 0 0 0 0
0 1 1 1 0
3 7 15 11
1 0 0 0 0
1 0 0 1 0
Y Z 1 1 0 1
1 0 1 0 1 2 6 14 10

1 0 1 1 0
1 1 0 0 1 WZ XYZ
1 1 0 1 1
0
F1 = F(w,x,y,z) = W X Y + W Z + X Y Z
1 1 1 0
min 15  1 1 1 1 0
 WX WX WX WX
W X Y Z F2
min 0  0 0
X Y Z
0 0 1
0 0 0 1 x Y Z 1 X 0 1
0 0 1 0 1 0 4 12 8

0 0 1 1 0
0 1 0 0 0 Y Z 0 X X 0
1 5 13 9
0 1 0 1 x
0 1 1 0 0
Y Z X 1 1 1 YZ
0 1 1 1 x 3 7 15 11

1 0 0 0 x
1 0 0 1 1
Y Z X 1 1 0
1 0 1 0 0 2 6 14 10

1 0 1 1 1
1 1 0 0 x XY
1 1 0 1 1
1
F2 = F(w,x,y,z) = X Y Z + Y Z + X Y
1 1 1 0
1 1 1 1 1
min 15 