Documente Academic
Documente Profesional
Documente Cultură
3-1.
Place a 1 in each K-map cell where 2 or more inputs are equal to 1.
Y
1
X
F = XZ + XY + YZ
1 1
Z
3-2.*
C
F = AB + AC
3-3.
CD
AB
CD
00 01 11 10
AB
00
00
01
01
11 1
10
CD
00 01 11 10
AB
01
W=A B C D + A B C D
10 1
10
X =A B C D + A B C + A B D
00 01 11 10
01 1
11 1
11
1
AB
00
00
1
11
1
CD
00 01 11 10
Y =A B (C D + C D) + A B(C D + C D)
10 1
Z =A B D + B C D + A B D
3-4. a) For the 3 x 3 pattern, there are exactly three row, three column and two diagonal combinations that
represent a win for the X player: W = X1 X2 X3 + X4 X5 X6 + X7 X8 X9 + X1 X4 X7 + X2 X5 X8 + X3 X6 X9
+ X1 X5 X9 + X3 X5 X7 Gate Input cost = 32
b) W = X5 (X1 X9 + X2 X8 + X3 X7 + X4 X6) + X1 X2 X3 + X1 X4 X7 + X7 X8 X9 + X3 X6 X9 Gate Input Cost = 30
3-5. a) For the 4 x 4 pattern, there are exactly four row, four column and two diagonal combinations that represent a
win for the X player: W = X1 X2 X3 X4 + X5 X6 X7 X8 + X9 X10 X11 X12 + X13 X14 X15 X16 + X1 X5 X9 X13
X2 X6 X10 X14 + X3 X7 X11 X15 + X4 X8 X12 X16 + X1 X6 X11 X16 + X4 X7 X10 X13 Gate Input cost = 50
b) W = X1(X2 X3 X4 + X5 X9 X13 + X6 X11 X15) + X7(X5 X6 X8 + X3 X11 X15 + X4 X10 X13) + X9 X10 X 11 X12
+ X13 X14 X15 X16 + X2 X6 X10 X14 + X4 X8 X12 X16 Gate Input Cost = 48
25
3-6.
a) Detecting a change in one-out-ofthree inputs can be done using a
parity function as Z. The truth
table shown is for even parity.
For this case,
Z = X1 X2 X3
If odd parity is chosen, then an
alternative result for Z is:
X1
0
0
0
0
1
1
1
1
X2
0
0
1
1
0
0
1
1
X3
0
1
0
1
0
1
0
1
Z
0
1
1
0
1
0
0
1
Z = X1 X2 X3
3-7.+
B
B
GNS
A
C
GEW = AB + AC
GNS = AC + AB
A
B
C
D
A
B
C
D
YNS
YNS = ABCD
B
0
0
1
1
0
0
1
1
C S5 S4
0 0 0
1 0 0
0 0 0
1 0 0
0 0 1
1 0 1
0 1 0
1 1 1
S3
0
0
0
1
0
1
0
0
S2
0
0
1
0
0
0
1
0
B
C
D
B
C
D
RNS
RNS = A + BCD
S1 S0
0 0
0 1
0 0
0 1
0 0
0 1
0 0
0 1
26
YEW
YEW = ABCD
3-8.
A
0
0
0
0
1
1
1
1
GEW
S0 = C
S1 = 0
S2 = ABC + ABC
S3 = ABC + ABC
S4 = AB + AC
S5 = AB
REW
REW = A + BCD
3-9.+
A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
C
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
A
0
0
0
0
0
0
0
0
1
1
B C
0 0
0 0
0 1
0 1
1 0
1 0
1 1
1 1
0 0
0 0
1010 to
1111
D S2 S1 S0
0 0 0 0
1 0 0 1
0 0 0 1
1 0 1 0
0 0 1 0
1 0 1 0
0 0 1 0
1 0 1 1
0 0 1 1
1 0 1 1
0 0 1 1
1 0 1 1
0 0 1 1
1 1 0 0
0 1 0 0
1 1 0 0
S0 = B C D + B C D + AB + AC D + ABCD
S1 = AB + AB + ACD + BC D
S2 = ABC + ABD
3-10.
D W X
0 0 1
1 0 1
0 1 0
1 1 0
0 1 0
1 1 0
0 1 1
1 1 1
0 1 1
1 1 1
Y
1
1
0
0
1
1
0
0
1
1
Z
0
1
0
1
0
1
0
1
0
1
W=A+B+C
X = B C + BC
Y=C
Z=D
XXXX
3-11.
a)
PS LS RS RR PL LL RL
0 0 0 0 0 0 0
0 0 0 1 0 0 0
0 0 1 0 0 0 1
0 0 1 1 0 0 1
0 1 0 0 0 1 0
0 1 0 1 0 1 0
0 1 1 0 0 0 1
0 1 1 1 0 1 0
1 0 0 0 1 0 0
1 0 0 1 1 0 0
1 0 1 0 1 0 0
1 0 1 1 1 0 0
1 1 0 0 1 0 0
1 1 0 1 1 0 0
1 1 1 0 1 0 0
1 1 1 1 1 0 0
PL = PS
LL = PS LS RS + PS LS RR
RL = PS LS RS + PS RS RR
b)
PL
PS
LS
LL
RS
RL
RR
27
3-12.
C
a)
1
1
1
1
A
1
C
1
1
1
1
1 1
1 1
C
1
C
1
C
1 1
1
1
A
1
b)
a = AC + A B D + ABD + AB C
b = A B + B C + A C D + ACD
c = AB + B C + AD
d = ABCD + AB C + A B D + A BC + ACD
e = B C D + ACD
f = AB C + ABD + ABC + A C D
g = AB C + ABC + A BC + ACD
c) The following gate input counts include input inverters and share AND gates.
Total gate inputs for this solutions = 74. Total gate inputs for book solution is 70. The book solution is better by 4 gate inputs.
3-13.
X
Hierarchy
X
Y
Z
W=XZ + YZ
Z
Hierarchy
X
Y
Z
F = A(CE + DE) + AD
C
D
E
Hierarchy
X
Y
Z
Hierarchy
X
Y
Z
28
G = B(CE + DE) + BC
3-14.
Hierarchy
X
Y
Z
Hierarchy
X
Y
Z
BC+BD
D
Hierarchy
X
Y
Z
BC+BD
3-15.+
b)
a)
c)
Part b requires 6 fewer gates.
A
B
C
D
E
F
G
H
A
B
C
D
E
F
G
H
3-16.
A
B
C
A
B
C
D
E
F
D
E
F
a) Original circuit
D
E
F
c) Cancel inverters
29
3-17.
A
A
B
C
D
E
F
B
C
D
a) Original circuit
F
B
C
D
G
B
C
D
c) Manipulate inverters
d) Cancel inverters
3-18.
C
D
C
D
G
E
F
A
a) Original circuit
C
D
C
D
F
A
F
A
c) Manipulate inverters
B
d) Cancel inverters
30
3-19.
C
D
G
C
D
E
F
A
G
E
F
A
B
a) Original circuit
H
C
G D
D
E
F
G
E
F
c) Manipulate inverters
3-20.
T1 = X Y
T2 = X Y
T3 = X Y
F = XY + X Y
X
T2
T1
F
T3
3-21.
Y 0 = ABCE
Y 1 = ABCE
G1
Y 2 = ABCE
G2A
G2B
= G1 G2A G2B
Y 3 = ABCE
Y 4 = ABCE
Y 5 = ABCE
Y 6 = ABCE
Y 7 = ABCE
31
3-22.
A
B
C
G1
G2A_n
G2B_n
Y 11111111
01111111
10111111
11011111
11101111
11110111
11111011
11111101
11111110
11111111
[0]
[1]
[2]
[3]
[4]
[5]
[6]
[7]
100
200
300
400
500
600
3-23.
10
11
13
12
14
15
A
B
C
D
W
X
Y
Z
20
40
60
80
100
120
140
3-24.*
a)
b)
VDD
F7
G7
F6
G6
F5
G5
F4
G4
F3
G3
F2
G2
F1
G1
F0
G0
3-25.
a)
b)
VDD
VDD
F7
G7
3
2
F6
F5
F4
F3
G4
1
0
F2
G6
G5
G3
G2
F1
G1
F0
G0
32
160
3-26.
a)
b)
11
9
7
5
3
1
12
5
4
3
2
1
0
G(3:0)
F(3:0)
7:4
3:0
3-27.
V = A = ( S0 S1 S2 S3 S 4 S5 ) + M
S5
S4
S3
S2
S1
S0
C = V
A = (S 0 S1 S2 S3 S4 S5 ) + M
L = A
A
L
V
C
3-28.
A0
A1
A2
DECODER
0
A0
1
A1
2
A2
D0
3
4
5
6
7
D1
D2
D3
D4
D5
D6
D7
A3
DECODER
0
A0
1
A1
2
A2
D8
D9
3
4
5
6
7
D10
D11
D12
D13
D14
D15
33
3-29.
DECODER
A0
A1
DECODER
A2
A3
A0
A1
EN
EN
A0
A1
En
0
1
2
3
0
1
2
3
D0
D1
D2
D3
DECODER
A0
A1
A0
A1
En
0
1
2
3
D4
D5
D6
D7
DECODER
A0
A1
A0
A1
En
0
1
2
3
D8
D9
D10
D11
DECODER
A0
A1
A0
A1
En
0
1
2
3
D12
D13
D14
D15
3-30.*
D0
D1
D2
D3
D4
D5
D6
D7
D8
DECODER
A0
A1
A2
A0
A1
A2
0
1
2
3
4
5
6
7
D9
D10
D11
D12
D13
A3
A4
D14
DECODER
0
A0
1
A1
D15
2
3
D16
D17
D18
D19
D20
D21
D22
D23
D24
D25
D26
D27
D28
D29
D30
D31
34
A0
A1
A0
A1
0
1
2
3
D0
D1
D2
DECODER
A0
A2
D3
0
1
D4
D5
3-32.
a) The Truth Table:
X2 X1 X0
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
b) A = {d}
B = {a,g}
C = {c. e}
D = {b, f}
a
d
0
1
1
1
1
1
d
Note: a = g, b = f, and c = e.
b
d
0
0
0
1
1
1
d
A
X2
c
d
0
0
0
0
0
1
d
d
d
1
0
1
0
1
0
d
e
d
0
0
0
0
0
1
d
f
d
0
0
0
1
1
1
d
X0
g
d
0
1
1
1
1
1
d
DECODER
X0
X1
X2
X0
d 1
X1
X2
1
A = X0
A0
A1
A2
0
1
2
3
4
5
6
7
a
g
b
f
c
e
d
X0
C
d
X1
X2 1
B = X1 + X2
d
d
X1
X2 1
1
C = X1X2
3-33.
D0
A1
D1
D2
D3
A2
D4
D5
D6
D7
EN
35
d
1
D = X2
A0
X0
X1
3-34.
K-Map for GE5: BCD = (C3,C2, C1, C0)
B0
B1
B2
B3
C1
C3
C2
C0
GE5 = C3 + C2 (C1 + C0)
C2
C1
C0
D0
D1
1 D2
2 D3
3 D4
4 D5
5 D6
6 D7
7 D8
8 D9
9 D10
10 D11
11 D12
12 D13
13 D14
14 D15
15
DECODER
0
A0
P0
A1
A2
A3
P1
P2
P3
P4
GE5
C3
P5
P6
P0
P0
P0
3-35.*
D3
0
X
X
X
1
D1
A1
D2 D1 D0 A1 A0 V
0 0 0 X X 0
X X 1 0 0 1
X 1 0 0 1 1
1 0 0 1 0 1
0 0 0 1 1 1
X
1
D3
D2
A0 = D 0( D 1 + D 2 )
1
1
1
1
1
D0
8
0
0
0
0
0
0
0
0
0
1
X
7
0
0
0
0
0
0
0
0
1
X
X
6
0
0
0
0
0
0
0
1
X
X
X
Decimal Inputs
5 4 3 2
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 1
0 0 1 X
0 1 X X
1 X X X
X X X X
X X X X
X X X X
X X X X
1
0
0
1
X
X
X
X
X
X
X
X
A0
Binary Outputs
0 A3 A2 A1 A0
0 X X X X
1 0 0 0 0
X 0 0 0 1
X 0 0 1 0
X 0 0 1 1
X 0 1 0 0
X 0 1 0 1
X 0 1 1 0
X 0 1 1 1
X 1 0 0 0
X 1 0 0 1
36
D3
D1
X
D3
9
0
0
0
0
0
0
0
0
0
0
1
D2
A0
A1 = D 0D 1
3-36.
A1
1
D0
V = D 0 + D 1 + D2 + D3
D0
D1
V
0
1
1
1
1
1
1
1
1
1
1
D2
3-37.
a)
b)
DECODER
S0
S1
S2
A0
A1
A2
0
1
2
3
4
5
6
7
I0
4x1 MUX
S0
S1
I0
I1
I2
I3
I1
I2
I3
S0
S1
0
1
2
3
Y
2x1 MUX
S2
S
0
1
4x1 MUX
I4
S0
S1
I4
I5
I6
I7
I5
I6
S0
S1
0
1
2
3
I7
3-38.
DECODER
A0
A1
A2
A3
A0
A1
A2
A3
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
D0
D1
D2
D3
D4
D5
D6
D7
D8
D9
D10
D11
D12
D13
D14
D15
37
3-39.
DECODER
S0
S1
S2
0
1
2
3
4
5
6
7
A0
A1
A2
IA0
IA1
IA2
IA3
YA
IA4
IA5
IA6
IA7
IB0
IB1
IB2
IB3
YB
IB4
IB5
IB6
IB7
3-40.
DECODER
S3
A0
0
1
I0
S0
S1
S2
I1
DECODER
A0
A1
A2
0
1
2
3
4
5
6
7
I2
I3
I4
I5
I6
I7
I8
I9
I10
I11
38
3-41.
A(2:0)
D0(7:0)
D1(7:0)
D2(7:0)
8x1 MUX
D(7:0) Y
0
S(2:0)
8x1 MUX
D(7:0) Y
0
S(2:0)
A3
8x1 MUX
D(7:0) Y
0
S(2:0)
2x1x4 MUX
D3(7:0)
A0
8x1 MUX
S
D0,0
D0,1
D0,2
D0,3
D1,0
D1,1
D1,2
D1,3
D(7:0) Y
0
S(2:0)
2x1x4 MUX
D0(8)
D1(8)
D2(8)
D3(8)
D0(9)
D1(9)
D2(9)
D3(9)
S
D0,0
D0,1
D0,2
D0,3
D1,0
D1,1
D1,2
D1,3
Y0
Y1
Y2
Y3
O0
O1
O2
O3
Y0
Y1
Y2
Y3
3-42.*
8x1 MUX
D(7:0)
D(7:0) Y
0
A(2:0)
S(2:0)
8x1 MUX
D(14:8)
D(6:0) Y
0
D(7)
S(2:0)
A(3)
3 OR gates
3-43.*
A1
0
0
0
0
1
1
1
1
A0
0
0
1
1
0
0
1
1
E
0
1
0
1
0
1
0
1
D0
0
1
0
0
0
0
0
0
D1
0
0
0
1
0
0
0
0
D2
0
0
0
0
0
1
0
0
D3
0
0
0
0
0
0
0
1
39
3-44.
DECODER
A0
A1
A2
X
Y
Z
0
1
2
3
4
5
6
7
F1
F2
F3
3-45.
a) LR = LTBL + LTBR + EMBL = BL(LT + EM) + LTBR
RR = RTBL + RTBR + EMBL = BR(RT + EM) + RTBR
BL
BR
EM
LT
DECODER
0
A0
1
A1
2
A2
A3
3
4
5
6
7
8
9
10
11
12
13
14
15
LR
3-46.
A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
C
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
D
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
F
0
0
1
0
1
0
1
0
0
1
1
1
0
0
0
1
C
B
A
F=0
D
F=D
VDD
F=D
F=D
F=D
F=1
F=0
F=D
40
8 x 1 MUX
S0
S1
S2
D0
D1
D2
D3
D4
D5
D6
D7
3-47.*
A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
C
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
D
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
C
D
F
0
1
0
1
1
0
0
0
0
0
0
1
1
1
1
1
F=D
B
A
F=C D
D0
D1
D2
D3
VDD
F=C D
F=1
3-48.
DECODER
D
C
B
A0
A1
A2
EN
0
1
2
3
4
5
6
7
DECODER
D
C
B
A0
A1
A2
EN
4 x 1 MUX
S0
S1
0
1
2
3
4
5
6
7
41