5.3Synchronous counter design
The idea
In a synchronous counter all flip-flops share the clock. You choose a flip-flop type, tabulate the transitions, read the inputs from the excitation table and minimise them with the unused states as don't-cares.
Think of it like this: A marching band that steps on the same beat, instead of each person waiting for the one before.
Why it exists
Design questions ask for the logic of a particular input (for example, what is T₂) or the number of gates.
How it works
- List the states in order and the next state of each.
- For each flip-flop and each transition find its inputs from the excitation table.
- Minimise each input with a K-map, using unused states as don't-cares.
- Check that the unused states lead back into the sequence.
Worked example: Mod-8 up counter with T flip-flops
A flip-flop must toggle when all the lower bits are 1, so T₀ = 1, T₁ = Q₀, T₂ = Q₁Q₀.
Now play with it
- →Press mod 7 with JK and read J₂ and K₂.
- →Change the flip-flop to T and D and compare the expressions.
| Q2 | Q1 | Q0 | next | J2 | K2 | J1 | K1 | J0 | K0 |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 001 | 0 | x | 0 | x | 1 | x |
| 0 | 0 | 1 | 010 | 0 | x | 1 | x | x | 1 |
| 0 | 1 | 0 | 011 | 0 | x | x | 0 | 1 | x |
| 0 | 1 | 1 | 100 | 1 | x | x | 1 | x | 1 |
| 1 | 0 | 0 | 101 | x | 0 | 0 | x | 1 | x |
| 1 | 0 | 1 | 110 | x | 0 | 1 | x | x | 1 |
| 1 | 1 | 0 | 000 | x | 1 | x | 1 | 0 | x |
Unused states 7 are don't-cares, which makes the logic smaller. Check afterwards that each unused state eventually returns to the sequence (self-starting), otherwise the counter can lock up. Excitation values come from the flip-flop's excitation table; all flip-flops share one clock, so there is no ripple delay.
Check yourself
In a synchronous 3-bit binary up counter built from T flip-flops, the input T₂ equals
Exam notes (the dense version)
In a synchronous counter all flip-flops share one clock. Procedure: write the sequence, choose the flip-flop type, list for each state the transition and the required inputs from the excitation table, and minimise each input with a K-map using the unused states as don't-cares. Check that unused states lead back into the cycle (self-starting). Example: mod-8 up counter with T flip-flops has T₀ = 1, T₁ = Q₀, T₂ = Q₁Q₀. The number of flip-flops is ⌈log₂ N⌉ for N states.
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.