K-Map

Mr. Imran Ahmad

 Karnaugh Maps (K-Maps)

• A visual way to simplify logic expressions

• It gives the most simplified form of the expression
 Rules to obtain the most simplified expression
•Simplification of logic expression using Boolean algebra is awkward
because:
– it lacks specific rules to predict the most suitable next step in the simplification
process
– it is difficult to determine whether the simplest form has been achieved.
•A Karnaugh map is a graphical method used to obtained the most
simplified form of an expression in a standard form (Sum-of-Products or
Product-of-Sums).
•The simplest form of an expression is the one that has the minimum
number of terms with the least number of literals (variables) in each term.
•By simplifying an expression to the one that uses the minimum number of
terms, we ensure that the function will be implemented with the minimum
number of gates.
•By simplifying an expression to the one that uses the least number of
literals for each terms, we ensure that the function will be implemented
with gates that have the minimum number of inputs.
 Three-Variable K-Maps

f   (0,4)  B C f   (4,5)  A B f   (0,1,4,5)  B f   (0,1,2,3)  A

BC BC BC BC
A 00 01 11 10 A 00 01 11 10 A 00 01 11 10 A 00 01 11 10
0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 1 1 1

1 1 0 0 0 1 1 1 0 0 1 1 1 0 0 1 0 0 0 0

f   (0,4)  A C f   (4,6)  A C f   (0,2)  A C f   (0,2,4,6)  C

BC BC BC BC
A 00 01 11 10 A 00 01 11 10 A 00 01 11 10 A 00 01 11 10
0 0 1 1 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1
1 0 0 0 0 1 1 0 0 1 1 0 0 0 0 1 1 0 0 1
 Three-Variable K-Map Examples
BC BC BC
A 00 01 11 10 A 00 01 11 10 A 00 01 11 10
0 1 0 1 1 1 0 1 1

1 1 1 1 1 1 1 1 1 1

BC BC BC
A 00 01 11 10 A 00 01 11 10 A 00 01 11 10
0 1 0 1 1 1 0

1 1 1 1 1 1 1 1
 Four-Variable K-Maps
CD CD CD CD
AB 00 01 11 10 AB 00 01 11 10 AB 00 01 11 10 AB 00 01 11 10
00 1 0 0 0 00 0 0 0 0 00 0 0 0 0 00 0 0 0 0

01 0 0 0 0 01 0 1 0 0 01 0 0 0 0 01 1 0 0 1

11 0 0 0 0 11 0 1 0 0 11 0 1 1 0 11 0 0 0 0

10 1 0 0 0 10 0 0 0 0 10 0 0 0 0 10 0 0 0 0

f   (5,13)  B  C  D f   (13,15)  A  B  D f   (4,6)  A  B  D

f   (0,8)  B  C  D

CD CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB AB
00 0 0 1 1 00 0 0 0 0 00 0 0 1 1 00 1 0 0 1

01 0 0 1 1 01 1 0 0 1 01 0 0 0 0 01 0 0 0 0

11 0 0 0 0 11 1 0 0 1 11 0 0 0 0 11 0 0 0 0

10 0 0 0 0 10 0 0 0 0 10 0 0 1 1 10 1 0 0 1

f   (2,3,6,7)  A  C f   (4,6,12,14)  B  D f   (2,3,10,11)  B  C f   (0,2,8,10) B  D

 Four-Variable K-Maps
CD CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB AB
00 0 0 0 0 00 0 0 1 0 00 1 0 1 0 00 0 1 0 1
01 1 1 1 1 01 0 0 1 0 01 0 1 0 1 01 1 0 1 0

11 0 0 0 0 11 0 0 1 0 11 1 0 1 0 11 0 1 0 1
10 0 0 0 0 10 0 0 1 0 10 0 1 0 1 10 1 0 1 0

f   (0, 3,5, 6, 9,10,12,15) f   (1, 2, 4, 7,8,11,13,14)

f   (4,5, 6, 7)  A  B f   (3,7,11,15)  C  D
f  A  BC D f  A  BC D

CD CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB AB
00 0 1 1 0 00 1 0 0 1 00 0 0 0 0 00 1 1 1 1

01 0 1 1 0 01 1 0 0 1 01 1 1 1 1 01 0 0 0 0
11 0 1 1 0 11 1 0 0 1 11 1 1 1 1 11 0 0 0 0

10 0 1 1 0 10 1 0 0 1 10 0 0 0 0 10 1 1 1 1

f   (1, 3,5, 7, 9,11,13,15) f   (0,2,4,6,8,10,12,14) f   (4,5,6,7,12,13,14,15) f   (0,1,2,3,8,9,10,11)

fD f D f B f B
 Four-Variable K-Maps Examples

CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB
00 1 1 1 00 1 1 1 00

01 1 1 1 01 1 01 1 1 1
11 1 1 1 11 11 1 1 1

10 1 1 10 1 1 1 10 1

CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB
00 1 1 00 00

01 1 1 1 1 01 01

11 1 1 1 11 11

10 1 10 10