Chapter 7

Chapter 7
Problem Solutions
7.1. Excitation and output expressions:
- + y
J1 = xQ
2
- + x
-Q
K1 = yQ
2
2
-J2 = x
y
K2 = xy + Q1
-z = Q 1Q2 + x
Q1
Excitation table:
Present state
(Q1Q2)
Excitation
(J1K1,J2K2)
Inputs (xy)
Output
(z)
Inputs (xy)
00
01
10
11
00
01
10
11
00
00,10
11,00
10,00
11,01
01
01,10
11,00
00,00
10,01
10
00,11
11,01
10,01
11,01
11
01,11
11,01
00,01
10,01
Transition table:
Present state
(Q1Q2)
Next state
+
(Q+
1Q2)
Output
(z)
Inputs (xy)
00 01 10 11
Inputs (xy)
00 01 10 11
00
01
10
10
10
01
01
11
01
10
10
11
00
10
00
11
00
00
10
10
- 7.1 -
7.1. (continued)
State table:
Present state
Next state
Output
(z)
Inputs (xy)
Inputs (xy)
00
01
10
11
00
01
10
11
00 A
01 B
10 C
11 D
State diagram:
- 7.2 -

-Q
D1 = x
2
-- D2 = x
Q1Q2 + xQ
1Q2
z = Q 1Q2
Excitation table:
Present state
(Q1Q2)
Excitation
(D1D2)
Output
(z)
Input (x)
0
1
00
00
01
01
11
00
10
00
00
11
10
00
Transition table (Same as excitation table):

Present state
(Q1Q2)
Next state
+
(Q+
1Q2)
Output
(z)
Input (x)
0
00
00
01
01
11
00
10
00
00
11
10
00
- 7.3 -
7.2. (continued)
State table:
Present state
Next state
Output
(z)
Input (x)
0
00 A
01 B
10 C
11 D
State diagram:
- 7.4 -

- Q
T1 = xQ2 + Q
1 2
- Q
T2 = x + Q
1 2
z1 = xQ
1
-Q
z2 = x
2
Excitation table:
Present state
(Q1Q2)
Excitation
(T1T2)
Output
(z1z2)
Input (x)
Input (x)
00
00
01
00
10
01
11
11
01
10
10
00
01
00
00
11
00
11
01
00
Transition table:
Present state
(Q1Q2)
Next state
+
(Q+
1Q2)
Output
(z1z2)
Input (x)
0
1
Input (x)
0
1
00
00
01
00
10
01
10
10
01
10
10
10
11
00
00
11
11
00
01
00
- 7.5 -
7.3. (continued)
State table:
Present state
Next state
Output
(z1z2)
Input (x)
Input (x)
00 A
00
10
01 B
01
10
10 C
00
00
11 D
01
00
State diagram:
- 7.6 -

J1 = Q 2
K1 = x
- +Q
D2 = x(Q
1 2)
-Q
z = Q2 + x
1
Excitation table:
Present state
(Q1Q2)
Excitation
(J1K1,D2)
Output
(z)
Input (x)
Input (x)
00
00,0
01,1
01
10,0
11,1
10
00,0
01,1
11
10,0
11,0
Transition table:
Present state
(Q1Q2)
Next state
+
(Q+
1Q2)
Output
(z)
Input (x)
0
1
Input (x)
0
1
00
00
01
01
10
11
10
10
01
11
10
00
- 7.7 -
7.4. (continued)
State table:
Present state
Next state
Output
(z)
Input (x)
Input (x)
00 A
01 B
10 C
11 D
State diagram:
- 7.8 -
7.5.
A: A multiple of three 1's have occurred (where none is a
multiple of three).
B: One greater than a multiple of three 1's have occurred.
C: Two 1's greater than a multiple of three 1's have
occurred.
Present state
Next state
Output
(z)
Input (x)
Input (x)
* A
7.6.
A: Last input was 0.
B: One 1 has occurred.
C: Two consecutive 1's have occurred.
D: Three consecutive 1's have occurred.
E: More than three consecutive 1's have occurred.
Present state
Next state
Output
(z)
Input (x)
0
1
Input (x)
0
1
* A
- 7.9 -
7.7.
A: Waiting for a single 0 (or, equivalently, 1's occurring
after more than one 0 has occurred).
B: Exactly one 0 has occurred.
C: Two or more consecutive 0's have occurred.
D: 1's occurring after exactly one 0.
Present state
Next state
Output
(z)
Input (x)
Input (x)
* A
- 7.10 -
7.8.
Present
state
State definition
Number
of inputs
Number
of 1's
Number
of 0's
Next state
Output
(z)
Input (x)
Input (x)
* A
Invalid code group
- 7.11 -
7.9.
Present
state
State definition
Next state
Output
(z)
Input (x)
Input (x)
* A
1st bit applied, retain

applied input
1st bit applied, complement

applied input
2nd bit applied, retain

applied input
2nd bit applied, complement

applied input
3rd bit applied, retain

applied input
3rd bit applied, complement

applied input
Awaiting 1st input of

sequence
- 7.12 -
7.10. (a)
Present
state
State definition
Next state
Output
(z)
Input (x)
Input (x)
* A
b4 bit was 0 (b3=g3)
- )
b4 bit was 1 (b3=g
3
- )
b3 bit was 1 (b2=g
2
- )
b2 bit was 1 (b1=g
1
- )
b1 bit was 1 (b0=g
0
Awaiting 1st bit of

sequence (b4=g4)
- 7.13 -
7.10. (continued)
(b) In problem 3.34 it was established that the algorithm
to convert an n-bit binary number bn-1bn-2...b1b0 into
its equivalent n-bit Gray code gn-1gn-2...g1g0 is
gn-1 = bn-1
gk-1 = bk bk-1
for n-1k1
Present
state
State definition
Awaiting 1st bit of
sequence (g4=b4)
Next state
Output
(z)
Input (x)
0
1
Input (x)
0
1
* A
g4 bit was 0 (g3=b4 b3)
- 7.14 -
7.11.
State definition
QA
QB
QC
Present
state
Next state
Output
(QAQBQC)
Input (x)
0
* A
000
100
010
110
001
101
011
111
7.12.
A: Even number of 1's have occurred, current output should
be 0.
B: Odd number of 1's have occurred, current output should
be 0.
C: Even number of 1's have occurred, current output should
be 1.
D: Odd number of 1's have occurred, current output should
be 1.
Present state
Next state
Output
(z)
Input (x)
Input (x)
* A
- 7.15 -
7.13. A possible initial state set is:

A: In a sequence of an even number of 0's.
B: In a sequence of an odd number of 0's.
C: In a sequence of 1's having a parity disagreeing with
the previous sequence of 0's.
D: In a sequence of 1's having a parity agreeing with the
previous sequence of 0's.
Present state
Next state
Output
(z)
Input (x)
0
1
Input (x)
0
1
* A
It is immediately noted that AD.
The minimal state table
is:
Present state
Next state
Output
(z)
Input (x)
Input (x)
(A,D): * 1
(B):
(C):
- 7.16 -
7.14.
A: Waiting for the first 1 in a sequence of 1's.
B: One 1 has occurred.
C: Two 1's have occurred.
D: Three or more 1's have occurred.
Present state
Next state
Output
(z)
Input (x)
0
1
Input (x)
0
1
* A
7.15. Let the present state denote the previous three inputs,
i.e., xt-3, xt-2, and xt-1 where xt-i is the input at time
i.
State definition
Present
state
Next state
Output
(z)
Input (x)
0
1
Input (x)
0
1
xt-3
xt-2
xt-1
* A
- 7.17 -
7.16. Using the same approach as the previous problem, the state
table is:
Present
state
State definition
xt-3
xt-2
xt-1
Next state
Output
(z)
Input (x)
Input (x)
* A
For this table, however, AE, BF, CG, and DH.

minimal state table is:
Present state
Next state
Output
(z)
Input (x)
0
1
Input (x)
0
1
(A,E): * 1
(B,F):
(C,G):
(D,H):
- 7.18 -
The
7.17. (a)
Equivalence classes of states:

{(A,E,H), (B,F), (C,G,I), (D)}
Minimal state table:
Present state
Next state
Output
(z)
Input (x)
0
1
Input (x)
0
1
(A,E,H): * 1
(B,F):
(C,G,I):
(D):
- 7.19 -
7.17. (continued)
(b)

{(A,C,E), (B,G), (D), (F), (H)}
Present state
Next state
Output
(z)
Input (x)
0
1
Input (x)
0
1
(A,C,E): * 1
(B,G):
(D):
(F):
(H):
- 7.20 -
7.18.

{(A,E,F), (B,G), (C,H), (D)}
Present state
Next state
Output
(z)
Input (x)
0
(A,E,F): * 1
(B,G):
(C,H):
(D):
- 7.21 -
7.19. Transition table:

Present state
(Q1Q2)
Next state
+
(Q+
1Q2)
Output
(z)
Input (x)
0
1
Input (x)
0
1
A 00
01
10
B 01
00
00
C 10
11
00
D 11
00
11
(a) The excitation table is the same as the transition

table where Di=Q+
i.
- 7.22 -
7.19. (continued)
(b) Excitation table:
Present state
(Q1Q2)
Excitation
(J1K1,J2K2)
Input (x)
Output
(z)
Input (x)
00
0-,1-
1-,0-
01
0-,-1
0-,-1
10
-0,1-
-1,0-
11
-1,-1
-0,-0
The output map and expression are the same as part (a).
- 7.23 -
7.19. (continued)
(c) Excitation table:
Present state
(Q1Q2)
Excitation
(T1T2)
Output
(z)
Input (x)
Input (x)
00
01
10
01
01
01
10
01
10
11
11
00
- 7.24 -
7.19. (continued)
(d) Excitation table:
Present state
(Q1Q2)
Excitation
(S1R1,S2R2)
Input (x)
Output
(z)
Input (x)
00
0-,10
10,0-
01
0-,01
0-,01
10
-0,10
01,0-
11
01,01
-0,-0
- 7.25 -
7.20. Adjacency conditions to be satisfied:

Rule I: (B,D), (B,C)
Rule II: (B,C), (A,D)(2)
Rule III: (B,C,D)
State assignment map:
Transition table:
Present state
(Q1Q2)
Next state
+
(Q+
1Q2)
Output
(z)
Input (x)
0
1
Input (x)
0
1
A 00
11
10
B 11
00
00
C 10
01
00
D 01
00
01
- 7.26 -
7.20. (continued)
table where Di=Q+
i.
- 7.27 -
7.20. (continued)
Present state
(Q1Q2)
Excitation
(J1K1,J2K2)
Input (x)
Output
(z)
Input (x)
00
1-,1-
1-,0-
11
-1,-1
-1,-1
10
-1,1-
-1,0-
01
0-,-1
0-,-0
- 7.28 -
7.20. (continued)
Present state
(Q1Q2)
Excitation
(T1T2)
Output
(z)
Input (x)
Input (x)
00
11
10
11
11
11
10
11
10
01
01
00
- 7.29 -
7.20. (continued)
Present state
(Q1Q2)
Excitation
(S1R1,S2R2)
Input (x)
Output
(z)
Input (x)
00
10,10
10,0-
11
01,01
01,01
10
01,10
01,0-
01
0-,01
0-,-0
- 7.30 -

Present state
(Q1Q2)
Next state
+
(Q+
1Q2)
Output
(z)
Input (x)
0
1
A 00
00
01
B 01
10
00
C 10
00
11
D 11
10
10

table where Di=Q+
i.
- 7.31 -
7.21. (continued)
Present state
(Q1Q2)
Excitation
(J1K1,J2K2)
Input (x)
Output
(z)
00
0-,0-
0-,1-
01
1-,-1
0-,-1
10
-1,0-
-0,1-
11
-0,-1
-0,-1
- 7.32 -
7.21. (continued)
Present state
(Q1Q2)
Excitation
(T1T2)
Output
(z)
Input (x)
0
00
00
01
01
11
01
10
10
01
11
01
01
- 7.33 -
7.21. (continued)
Present state
(Q1Q2)
Excitation
(S1R1,S2R2)
Input (x)
Output
(z)
00
0-,0-
0-,10
01
10,01
0-,01
10
01,0-
-0,10
11
-0,01
-0,01
- 7.34 -

Present State
(Q1Q2Q3)
Next State
+ +
(Q+
1Q2Q3)
Output
(z)
Input (x)
0
1
Input (x)
0
1
A 000
001
000
B 001
000
010
C 010
011
000
D 011
011
100
E 100
010
011

table where Di=Q+
i.
- 7.35 -
7.22. (continued)

Present state
(Q1Q2Q3)
Excitation
(J1K1,J2K2,J3K3)
Input (x)
Output
(z)
Input (x)
000
0-,0-,1-
0-,0-,0-
001
0-,0-,-1
0-,1-,-1
010
0-,-0,1-
0-,-1,0-
011
0-,-0,-0
1-,-1,-1
100
-1,1-,0-
-1,1-,1-
- 7.36 -
7.22. (continued)
- 7.37 -
7.22. (continued)

Present State
(Q1Q2Q3)
Excitation
(T1T2T3)
Output
(z)
Input (x)
Input (x)
000
001
000
001
001
011
010
001
010
011
000
111
100
110
111
- 7.38 -
7.22. (continued)
- 7.39 -
7.22. (continued)
Present state
(Q1Q2Q3)
Excitation
(S1R1,S2R2,S3R3)
Input (x)
Output
(z)
Input (x)
000
0-,0-,10
0-,0-,0-
001
0-,0-,01
0-,10,01
010
0-,-0,10
0-,01,0-
011
0-,-0,-0
10,01,01
100
01,10,0-
01,10,10
- 7.40 -
7.22. (continued)
- 7.41 -
7.23. Adjacency conditions to be satisfied:

Rule I: (C,D), (A,C)
Rule II: (A,B), (A,C), (A,D), (D,E), (C,D)
Rule III: (B,D,E)
Transition table:
Present State
(Q1Q2Q3)
Next State
+ +
(Q+
1Q2Q3)
Output
(z)
Input (x)
Input (x)
A 000
001
000
B 001
000
100
C 100
101
000
D 101
101
111
E 111
100
101
- 7.42 -
7.23. (continued)
table where Di=Q+
i.
- 7.43 -
7.23. (continued)
Present state
(Q1Q2Q3)
Excitation
(J1K1,J2K2,J3K3)
Input (x)
Output
(z)
Input (x)
000
0-,0-,1-
0-,0-,0-
001
0-,0-,-1
1-,0-,-1
100
-0,0-,1-
-1,0-,0-
101
-0,0-,-0
-0,1-,-0
111
-0,-1,-1
-0,-1,-0
- 7.44 -
7.23. (continued)
- 7.45 -
7.23. (continued)
Present State
(Q1Q2Q3)
Excitation
(T1T2T3)
Output
(z)
Input (x)
Input (x)
000
001
000
001
001
101
100
001
100
101
000
010
111
011
010
- 7.46 -
7.23. (continued)

Present state
(Q1Q2Q3)
Excitation
(S1R1,S2R2,S3R3)
Input (x)
0
1
Output
(z)
Input (x)
0
1
000
0-,0-,10
0-,0-,0-
001
0-,0-,01
10,0-,01
100
-0,0-,10
01,0-,0-
101
-0,0-,-0
-0,10,-0
111
-0,01,01
-0,01,-0
- 7.47 -
7.23. (continued)
- 7.48 -
7.23. (continued)
7.24. (a) Transition table:

Present State
(Q1Q2Q3)
Next State
+ +
(Q+
1Q2Q3)
Output
(z)
Input (x)
0
A 000
000
001
B 001
010
101
C 010
011
000
D 011
100
010
E 100
011
101
F 101
100
011
- 7.49 -
7.24. (continued)
The excitation table is the same as the transition
table where Di=Q+
i.
- 7.50 -
7.24. (continued)
(b) Adjacency conditions to be satisfied:
Rule I: (C,E), (D,F), (B,E)
Rule II: (A,B), (C,F), (A,D), (C,E), (D,F), (D,E)
Rule III: (C,F)
Transition table:
Present State
(Q1Q2Q3)
Next State
+ +
(Q+
1Q2Q3)
Output
(z)
Input (x)
0
A 000
000
001
B 001
111
110
C 111
010
000
D 010
011
111
E 011
010
110
F 110
011
010
- 7.51 -
7.24. (continued)
The excitation table is the same as the transition
table where Di=Q+
i.
- 7.52 -
7.25. (a) Transition table:

Present State
(Q1Q2Q3)
Next State
+ +
(Q+
1Q2Q3)
Output
(z)
Input (x)
0
1
A 000
000
001
B 001
010
101
C 010
011
000
D 011
100
010
E 100
011
101
F 101
100
011
Excitation table:
Present state
(Q1Q2Q3)
Excitation
(J1K1,J2K2,J3K3)
Output
(z)
Input (x)
0
000
0-,0-,0-
0-,0-,1-
001
0-,1-,-1
1-,0-,-0
010
0-,-0,1-
0-,-1,0-
011
1-,-1,-1
0-,-0,-1
100
-1,1-,1-
-0,0-,1-
101
-0,0-,-1
-1,1-,-0
- 7.53 -
7.25. (continued)
- 7.54 -
7.25. (continued)
- 7.55 -
7.25. (continued)
(b) Use the state assignment established in Problem
7.24(b).
Excitation table:
Present state
(Q1Q2Q3)
Excitation
(J1K1,J2K2,J3K3)
Input (x)
0
1
Output
(z)
000
0-,0-,0-
0-,0-,1-
001
1-,1-,-0
1-,1-,-1
111
-1,-0,-1
-1,-1,-1
010
0-,-0,1-
1-,-0,1-
011
0-,-0,-1
1-,-0,-1
110
-1,-0,1-
-1,-0,0-
- 7.56 -
7.25. (continued)
- 7.57 -

Chapter 7

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Chapter 7

Caricato da

Copyright:

Formati disponibili

Chapter 7

7.2. Excitation and output expressions:

Transition table (Same as excitation table):

7.3. Excitation and output expressions:

7.4. Excitation and output expressions:

Invalid code group

1st bit applied, retain

1st bit applied, complement

2nd bit applied, retain

2nd bit applied, complement

3rd bit applied, retain

3rd bit applied, complement

Awaiting 1st input of

b4 bit was 0 (b3=g3)

b3 bit was 0 (b2=g2)

b2 bit was 0 (b1=g1)

b1 bit was 0 (b0=g0)

Awaiting 1st bit of

g4 bit was 0 (g3=b4 b3)

g4 bit was 1 (g3=b4 b3)

g3 bit was 0 (g2=b3 b2)

g3 bit was 1 (g2=b3 b2)

g2 bit was 0 (g1=b2 b1)

g2 bit was 1 (g1=b2 b1)

g1 bit was 0 (g0=b1 b0)

g1 bit was 1 (g0=b1 b0)

7.13. A possible initial state set is:

It is immediately noted that AD.

The minimal state table

For this table, however, AE, BF, CG, and DH.

Equivalence classes of states:

Equivalence classes of states:

Equivalence classes of states:

7.19. Transition table:

(a) The excitation table is the same as the transition

7.20. Adjacency conditions to be satisfied:

7.21. Transition table:

(a) The excitation table is the same as the transition

7.22. Transition table:

(a) The excitation table is the same as the transition

(b) Excitation table:

(c) Excitation table:

7.23. Adjacency conditions to be satisfied:

(d) Excitation table:

7.24. (a) Transition table:

7.25. (a) Transition table:

Potrebbero piacerti anche