The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+12 votes
1.2k views
The number of flip-flops required to construct a binary modulo $N$ counter is __________
asked in Digital Logic by Veteran (59.6k points)
edited by | 1.2k views

1 Answer

+21 votes
Best answer
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.2k 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

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

42,699 questions
48,662 answers
156,593 comments
63,970 users