A counter that follows the binary sequence is called a binary counter. A binary ripple counter consists of a series of complementing flip flops (T or JK FF) with the output of each flip flop connected to the clock pulse input of the next higher order flip flop. The flip flop holding the least significant bit receives the incoming count pulses.
It is known as ripple counter because the flip flops change one at a time in rapid succession and the signal propagates through the counter in a ripple fashion. CLK is coming for subsequent flip flops from previous flip flops and change state only when transition of previous flip flop’s output is from high to low i.e. from 1 to 0.
A complimentary flip flop can be obtained in 3 ways as described below:
- Using T Flip Flop
- Using JK Flip Flop with J & K inputs tied together
- Using D Flip Flop with the complement output connected to the D input. In this way the D input is always the complement of the present state and next clock pulse will cause the flip flop to complement.
Mod of Binary Ripple Counter = 2n,, where n is the number of flip flops
The counter counts in a binary sequence from 0 to 2n-1
Disadvantage of Binary Ripple Counter
This counter is slow as delay of each flip flop has to be taken into account as they are not clocked simultaneously.