recategorized by
6,260 views
19 votes
19 votes
The number of flip-flops required to construct a binary modulo $N$ counter is __________
recategorized by

1 Answer

Best answer
33 votes
33 votes
Let say we have to design a 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$

$\implies x = \left \lceil (\log_2N) \right \rceil $
edited by

Related questions

25 votes
25 votes
2 answers
1
Kathleen asked Oct 5, 2014
5,829 views
Find the contents of the flip-flop $Q_2, Q_1$ and $Q_0$ in the circuit of figure, after giving four clock pulses to the clock terminal. Assume $Q_2Q_1Q_0=000$ initially.
21 votes
21 votes
2 answers
2
Kathleen asked Oct 4, 2014
3,593 views
Consider $n$-bit (including sign bit) $2's$ complement representation of integer numbers. The range of integer values, $N$, that can be represented is ______ $\leq N \leq...
6 votes
6 votes
1 answer
3
makhdoom ghaya asked Nov 7, 2016
4,904 views
The above circuit produces the output sequence:$1111\quad 1111\quad0000\quad0000$$1111 \quad 0000\quad1111\quad0000$$1111 \quad 0001\quad0011\quad0101$$1010\quad1010\quad...
21 votes
21 votes
5 answers
4