1.4k views
The number of flip-flops required to construct a binary modulo $N$ counter is __________
edited | 1.4k views
0
binary modulo n counter means Asynchronous mod n up/down counter.

Let say we have to Design mod-$8$ counter i.e $000$ to $111$. so we need $3$ bits to represent i.e $3$ $FF$

for Mod $N$

$2^x = N$

$x =$ ceiling $(log_2N)$
answered by Veteran (55.8k points)
edited by
+4
I have a doubt: if it is possible to form mod 8 counter using 3 FF. Why do we use Ring Counter or Johnson counter?
+1
to make mod8 ring counter, we will need 8 FFs.
0
this is for asynchronous counter
0
 Counter Flip flops Counting Ring N mod(N) Johnson N mod(2N) Asynchronous N mod(2^N)

I think here type of counter should be explicitly mentioned to find number of flip flops.

+1
actually, the counting sequence is not in order for Ring or Johnson ===> we can't use them for requirement of the question !

the one and only choice is Go with asynchronous counter ===> ⌈log$_2$n ⌉

1
2