Professional Documents
Culture Documents
0 1 3 2
1 1
4 5 7 6
1 1
F = x’y’ + xy
0 1 3 2
1 1 1
4 5 7 6
1 1
F = y’ + x’z
(c) F(x, y, z) = ∑(1, 3, 5, 7)
0 1 3 2
1 1
4 5 7 6
1 1
F=z
(d) F(x, y, z) = ∑(1, 4, 5, 6, 7)
0 1 3 2
1
4 5 7 6
1 1 1 1
F = x + y’z
(e) F(x, y, z) = xy + x’y’z’ + x’yz’
11 000 010
0 1 3 2
1 1
4 5 7 6
1 1
F = xy + x’z’
0 1 3 2
1 1 1 1
4 5 7 6
1
F = x’ + yz
0 1 3 2
1 1 1
4 5 7 6
1 1
F = z’ + x’y
(h) F(x, y, z) = xyz + x’y’z + xyz’
111 001 110
0 1 3 2
1
4 5 7 6
1 1
F = xy + x’y’z
0 1 3 2
1
4 5 7 6
1
12 13 15 14
1 1
8 9 11 10
1 1 1
F = AC + AB’D + A’C’D
0 1 3 2
1 1
4 5 7 6
1 1 1 1
12 13 15 14
8 9 11 10
1 1
3.3 Simplify the following Boolean functions, using four-variable maps:
(a) A'B'C'D' + A'CD' + AB'D' + ABCD + A'BD
0 0 0 0 010 100 1111 011
0 1 3 2
1 1
4 5 7 6
1 1 1
12 13 15 14
1
8 9 11 10
1 1
0 1 3 2
1 1
4 5 7 6
1
12 13 15 14
1 1
8 9 11 10
1 1
0 1 3 2
1 1 1
4 5 7 6
1 1
12 13 15 14
1 1
8 9 11 10
1 1 1
F = CD + A’BD + AC + B’D’
0 1 3 2
1 1
4 5 7 6
1
12 13 15 14
1 1 1 1
8 9 11 10
1 1
F = wx + yz + x’y
3.4 Find all the prime implicants for the following Boolean functions, and
determine which are essential:
0 1 3 2
1 1 1 X
4 5 7 6
X 1 1 X
0 1 3 2
1 X
4 5 7 6
1 X
12 13 15 14
X 1
8 9 11 10
1 1
0 1 3 2
X
4 5 7 6
1 1 1
12 13 15 14
X 1 1
8 9 11 10
X 1
d) F(A,B,C,D) = ∑(2, 4, 7, 10, 12, 14) , d(A,B,C,D) = ∑(0, 3, 6, 8, 13)
0 1 3 2
X X 1
4 5 7 6
1 1 X
12 13 15 14
1 X 1
8 9 11 10
X 1
3.6 Simplify the following functions and implement them with two-level
NAND gate circuits:
(a) F(A, B, C, D) = A’B’C + AC’ + ACD + ACD’ + A’B’D’
0 0 1 10 111 11 0 000
0 1 3 2
1 1 1
4 5 7 6
12 13 15 14
1 1 1 1
8 9 11 10
1 1 1 1
F = A + B’D’ + B’C
(b) F(A, B, C, D) = AB + A’BC + A’B’C’D
11 011 0 0 0 1
0 1 3 2
1
4 5 7 6
1 1
12 13 15 14
1 1 1 1
8 9 11 10
F = BC + AB + A’B’C’D
3.7 Draw a logic diagram using only two-input NOR gates to implement the
following function : 𝐹(𝐴, 𝐵, 𝐶,𝐷) = (𝐴⨁𝐵) ′ (𝐶⨁𝐷)
(𝐴⨁𝐵) ′ (𝐶⨁𝐷) = ( AB + A’B’ ) ( CD’ + C’D )
= ABCD’ + ABC’D + A’B’CD’+ A’B’C’D
1110 1101 0010 0001
0 1 3 2
0
4 5 7 6
0 0 0
12 13 15 14
0 0 0
8 9 11 10
0 0
F’ = xz’ + yz + wx’z
F = ( x’+ z ) ( y’ + z’ ) ( w’ + x + z’ )
(b) F(A, B, C, D) = π( 1, 3, 5, 7, 13, 15 )
0 1 3 2
0 0
4 5 7 6
0 0
12 13 15 14
0 0
8 9 11 10
0 1 3 2
0 0
4 5 7 6
0
12 13 15 14
0 0
8 9 11 10
0 0
3.13 Simplify the following Boolean functions to sum of products ( SOP ) and
product of sums ( POS )
(a) x’z’ + y’z’ + yz’ + xy
00 0 0 10 11
0 1 3 2
1 1
4 5 7 6
1 1 1
(b) ACD’ + C’D + AB’ + ABCD
110 0 1 10 1111
0 1 3 2 0 1 3 2
1 0 0 0
4 5 7 6 4 5 7 6
1 0 0 0
12 13 15 14 12 13 15 14
1 1 1 0
8 9 11 10 8 9 11 10
1 1 1 1
(c) ( A + C’ + D’ ) ( A’ + B’ + D’ ) ( A’ + B + D’ ) ( A’ + B + C’ )
0 1 3 2 0 1 3 2
1 1 1 0
4 5 7 6 4 5 7 6
1 1 1 0
12 13 15 14 12 13 15 14
1 1 0 0
8 9 11 10 8 9 11 10
1 0 0 0
F’ = CD + AD + AB’C
F = A’C’ + C’D’ + A’D’ + BD’ F = ( C’ + D’ ) ( A’ + D’ ) ( A’ + B + C’ )
(d) ABC’ + AB’D + BCD
1 1 0 1 0 1 1 1 1
0 1 3 2 0 1 3 2
0 0 0 0
4 5 7 6 4 5 7 6
1 0 0 0
12 13 15 14 12 13 15 14
1 1 1 0
8 9 11 10 8 9 11 10
1 1 0 0
By : N.Y