Question

The number of flip-flops required in a modulo $N$ counter is

• A. $\log 2\left(N\right)+1$
• B. $2\left[\log 2\right(N\left)\right]$
• C. $\left[\log 2\right(N\left)\right]$
• D. $\log 2(N-1)$

Answer 1

The correct option is C $\left[\log 2\right(N\left)\right]$

The number of flip-flops required in a modulo N counter is [log2(N)].

In electronics, a flip-flop is a circuit that has two stable states and can be used to store state information.

The number of flip-flops required in a modulo N counter is

The modulus of a counter is given as: 2^{^n} where n = number of flip-flops. So a 3 flip-flop counter will have a maximum count of 2^{^3} = 8.

The number of different output states a counter can produce is called the modulo of the counter. The Modulus of a counter is the total number of unique states it passes through in one complete counting cycle with a mod-n counter being described also as a divide-by-n counter.