Karnaugh Map

Objective:
Simplify Boolean functions and their logic gates implementation Why Karnaugh map? (simplicity)

3- and 4-Variable K-Maps

3-variable
x1x0 x2 00 0 0 1 4 01 1 5 11 3 7 10 2 6

Format:

y Edge: variable x 0 0 0 Square: minterm 1 2 x 0 0 1 1 y 0 1 0 1 F 0/1 0/1 0/1 0/1

1 1 3

4-variable
x3x2 x1x0 00 00 0 01 4 11 12 10 8 01 11 10

0 1 2 3

y y x y x xy xy x xy xy

1 5 13 9

3 7 15 11

2 6 14 10

ENEE244: Digital Logic Design

ENEE244: Digital Logic Design

Function Representation
z(x2,x1,x0) = x2x1x0+ x2x1x0+ x2x1x0+ x2x1x0
x1x0 x2 00 0 1 1 01 1 11 1 10 1

Function Simplification
Idea: merge adjacent squares Rules:
y x 0 0 1 1 xy+xy = x xy+xy = y

z(x3,x2,x1,x0) = m(1,2,4,9,10,11,12, 14,15)

x3x2 x1x0 00 00 01 1 11 10 01 11 10

1 1 1

1 1 1

x1x0 x2 00 0 1

01

11

10

x2x1

1 1

x2x1x0+ x2x1x0+ x2x1x0+ x2x1x0 = x2x1+ x2x1 = x1

ENEE244: Digital Logic Design

ENEE244: Digital Logic Design

More Rules
Rules:
x1x0 x2 00 0 1 01 11 10 x2x0 x2

Function Simplification
Example 1:
x1x0 x2 00 0 1 1 1 01 1 1 11 1 10 1

x2x1x0+ x2x1x0= x2x0 x1x0 x2 00 0 1 1 1 01 11 10 1 1

18 literals 5 literals

Example 2:
x1x0 x2 00 0 1 1 1 01 1 11 1 10 1 1

x2x1x0+ x2x1x0+ x2x1x0+ x2x1x0 = x1x0+ x1x0 = x0

ENEE244: Digital Logic Design

18 literals 2 literals

ENEE244: Digital Logic Design

Summary
Structure of 2-,3-,4-variable Karnaugh maps Function representation 3-variable Boolean function simplification Next class:
4-variable Boolean function simplification

Quiz: Represent and simplify the

following function using K-map.

z(x2,x1,x0) = m(1,3,4,5,6,7)
ENEE244: Digital Logic Design