Professional Documents
Culture Documents
COE211 CH3 BooleanMinimization
COE211 CH3 BooleanMinimization
Simplification of Boolean
Functions
Overview
◼ Introduction to Karnaugh Maps
◼ Karnaugh Maps Rules and Methods
◼ Two and Three-Variable K-Maps
◼ Four-Variable K-Maps
◼ Simplification Techniques
◼ Don’t Cares Conditions
Rules to consider
● Every cell containing a 1 must be included at least once
● The largest possible “power of 2 rectangle” should be used
● Use the smallest possible number of rectangles
b b
0 1 0 1
a a
0 0 1 0 1 1
1 0 1 1 0 0
f=b g = a'
bc bc
a 00 01 11 10 a 00 01 11 10
0 0 0 1 0 0 0 0 1 1
1 0 1 1 1 1 0 0 1 1
cout = bc + ac + ab f=b
Cin
A B Cin S Cout
0 0 0 0 0
0 0 1 1 0
A 0 1 0 1 0
Adder S 0 1 1 0 1
B 1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
Cout 1 1 1 1 1
B
+
Cin
A B Cin S Cout
0 0 0 0 0
0 0 1 1 0
A 0 1 0 1 0
Adder S 0 1 1 0 1
B 1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
Cout +
1 1 1 1 1
B
Now we have to cover all the 1s in the
0 0 1 0 Karnaugh Map using the largest
rectangles and as few rectangles
A 0 1 1 1
as we can.
Cin Cout = BCin + AB + ACin
Karnaugh Map for Cout
B
0 1 0 1
A 1 0 1 0
C
1 0 1 1
0 1 1 1
B
0 0 1 1
A
1 0 1 1
D
F = C + A’BD + B’D’
9/27/2020 COE211: Digital Logic Design 15
Design Examples
C C C
0 1 1 1 1 0 0 0 0 0 0 0
0 0 1 1 0 1 0 0 1 0 0 0
B B B
0 0 0 0 0 0 1 0 1 1 0 1
A A A
0 0 1 0 0 0 0 1 1 1 0 0
D D
D
EQ C
1 0 0 0
0 1 0 0
B
0 0 1 0
A
0 0 0 1
K-map for EQ
9/27/2020 COE211: Digital Logic Design 17
Karnaugh Maps: Don’t Cares
● In some cases, outputs are undefined
● We “don’t care” if the circuit produces a ‘0’ or a ‘1’
● This knowledge can be used to simplify functions
A
AB
CD 00 01 11 10
00 0 0 X 0 - Treat X’s like either 1’s or 0’s
01 1 1 X 1 D
- Very useful
11 1 1 0 0 - OK to leave some X’s uncovered
C
10 0 X 0 0
B
0 X 1 0
6 prime implicants:
ABD', A'D, AC, A‘BC', CD, BC'D'
1 1 1 0
B
essential
1 0 1 1
A
5 prime implicants: 0 0 1 0
essential A
0 1 1 1