Overview

Last lecture Correspondence between canonical forms Boolean cubes Karnaugh maps Today More Karnaugh map examples Dont cares in Karnaugh maps Design examples

CSE 370 Winter 2002 Logic minimization - 1

Adjacencies in Karnaugh maps

Wrap from first to last column Wrap top row to bottom row

A
000 010 110 100

011 010 B 000 C A 110 001 100

111

C 001 011 111 101 B

101

CSE 370 Winter 2002 Logic minimization - 2

Karnaugh map examples

F=
1

A
1 0

Cout = f(A,B,C) = m(0,4,6,7)

A
0 0 1 1 1 0 1

AB + ACin + BCin

Cin 0 A
1 0 0 0 1 1 1

B obtain the complement of the function by covering 0s rather than 1s

AC + BC + AB

CSE 370 Winter 2002 Logic minimization - 3

More Karnaugh map examples

A
0 0 0 1 1 1 1

G(A,B,C) = A

B A
1 0 0 0 1 1 1

F(A,B,C) = m(0,4,5,7) = AC + BC

B A
0 1 1 1 0 0 0

F' simply replace 1's with 0's and vice versa F'(A,B,C) = m(1,2,3,6) = BC + AC

CSE 370 Winter 2002 Logic minimization - 4

Karnaugh map: 4-variable example

F(A,B,C,D) = m(0,2,3,5,6,7,8,10,11,14,15) F= C + ABD + BD
A
1 0 1 1 0 1 1 1 0 0 1 1 1 0 1 1

0111

1111

0000

1000

find the smallest number of the largest possible subcubes to cover the ON-set (fewer terms with fewer inputs per term)

CSE 370 Winter 2002 Logic minimization - 5

Karnaugh maps: dont cares

f(A,B,C,D) = m(1,3,5,7,9) + d(6,12,13) without don't cares f = AD + BCD

A
0 1 0 1 X X 0 0 0 1 0 0

1
0

1
X

CSE 370 Winter 2002 Logic minimization - 6

Karnaugh maps: dont cares (contd)

f(A,B,C,D) = m(1,3,5,7,9) + d(6,12,13) f = A'D + B'C'D without don't cares f = A'D + C'D with don't cares

A
0 1 1 0 0 1 1 X X X 0 1

by using don't care as a "1" a 2-cube can be formed rather than a 1-cube to cover this node don't cares can be treated as 1s or 0s depending on which is more advantageous

0
0

0
0

CSE 370 Winter 2002 Logic minimization - 7