Professional Documents
Culture Documents
DLD Week 6 - Prime Implicants and Kmap Design + Wrap Up
DLD Week 6 - Prime Implicants and Kmap Design + Wrap Up
CD 00 01 11 10
AB
00 1 1
01 1
11
10 1
F becomes 1 when:
CD 00 01 11 10
AB ABCD is 0000
00 1 1 ABCD is 1001
01 1 ABCD is 0111
ABCD is 0010
11
10 1
F becomes 1 when:
CD 00 01 11 10
The implicants are: AB ABCD is 0000
A’B’C’D’ 00 1 1 ABCD is 1001
AB’C’D 01 1 ABCD is 0111
A’BCD ABCD is 0010
11
A’B’CD’
10 1
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group(s)
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
CD 00 01 11 10 • Go to a 1.
AB • Form the largest possible group(s)
00 1 1 1
with adjacent 1’s
01 1 1 • If there are more adjacent 1’s
11 1 1 remaining, then group with those
1 1 1’s too in the largest possible way.
10 • Repeat for all the other 1’s
• Example 2-11
• Exercise 2-20 (a,b,c)
• F(A,B,C,D,E)= ∑m(0,5,6,8,9,10,11,16,20,24,25,26,27)
• F(A,B,C,D,E)= ∏M (0,5,6,8,9,10,11,16,20,24,25,26,27)
•
• F(A,B,C,D,E)= ∑m(0,5,6,8,9,10,11,16,20,24,25,26,27)
• F(A,B,C,D,E)= ∏M (0,5,6,8,9,10,11,16,20,24,25,26,27)
Chapter 2 - Part 3 63
Buffer
• A buffer is a gate with the function F = X:
X F
Chapter 2 - Part 3 64
NAND Gate
• AND-Invert
X
Y F (X , Y , Z ) = X Y Z
Z
• Invert -OR
X
Y F (X , Y , Z ) = X + Y + Z
Z
• OR-Invert (NOR)
X
Y F (X , Y , Z ) = X +Y + Z
Z
• Invert-AND
X
Y
Z
Chapter 2 - Part 3 69
Exclusive OR/ Exclusive NOR
X Y X Y X Y (X Y)
or X Y
0 0 0 0 0 1
0 1 1 0 1 0
1 0 1 1 0 0
1 1 0 1 1 1
X Y X Y X Y (X Y)
or X Y
0 0 0 0 0 1
0 1 1 0 1 0
1 0 1 1 0 0
1 1 0 1 1 1
X 0 X X 1 X
X X =0 X X =1
X Y = Y X
(X Y ) Z = X (Y Z ) = X Y Z
Exercise 2-3(b) +:
➢WY + W’YZ’ + WXZ + W’XY’ = WY + W’XZ’ + X’YZ’ + XY’Z