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
A1
A2

20
21
22

3x8

D0-D7

Decoder

E
20
21
22

A3

20

A4

21

0
1
Decoder 2
3

2x4

3x8

D8-D15

Decoder

E
20
21
22

3x8

D16-D23

Decoder

E
20
21
22

3x8
Decoder

D24-D31

4-28

F1

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

2
22
21

20

3x8
Decoder

F2

4
5
6
7

F3

4-31
S0
S1
S2
S3

S0
S1
S2
0
1
2
3
4
5
6
7

0
1
2
3
4
5
6
7

8x1
MUX

S
0
1

S0
S1
S2
8
9
10
11
12
13
14
15

0
1
2
3
4
5
6
7

8x1
MUX

2x1
MUX

4-32
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 D
0 0
0 1
1 0
1 1
0 0
0 1
1 0
1 1
0 0
0 1
1 0
1 1
0 0
0 1
1 0
1 1

F
1
1
0
1
1
0
0
0
1
1
0
0
0
0
0
1

F=1
F=D
F=D
F=D

A
B
C

S0
S1
S2

F=1
F=0
F=0
F=D

0
1
2
3
4
5
6
7

8x1
MUX

4-35
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 D
0 0
0 1
1 0
1 1
0 0
0 1
1 0
1 1
0 0
0 1
1 0
1 1
0 0
0 1
1 0
1 1

F
0
1
0
1
1
0
0
0
0
0
0
1
1
1
1
1

AB=00
F=D

AB=01
F=CD=(C+D)

S0

S2

I0

I1

AB=10
F=CD

I2

1
AB=11
F=1

I3

4x1
MUX

5-1
R=DC

Q
CP

C
Q

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
CP

C
Q

R=((DC).C)= D.C+C=(D+C)=(DC)

5-1 (c)

5-4
P
0
0
1
1

N Q(t+1)
0
0
1 Q(t)
0 Q(t)
1
1
5-4(a)

P
0
0
0
0
1
1
1
1

N
0
0
1
1
0
0
1
1

Q(t) Q(t+1)
0
0
1
0
0
0
1
1
0
1
1
0
0
1
1
1

Q(t) Q(t+1) P
0
0
0
0
1
1
1
0
X
1
1
X
5-4(c)

5-4(b)

5-4(d) Connect P and N together

Q(t+1)= PQ+NQ

Q(t)

N
X
X
0
1

5-6

x
y

xy+xA
D Q

CP

5-6 (a)

5-6
Present
State
AB

Inputs

Output

xy

Next
State
AB

00
00
00
00

00
01
10
11

00
10
00
00

0
0
0
0

01
01
01
01

00
01
10
11

01
11
00
00

1
1
1
1

10
10
10
10

00
01
10
11

00
10
11
11

0
0
0
0

11
11
11
11

00
01
10
11

01
11
11
11

1
1
1
1

5-6 (b)

00/0
10/0
11/0

00/1

10/1
11/1

00

01/0

01

00/0

10

01/1

00/1

11
10/0
11/0

01/0

01/1
10/1
11/1

5-6 (c)

5-8

TA = A + B
TB = A + B
Repeated Sequence

00

01

10

Present
State
AB

Next
State
AB

TA

TB

00
01
10
11

01
10
00
00

0
1
1
1

1
1
0
1

FF Inputs

00

01

11

10

5-10
Present
State
AB

Inputs

Output

xy

JA K A

JBKB

00
00
00
00

00
01
10
11

10
00
11
01

0
0
0
0

10
00
11
00

00
00
11
10

01
01
01
01

00
01
10
11

01
01
10
11

1
0
0
0

00
00
10
10

00
00
11
10

10
10
10
10

00
01
10
11

10
10
00
10

0
0
0
1

10
00
11
00

01
01
01
01

AB

11
11
11
11

00
01
10
11

10
10
10
10

1
0
0
1

00
00
10
10

01
01
01
01

11
10

5-10 (b)

xy

FF Inputs

Next
State
AB

AB

00

00
01

11
10

1
1

01 11 10
1
1

A (t+1)=Ax+ Bx + Ay+ ABy

xy
00
01

00

01 11 10
1

B (t+1)=ABx+ AB(x+y)

5-10 (c)