Limited Offer Get 25% off — use code BESTW25
No AI No Plagiarism On-Time Delivery Free Revisions
Claim Now
Prices start at $5 per page · plagiarism-free papers · free revisions for 14 days 24/7 support: support@bestwriters.com
Uncategorized

ECE-223, Solutions for Assignment #6

  • Posted
  • Authoradmin
  • Length558 words
  • Reading time3 min
Write My Assignment FREE

Page: 1
ECE-223, Solutions for Assignment #6
Digital Design, M. Mano, 3rd Edition, Chapter 5
5.2) Construct a JK flip-flop using a D Flip-flop, a 2-to-1 line multiplexer and an inverter.
5.4) A PN flip-flop has four operations: clear to 0, no change, complement, and set to 1,
when inputs P and N are 00, 01, 10, and 11, respectively.
a) Tabulate the characteristic table.
b) Derive the characteristic equation.
c) Tabulate the excitation table.
d) Show how the PN flip-flop can be converted to a D flip-flop.
a) b)

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

Page: 2
Q(t+1) = PQ′ + NQ
c)

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

d) By connecting P and N together.
Q(t+1) = DQ′ + DQ = D
5.6) A sequential circuit with two D Flip-Flops, A and B; two inputs, x and y; and one
output, z, is specified by the following next-state and output equations:
A(t+1) = x′y + xA
B(t+1) = x′B + xA
z = B
a) Draw the logic diagram of the circuit.
b) List the state table for the sequential circuit.
c) Draw the corresponding state diagram.
a)
Page: 3
b)

Present State Inputs Next State Output
A B x y A B z
0 0 0 0 0 0 0
0 0 0 1 1 0 0
0 0 1 0 0 0 0
0 0 1 1 0 0 0
0 1 0 0 0 1 1
0 1 0 1 1 1 1
0 1 1 0 0 0 1
0 1 1 1 0 0 1
1 0 0 0 0 0 0
1 0 0 1 1 0 0
1 0 1 0 1 1 0
1 0 1 1 1 1 0
1 1 0 0 0 1 1
1 1 0 1 1 1 1
1 1 1 0 1 1 1
1 1 1 1 1 1 1

c)
Page: 4
5.12) Reduce the number of states in the following state table and tabulate the reduced
state table.

Present
State
Next State
x =0 x =1
Output
x =0 x =1
a f b 0 0
b d c 0 0
c f e 0 0
d g a 1 0
e d c 0 0
f f b 1 1
g g h 0 1
h g a 1 0
Present
State
Next State
x =0 x =1
Output
x =0 x =1
a f b 0 0
b d a 0 0
d g a 1 0
f f b 1 1
g g d 0 1

5-16) Design a sequential circuit with two D Flip-Flops, A and B, and one input x.
When x = 0, then the state of the circuit remains the same. When x =1, the circuit goes
through the state transitions from 00 to 01 to 11 to 10 back to 00, and repeats.

Present State
AB
Input
x
Nest State
AB
00 0 00
00 1 01
01 0 01
01 1 11
10 0 10
10 1 00
11 0 11
11 1 10

Page: 5
5-17) Design a one input, one output serial 2’s complimenter. The circuit accepts a string
of bits from the input and generates the 2’s compliment at the output. The circuit can be
reset asynchronously to start and end the operation.
Solution:
The output is 0 for all 0 inputs until the first 1 occurs at which time, the output is 1.
Thereafter, the output is the complement of the input.
Page: 6
The state diagram has two states
State 0 : Output = Input
State1 : Output = Complement of input
DA= A + x
y = A ⊕ x

PS
A
Inp.
x
NS
A
Out
y
0 0 0 0
0 1 1 1
1 0 1 1
1 1 1 0

Page: 7
5-19) A sequential circuit has three flip-flops A, B, C; one input x; and one output, y. The
state diagram is shown in Fig.P5-19. The circuit is to be designed by treating the unused
states as don’t-care conditions. Analyze the circuit obtained from the design to determine
the effect of the unused states.
a) Use D flip-flops in the design
b) Use J-K flip-flops in the design
Fig.P5-19
Page: 8
a)

Present State
A B C
Input
x
Next State
A B C
Output
y
0 0 0 0 0 1 1 0
0 0 0 1 1 0 0 1
0 0 1 0 0 0 1 0
0 0 1 1 1 0 0 1
0 1 0 0 0 1 0 0
0 1 0 1 0 0 0 1
0 1 1 0 0 0 1 0
0 1 1 1 0 1 0 1
1 0 0 0 0 1 0 0
1 0 0 1 0 1 1 0

Page: 9
b) Use JK flip-flops:

JA KA JB KB JC KC
0 X 1 X 1 X
1 X 0 X 0 X
0 X 0 X X 0
1 X 0 X X 1
0 X X 0 0 X
0 X X 1 0 X
0 X X 1 X 0
0 X X 0 X 1
X 1 1 X 0 X
X 1 1 X 1 X
JA = B′x
KA =1
JB = A+ C′x′
KB =C′x + Cx′

JC = Ax + A′B′x′
KC =x
Self-correction because KA =1
Page:
10
5-20) Design the sequential circuit specified by the state diagram of Fig. 5-19 using
T flip-flops.
Fig. 5-19
From State table (Table 5-4 from Digital Design, M. Mano, 3rd Edition, pp.186)
TA (A, B, x) = ∑ ( 2, 3, 6)
TB (A, B, x) = ∑ ( 0, 3, 4, 6)
TB = A′B+Bx′ TA = Ax′+B′x′+A′Bx

The post ECE-223, Solutions for Assignment #6 appeared first on My Assignment Online.

Plagiarism Free Assignment Help

Expert Help With This Assignment — On Your Terms

✓ Native UK, USA & Australia writers ✓ Deadline from 3 hours ✓ 100% Plagiarism-Free — Turnitin included ✓ Unlimited free revisions ✓ Free to submit — compare quotes

admin

Academic writer and editor at BestWriters.

Get your paper off your plate tonight

Post your instructions for free. Prices start at $5 per page.

Place an order