AQA · A-Level · Physics

    Course version: 7408 · Version from Sept 2016

    Counting circuits: Binary counter BCD counter Johnson counter.

    Full specification wording

    Sequential logic (A-level only): Counting circuits: Binary counter BCD counter Johnson counter.

    Counting circuits are sequential logic systems built from flip-flops that advance through a defined sequence of output states each time a clock pulse arrives.

    Checked against the AQA 7408 specification (opens in a new tab) on .

    • Point 1 of 5
    • 4 key terms

    Study notes

    From the checked teaching notes for this specification point.

    The idea

    Counting circuits are sequential logic systems built from flip-flops that advance through a defined sequence of output states each time a clock pulse arrives. A binary counter counts in natural binary, so an n-bit counter has 2ⁿ states and recycles after reaching its maximum. A BCD counter counts only from 0000 to 1001 (0 to 9) and then resets, making it suitable for driving decimal displays. A Johnson counter uses a shift register with the inverted last output fed back to the first input, producing a sequence of 2n states for n flip-flops. You analyse each circuit by writing the next-state table, predicting outputs after successive clock edges, and identifying the modulus.

    For example: A 3-bit binary counter cycles through 000, 001, 010, 011, 100, 101, 110, 111 before repeating, giving a modulus of 8.

    What earns the marks

    • States that a binary counter with n flip-flops has 2ⁿ distinct output states and a modulus of 2ⁿ.
    • Describes a BCD counter as one that counts from 0000 to 1001 and then returns to 0000, giving a modulus of 10.
    • Explains that a Johnson counter feeds the inverse of the last flip-flop output back to the first input, producing 2n states for n flip-flops.
    • Constructs or completes a next-state table showing the output after each clock pulse for a given counting circuit.
    • Identifies the modulus of a counter from its sequence or from the number of flip-flops and circuit type.
    • Distinguishes between free-running binary counting and truncated sequences such as BCD or Johnson counting.

    Common mistakes and how to put them right

    • Assuming a BCD counter has a modulus of 16 because it uses four flip-flops.

      Put it right: The correct modulus is 10 because it is truncated at 1001.

    • Confusing a Johnson counter with a ring counter.

      Put it right: A ring counter recirculates a single 1 and has n states, whereas a Johnson counter inverts the feedback and has 2n states.

    • Forgetting that the count advances on the active clock edge, so the output listed for a state is the value after that edge, not before it.

    Exam tips

    • Draw the full state sequence before answering, then count the states to confirm the modulus.
    • For BCD questions, explicitly state the reset condition, for example that 1010 is detected and forces the counter back to 0000.
    • When comparing counters, tabulate the number of flip-flops, number of states and feedback arrangement side by side.

    Try the lesson

    The start of the Sequential logic (A-level only): Counting circuits: Binary counter BCD counter Johnson counter. lesson, made from checked teaching notes for this specification point.

    Have a go first

    A 4-bit binary counter is reset to zero and then receives 5 clock pulses. What is the binary count stored in the counter?

    Listen

    Counting circuits are sequential logic systems built from flip-flops that advance through a defined sequence of output states each time a clock pulse arrives. A binary counter counts in natural binary, so an n-bit counter has 2ⁿ states and recycles after reaching its maximum. A BCD counter counts only from 0000 to 1001 (0 to 9) and then resets, making it suitable for driving decimal displays. A Johnson counter uses a shift register with the inverted last output fed back to the first input, producing a sequence of 2n states for n flip-flops. You analyse each circuit by writing the next-state table, predicting outputs after successive clock edges, and identifying the modulus. For example, a 3-bit binary counter cycles through 000, 001, 010, 011, 100, 101, 110, 111 before repeating, giving a modulus of 8. A strong answer earns marks for these points. States that a binary counter with n flip-flops has 2ⁿ distinct output states and a modulus of 2ⁿ. Describes a BCD counter as one that counts from 0000 to 1001 and then returns to 0000, giving a modulus of 10. Explains that a Johnson counter feeds the inverse of the last flip-flop output back to the first input, producing 2n states for n flip-flops. Constructs or completes a next-state table showing the output after each clock pulse for a given counting circuit. Exam tip: Draw the full state sequence before answering, then count the states to confirm the modulus.

    See it

    A top-down flowchart. The top node is 'Counting circuits', which branches into three nodes: 'Binary counter', 'BCD counter' and 'Johnson counter'. Under 'Binary counter' are two nodes: 'Counts in natural binary' and 'n-bit: 2ⁿ states, modulus 2ⁿ'. Under 'BCD counter' are two nodes: 'Counts 0000 to 1001' and 'Resets to 0000, modulus 10'. Under 'Johnson counter' are two nodes: 'Shift register with inverted last output fed back to first input' and '2n states for n flip-flops'.
    It classifies the three counting circuits and shows the key counting behaviour and modulus of each.

    Key words

    Say what each word means before you turn the card.

    Binary counter

    Try answering aloud or in your head before turning the card.

    BCD counter

    Try answering aloud or in your head before turning the card.

    Johnson counter

    Try answering aloud or in your head before turning the card.

    Modulus

    Try answering aloud or in your head before turning the card.

    See every definition
    Binary counter
    Counts in natural binary, so an n-bit counter has 2ⁿ states and recycles after reaching its maximum.
    BCD counter
    Counts only from 0000 to 1001 (0 to 9) and then resets, making it suitable for driving decimal displays.
    Johnson counter
    Uses a shift register with the inverted last output fed back to the first input, producing a sequence of 2n states for n flip-flops.
    Modulus
    Identified by analysing each circuit through the next-state table and the sequence of output states.

    Label the diagram

    Some boxes have lost their names. Pick the right name for each number.

    The diagram again, with 3 boxes numbered instead of named. A top-down flowchart. The top node is 'Counting circuits', which branches into three nodes: 'Binary counter', 'BCD counter' and 'Johnson counter'. Under 'Binary counter' are two nodes: 'Counts in natural binary' and 'n-bit: 2ⁿ states, modulus 2ⁿ'. Under 'BCD counter' are two nodes: 'Counts 0000 to 1001' and 'Resets to 0000, modulus 10'. Under 'Johnson counter' are two nodes: 'Shift register with inverted last output fed back to first input' and '2n states for n flip-flops'.
    • 1Box 1

    • 2Box 2

    • 3Box 3

    0 of 3 labelled

    There is more to this lesson

    The full lesson goes on to check your understanding and help you earn the marks. Create a free account to carry on, with your progress saved.

    Carry on with the full lesson

    A week of Premium from your first lesson · Then the free plan continues · No card, no charge

    Test your understanding of Sequential logic (A-level only): Counting circuits: Binary counter BCD counter Johnson counter.

    Active recall beats re-reading. Take an instant quiz now to test what you’ve learned and lock it into long-term memory.

    Take topic quiz

    A week of Premium from your first lesson · Then the free plan continues · No card, no charge