5.2Asynchronous (ripple) counters and mod-n design
The idea
In an asynchronous (ripple) counter each flip-flop is clocked by the output of the previous one, so each stage halves the frequency. For a modulus that is not a power of two, you clear the counter when it reaches the modulus.
Think of it like this: The wheels of an odometer: each wheel turns the next, one after the other.
Why it exists
Modulus, frequency division and the speed limit of ripple counters appear regularly.
How it works
- n T flip-flops (T = 1) in a chain count 0 … 2ⁿ − 1 and Qᵢ has frequency f / 2ⁱ⁺¹.
- For mod N use ⌈log₂ N⌉ flip-flops and an asynchronous clear when the count reaches N.
- The state N shows up for a very short time: a glitch.
- The delays add up, so the maximum clock frequency is about 1/(n · t_pd).
Worked example: Mod-10 (decade) counter
Four flip-flops count 0 … 15; a NAND gate on Q3 and Q1 (the state 1010 = 10) clears all four, so the visible sequence is 0 to 9.
Now play with it
- →Set the modulus to 10 and read the reset note.
- →Raise n and see the settling time grow.
| clock | count | Q3 | Q2 | Q1 | Q0 |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 0 | 0 | 1 |
| 2 | 2 | 0 | 0 | 1 | 0 |
| 3 | 3 | 0 | 0 | 1 | 1 |
| 4 | 4 | 0 | 1 | 0 | 0 |
| 5 | 5 | 0 | 1 | 0 | 1 |
| 6 | 6 | 0 | 1 | 1 | 0 |
| 7 | 7 | 0 | 1 | 1 | 1 |
| 8 | 8 | 1 | 0 | 0 | 0 |
| 9 | 9 | 1 | 0 | 0 | 1 |
| 10 | 0 | 0 | 0 | 0 | 0 |
| 11 | 1 | 0 | 0 | 0 | 1 |
| 12 | 2 | 0 | 0 | 1 | 0 |
Each flip-flop is clocked by the previous one, so the delays add up: the output is wrong for up to n·t_pd after an edge. A mod-10 ripple counter built by clearing at 10 passes briefly through the state 10 itself (a glitch), so only 10 stable states show.
Check yourself
The minimum number of flip-flops needed for a mod-12 ripple counter is
Exam notes (the dense version)
In a ripple counter each flip-flop is clocked by the previous output, so Q0 has frequency f/2, Q1 f/4 and so on; n flip-flops make a mod-2ⁿ counter. For mod N (N not a power of two) use ⌈log₂ N⌉ flip-flops and an asynchronous clear when the count reaches N, through a NAND of the 1-bits; the state N appears for a moment (glitch). Down counters clock from Q′. Delay accumulates, so the maximum clock frequency is roughly 1/(n·t_pd) and the outputs are valid only after all stages settle; decoding gates can show glitches.
Previous year questions: Counters, Registers & State Machines (10)
PYQs are grouped by topic, so this is the full set for Counters, Registers & State Machines; try the ones that match this subtopic. Open all 10 on the topic page.