Ripple Counter

A ripple counter chains toggle flip-flops so each stage clocks the next, giving simple hardware but a staggered count.

What it does

A ripple counter, or asynchronous counter, is a chain of T flip-flops each set to toggle. The first stage is clocked by the input; each later stage is clocked by the output of the stage before it. The stages together count in binary.

How it counts

Because each flip-flop divides its input frequency by two, the stages form the binary digits of a count: the first stage is the least significant bit, toggling fastest, and each higher stage toggles half as often. An n-stage counter cycles through 2^n values.

The ripple delay

The counter is asynchronous because a change does not reach all stages at once. When the low bit toggles, its effect ripples up stage by stage, each adding its own delay. During the ripple the output briefly shows wrong intermediate values, and the maximum count rate is limited by the total ripple time.

Glitches

At counts where many bits change together, such as 0111 to 1000, the transient wrong values can produce glitches if the output is decoded during the ripple. This makes ripple counters unsuitable where a clean, simultaneous output is needed.

Trade-off

Ripple counters use minimal hardware and are fine for simple frequency division. Where clean timing matters, a synchronous counter clocks all stages together and is preferred.