Skip to main content

Digital Logic · Arithmetic units and datapath composition

A synchronous Moore handshake controller has states IDLE, LOAD, WAIT, and ACKED, inputs…

Problem

Digital Logic practice problem

A synchronous Moore handshake controller has states IDLE\mathrm{IDLE}, LOAD\mathrm{LOAD}, WAIT\mathrm{WAIT}, and ACKED\mathrm{ACKED}, inputs SS (start) and KK (acknowledge), and outputs LL (load datapath) and BB (busy). Reset is to IDLE\mathrm{IDLE}. The specification is:

• IDLE\mathrm{IDLE}: L=0L=0, B=0B=0. If S=0S=0, remain. If S=1S=1, go to LOAD\mathrm{LOAD}. Input KK is a don't-care.
• LOAD\mathrm{LOAD}: L=1L=1, B=1B=1. On the next clock go to WAIT\mathrm{WAIT} unconditionally.
• WAIT\mathrm{WAIT}: L=0L=0, B=1B=1. If K=0K=0, remain. If K=1K=1, go to ACKED\mathrm{ACKED}. Input SS is a don't-care.
• ACKED\mathrm{ACKED}: L=0L=0, B=0B=0. If S=1S=1, remain (must see start withdrawn). If S=0S=0, go to IDLE\mathrm{IDLE}. Input KK is a don't-care.

(a) Write the Moore transition/output table, including the declared don't-cares.
(b) Encode IDLE=00\mathrm{IDLE}=00, LOAD=01\mathrm{LOAD}=01, WAIT=11\mathrm{WAIT}=11, ACKED=10\mathrm{ACKED}=10 in bits Q1Q0Q_1Q_0. Obtain minimum-sum-of-products expressions for D1,D0,L,BD_1,D_0,L,B in variables Q1,Q0,S,KQ_1,Q_0,S,K, using the don't-cares of part (a).
(c) From reset, apply the input pairs (S,K)=(0,0),(1,0),(1,0),(1,0),(1,1),(1,0),(0,0)(S,K)=(0,0),(1,0),(1,0),(1,0),(1,1),(1,0),(0,0). Report the state and the pair (L,B)(L,B) after reset and after every clock. Determine the number of clocks for which L=1L=1 in this trace.

Hint

Hint

Handshake: pulse LL for one clock, then wait for KK, then wait for SS to drop before returning to idle.

Check your work

Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.

The answer check and full solution for this problem come with ProofAnvil Practice membership ($19 USD monthly). See membership. Or start with the free Digital Logic sample problem: Try the free sample problem.

More Digital Logic practice problems

Back to Digital Logic

An original ProofAnvil practice problem, written for this course. ProofAnvil is a practice course, not a homework-answer service.