KARNAUGH MAPS

 Graphical Device used to simplify Boolean

expression

 Tool to produce minimal SOP form

 Minimal number of product term and

minimal number of literal in each product
term

 Leads to minimal two level implementation

BITS Pilani, Pilani Campus
 Another example:

yz
wx 00 01 11 10 Largest possible
group of 1’s
00 1 1 Prime
F= w’y’+ Implicant term
wx’y +wxz 01
1 1
11 Final MSP will
1 1 contain subset
10 of Prime
1 1
implicant terms
If any minterm belong to only one group then that PI is essential PI
BITS Pilani, Pilani Campus
Simplify the function

F(w,x,y,z) = m(3,4,6,7,11,12,13,14,15)

1 1 1

1 1 1 1

F = xz’+ wx + yz. All are essentials PIs

BITS Pilani, Pilani Campus
Don’t Care Conditions

- Unspecified outputs for certain inputs

- Used in Map to provide further simplification

- X is marked inside the square for don’t care input

- Choose to include each don’t care minterm with

either 1 or 0

BITS Pilani, Pilani Campus

BITS Pilani, Pilani Campus
Simplify the function

F(w,x,y,z) = m(0,2,4,5,8,14,15) + d(7,10,13)

1 1

1 1 X

X 1 1

1 X

BITS Pilani, Pilani Campus

POS Simplification

Combine valid adjacent squares containing 0’s

Obtain simplified expression of the

complement in SOP form

Compliment further to get function in POS

form

BITS Pilani, Pilani Campus

F(A,B,C,D) = (0,1,2,5,8,9,10)

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

BITS Pilani, Pilani Campus

F(A,B,C,D) = (0,1,2,5,8,9,10)

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

BITS Pilani, Pilani Campus

F’ = AB + CD + BD’

By De Morgan’s

F = (A’+B’) (C’+D’)(B’+D)

BITS Pilani, Pilani Campus

BITS Pilani, Pilani Campus
BITS Pilani, Pilani Campus