Codiode

4-Bit Ripple Binary Counter from T Flip-Flops

EasyLogic CircuitBuildFree

Low-power frequency dividers and simple timing circuits often rely on asynchronous counting structures. A 4-bit ripple binary counter divides an input clock frequency by up to sixteen, utilizing cascaded toggle stages rather than a globally distributed clock network.

The circuit must increment its 4-bit value Q3, Q2, Q1, Q0 on each falling edge of the main CLK. The least significant bit Q0 toggles on the primary clock. Each subsequent bit toggles on the falling edge of the preceding stage's output. The RST signal asynchronously clears all outputs to 0.

RST CLK Q3 Q2 Q1 Q0
1 X 0 0 0 0
0 fall 0 0 0 1
0 fall 0 0 1 0
0 fall 0 0 1 1
0 fall 0 1 0 0

Constraints

  • Use exactly four falling-edge triggered T flip-flops.
  • Tie the T input of all flip-flops permanently to logic 1.
  • Connect the main CLK signal only to the clock input of the first flip-flop.
  • Drive the clock input of each subsequent flip-flop using the Q output of the preceding stage.

Topics

Sequential LogicAsynchronousCounters

Solve this problem

Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.

Free to solve. A Codiode account keeps your progress.

The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.

Part of Counters

Problem 1 of 139 in the Counters track.

Related problems

Browse all problems · Digital logic design practice problems · Learning tracks

Solve this on a laptopSend yourself the link and continue there.