Skip to content
BetterDL

Synchronous counter

Also called: sync counter, synchronous binary counter, parallel counter, clocked counter

A counter in which every flip-flop shares one clock, with gating logic deciding which bits toggle, so all bits change together at each edge.

In a synchronous counter, every flip flop is wired to the same clock. Because every bit now sees every edge, the flip-flops can't simply toggle each time. Logic in front of each one decides whether it should toggle at this edge.

With T flip-flops, the toggle rule turns straight into gates. Each T is the AND of all the bits below it:

  • T0 = 1
  • T1 = Q0
  • T2 =
  • T3 =

With D flip-flops, D must equal the next value of the bit, so Dᵢ = Qᵢ ⊕ Tᵢ: for example D2 = .

The logic has settled before the edge, and the edge just carries out the decision. So:

The price is extra gates. The counting sequence is identical to a ripple counter's; only the timing differs. Almost all modern counters are synchronous, and adding count enable, parallel load or a synchronous clear is easy because everything happens at the edge.

T2T1T0
000001
001011
010001
011111
100001
101011
110001
111111

Worked examples

Example

Checking the T inputs at 1011

A 4-bit synchronous up counter of T flip-flops holds Q3Q2Q1Q0 = 1011 (11) just before an edge.

  1. 1.

    T0 = 1 → Q0 toggles 1 → 0.

  2. 2.

    T1 = Q0 = 1 → Q1 toggles 1 → 0.

  3. 3.

    T2 = Q1·Q0 = 1·1 = 1 → Q2 toggles 0 → 1.

  4. 4.

    T3 = Q2·Q1·Q0 = 0·1·1 = 0 → Q3 holds at 1.

  5. 5.

    New count 1100 = 12 = 11 + 1 ✓. All four flip-flops switched at the same moment.

Example

The same counter with D flip-flops

For a 3-bit counter, each D input is the bit's next value: D0 = , D1 = , D2 = . The table lists them for every present state.

D2D1D0
000001
001010
010011
011100
100101
101110
110111
111000
  1. 1.

    Row 011: D2 = 0 ⊕ 1 = 1, D1 = 1 ⊕ 1 = 0, D0 = 0. Next state 100 ✓.

  2. 2.

    Row 111: D2 = 1 ⊕ 1 = 0, D1 = 0, D0 = 0. Next state 000: it wraps ✓.

Common mistakes

  • Writing T2 = Q1. A bit toggles only when every lower bit is 1, so T2 = .

  • Thinking a wider synchronous counter needs a longer period because bits wait for each other. They don't; only the AND gates get slightly wider.

  • Believing synchronous means instant. Every bit still changes one tpd after the edge; they just change together.

Practice Synchronous counter

Interactive questions with instant feedback and a worked solution for every wrong answer.

Learn it step by step

Synchronous counter is taught in Counters.