Counters

A counter is a sequential circuit that moves through a predefined sequence of states whenever clock pulses are applied. The most common counter sequence is binary counting.

Counters are important because digital systems often need to count events, create delays, divide clock frequency, generate addresses, or step through control states.

• Industry relevance: timers, frequency dividers, digital clocks, microcontrollers, communication systems, and event counters use counter circuits.
• Design relevance: counters convert clock pulses into useful timing and state information.
• Exam relevance: GATE and PSU questions often test mod number, flip-flop count, asynchronous delay, synchronous design, ring counters, and Johnson counters.
• Interview relevance: counters reveal whether you understand clocking, state transitions, and flip-flop behavior.

• Sequential circuits and flip-flops
• D, T, and JK flip-flop behavior
• Clock edge and propagation delay
• Binary number systems
• State tables and timing diagrams
• Basic modulo arithmetic

A counter is like a digital odometer. Each clock pulse is like a tick that asks the circuit to move to the next stored number.

A counter does not count time directly; it counts clock edges. Time is measured only because clock edges occur at a known rate.

1. Counter State

If a counter has n flip-flops, it has n stored bits and can represent up to $$ 2^n $$ states. A 3-bit counter can represent 8 states from 000 to 111.

2. Asynchronous Counter

In an asynchronous counter, only the first flip-flop receives the external clock. Later flip-flops are triggered by previous flip-flop outputs. This creates ripple delay.

3. Synchronous Counter

In a synchronous counter, all flip-flops receive the clock at the same time. Combinational logic decides which flip-flops should toggle. This is faster and more predictable.

4. Mod-N Counter

A mod-N counter has N valid states before it repeats. A decade counter is a mod-10 counter because it counts 0 through 9 and then resets.

1. Number of States

With $$ n $$ flip-flops, each flip-flop stores one bit.

$$ \text{Maximum states} = 2^n $$

Physical meaning: each added flip-flop doubles the number of possible stored combinations.

2. Flip-Flops Needed for Mod-N Counter

Choose smallest $$ n $$ such that:

$$ 2^n \ge N $$

For mod-10, $$ 2^3=8 $$ is insufficient and $$ 2^4=16 $$ is enough, so 4 flip-flops are required.

3. Frequency Division

A binary counter divides frequency because each flip-flop toggles at half the frequency of the previous stage.

$$ f_{out}=\frac{f_{clk}}{2^n} $$

1. Clock pulse arrives at the counter.
2. Flip-flops sample their toggle or next-state inputs.
3. The present state changes to the next count value.
4. Output bits represent the current count.
5. After the final valid state, reset or feedback logic returns the counter to the starting state.
6. The sequence repeats for each new clock pulse.

• Digital clocks and timers
• Frequency dividers in communication systems
• Program counters in processors
• Event counters in embedded systems
• Memory address sequencing
• PWM and time-base generation
• Traffic-light and vending-machine controllers
• Ring counters in sequence generators

Beginner Example

How many states can a 3-bit counter represent?

$$ 2^3=8 $$ states: 000 to 111.

Intermediate Numerical

How many flip-flops are required for a mod-12 counter?

Need smallest n such that $$ 2^n \ge 12 $$.

$$ 2^3=8 $$ insufficient, $$ 2^4=16 $$ sufficient. So 4 flip-flops are needed.

Advanced Problem

A 4-bit binary counter receives a 1 MHz clock. What is frequency after the 4th flip-flop?

$$ f_{out}=\frac{1\,MHz}{2^4}=\frac{1\,MHz}{16}=62.5\,kHz $$.

• Confusing number of flip-flops with number of states.
• Forgetting unused states in mod-N counters where N is not a power of 2.
• Ignoring ripple delay in asynchronous counters.
• Assuming all flip-flops trigger at the same time in ripple counters.
• Using $$ 2^n $$ states without checking reset logic.
• Mixing ring counter and Johnson counter sequences.

• What is a counter?
• What is the difference between asynchronous and synchronous counters?
• Why is ripple counter slower?
• How many flip-flops are needed for a mod-10 counter?
• How does a counter divide frequency?
• What is the difference between ring and Johnson counter?
• What are unused states in a mod-N counter?

• For mod-N counters, use smallest n satisfying $$ 2^n \\ge N $$.
• Asynchronous counters have accumulated propagation delay.
• Synchronous counters are preferred for high-speed designs.
• A ring counter with n flip-flops has n states.
• A Johnson counter with n flip-flops has 2n states.

• Counters are sequential circuits that count clock pulses.
• An n-bit binary counter has up to $$ 2^n $$ states.
• Asynchronous counters ripple; synchronous counters update together.
• Mod-N counters repeat after N states.
• Key formulas: $$ 2^n $$ states, $$ n=\lceil\log_2N\rceil $$, $$ f_{out}=f_{clk}/2^n $$.

Conceptual

• Explain why counters are sequential circuits.
• Why does ripple delay occur in asynchronous counters?
• Compare ring and Johnson counters.

Numerical

• Find number of states for a 5-bit counter.
• Find flip-flops required for a mod-20 counter.
• A 3-bit counter receives 8 kHz clock. Find divided output frequency.

MCQs

• Which counter is faster: synchronous or asynchronous?
• How many states does a 4-bit binary counter have?
• How many states does a 4-bit Johnson counter have?