Solution to Problems

Chapter 4 & 5
Digital Design by M. Morris Mano

ECE 223
Fall 2005

Amir Khatibzadeh
aakhatib@optimal.vlsi.uwaterloo.ca
 4-23

A1
A0 D0 = (A1+A0+E)=A1A0E

D1 = (A1+A0+E)=A1A0E

D2 = (A1+A0+E) =A1A0E

D3 = (A1+A0+E) =A1A0E

E
4-25

A0 20 8
A1 21 3x8 D0-D7
22 Decoder
A2
E

20
8
21 3x8 D8-D15
22 Decoder
0
A3 20
2x4 1 E
A4 21 Decoder 2
3
20
8
21 3x8 D16-D23
22 Decoder

20 8
21 3x8 D24-D31
22 Decoder

E
4-28

0
F1
1
x 2
22
F1 = x (y + y) z + xyz = (0, 5, 7) y F2
3x8 3
21
F2 = x yz + xy (z + z) = (2, 3, 4) Decoder
z 4
20
F3 = xyz + x y (z + z) = (1, 6, 7)
5
F3
6

7
4-31

S0 S0
S1 S1
S2 S2
S3
0 0
1 1 8x1
2 2
3 3 MUX
4 4
5 5
6 6
7 7 S
0 2x1 Y
1
MUX
S0
S1
S2

8 0
9 1
8x1
10 2 MUX
11 3
12 4
13 5
14 6
15 7
4-32

A B C D F
0 0 0 0 1
F=1
0 0 0 1 1
0 0 1 0 0
F=D
0 0 1 1 1 A S0

0 1 0 0 1 B S1
F=D C S2
0 1 0 1 0 1
0
0 1 1 0 0 D 1
8x1
F=D MUX
0 1 1 1 0 2 Y F
3
1 0 0 0 1 4
F=1
1 0 0 1 1 5
6
1 0 1 0 0 0 7
F=0
1 0 1 1 0
1 1 0 0 0
F=0
1 1 0 1 0
1 1 1 0 0
F=D
1 1 1 1 1
4-35

A B C D F
0 0 0 0 0
AB=00
0 0 0 1 1 F=D
0 0 1 0 0
0 0 1 1 1 A S0

0 1 0 0 1 S2
AB=01 B
0 1 0 1 0 F=CD=(C+D)
0 1 1 0 0 C I0
4x1
0 1 1 1 0 MUX Y F
D I1
1 0 0 0 0 AB=10
1 0 0 1 0 F=CD I2

1 0 1 0 0 I3
1
1 0 1 1 1
1 1 0 0 1 AB=11
1 1 0 1 1 F=1
1 1 1 0 1
1 1 1 1 1
5-1

R=DC

D Q

CP C

5-1 (a) S=D.C

R=(D+C)= DC

Q
D
C

5-1 (b) S=(D+C)= D.C

5-1

S=(D.C)
D
Q

CP
C
Q

R=((DC).C)= D.C+C=(D+C)=(DC)
5-1 (c)
5-4

P N Q(t+1) P N Q(t) Q(t+1) Q(t) Q(t+1) P N

0 0 0 0 0 0 0 0 0 0 X
0 1 Q(t) 0 0 1 0 0 1 1 X
1 0 Q(t) 0 1 0 0 1 0 X 0
1 1 1 0 1 1 1 1 1 X 1
1 0 0 1
5-4(a) 5-4(c)
1 0 1 0
1 1 0 1
1 1 1 1
5-4(b)

N
5-4(d) Connect P and N together
1
P 1 1 1
Q(t+1)= PQ+NQ
Q(t)
5-6

x xy+xA
y D Q A
Q

D B

CP
5-6 (a) z
5-6

Present Inputs Next Output 00/0

State State 10/0
AB xy AB z 11/0 00/1
10/1
00 00 00 0 11/1
00 01 10 0
00 10 00 0 00 01
00 11 00 0

01 00 01 1
01 01 11 1 01/0 00/0 00/1 01/1
01 10 00 1
01 11 00 1

10 00 00 0
10 01 10 0
10 10 11 0 10 11
10 11 11 0 10/0
11/0
11 00 01 1
11 01 11 1 01/0 01/1
11 10 11 1 10/1
11 11 11 1 11/1

5-6 (b) 5-6 (c)

5-8

Present Next FF Inputs

TA = A + B State State
00 01
TB = A + B AB AB TA TB

00 01 0 1
Repeated Sequence 01 10 1 1
10 00 1 0 11 10
11 00 1 1
00 01 10
5-10
xy x
Present Inputs Next Output FF Inputs
State State
AB
00 01 11 10
AB xy AB z JA K A JBKB
00 1 1
00 00 10 0 10 00 01 1 1
00 01 00 0 00 00 B
11 1 1 1 1
00 10 11 0 11 11 A
00 11 01 0 00 10 10 1 1 1

01 00 01 1 00 00
01 01 01 0 00 00 A (t+1)=Ax+ Bx + Ay+ ABy
01 10 10 0 10 11
01 11 11 0 10 10 xy
10 00 10 0 10 01
AB
00 01 11 10
10 01 10 0 00 01
10 10 00 0 11 01 00 1 1
10 11 10 1 00 01 01 1 1 1

11 00 10 1 00 01 11
11 01 10 0 00 01 10
11 10 10 0 10 01
11 11 10 1 10 01 B (t+1)=ABx+ AB(x+y)

5-10 (b) 5-10 (c)