← ⏱️ Counters, Registers & State Machines
Subtopic 3 of 5

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

  1. List the states in order and the next state of each.
  2. For each flip-flop and each transition find its inputs from the excitation table.
  3. Minimise each input with a K-map, using unused states as don't-cares.
  4. 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.
Q2Q1Q0nextJ2K2J1K1J0K0
0000010x0x1x
0010100x1xx1
0100110xx01x
0111001xx1x1
100101x00x1x
101110x01xx1
110000x1x10x
J2 = Q1Q0 K2 = Q1 J1 = Q0 K1 = Q0 + Q2 J0 = Q2' + Q1' K0 = 1

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

Remember: Excitation table + K-map + unused states as don't-cares; check self-starting.
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.