Skip to main content

Digital Logic · Finite-state-machine design

A 4-bit synchronous binary up-counter is built from four falling-edge-triggered JK…

Problem

Digital Logic practice problem

A 4-bit synchronous binary up-counter is built from four falling-edge-triggered JK flip-flops Q3Q2Q1Q0Q_3Q_2Q_1Q_0, with Q3Q_3 the most significant bit. The circuit realises a standard binary count: each stage has Ji=KiJ_i=K_i equal to the logical AND of all less-significant QQ outputs (and J0=K0=1J_0=K_0=1). No external count-enable is present. The common clock is a 8.00 MHz8.00\,\mathrm{MHz} square wave. The present state is Q3Q2Q1Q0=1011Q_3Q_2Q_1Q_0=1011.

(a) Write JiJ_i and KiK_i for i=0,1,2,3i=0,1,2,3 as Boolean functions of the QQ outputs.
(b) Determine the next state after one falling clock edge.
(c) Determine the frequency of each of Q0Q_0, Q1Q_1, Q2Q_2, and Q3Q_3.
(d) Determine the number of clock cycles after which the counter first returns to 10111011, starting from the present state.

Hint

Hint

A JK pair tied together is a T flip-flop: bit ii toggles iff the AND of all less-significant QQ bits is 11.

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.