edited by
147 views

1 Answer

1 votes
1 votes
$32768 = 2^{15} = {(2^3)}^5 = 8^5.$

Thus we need $5$ mod-8 counters as after every $8$ clock cycles the second cascaded counter gets an increment and after every $8 \times 8 = 64$ clock cycles the third cascaded counter gets an increment and so on.
Answer:

Related questions

4 votes
4 votes
1 answer
1
gatecse asked Aug 30, 2020
141 views
A Mod-$10$ ripple counter is cascaded with Mod-$15$ ripple counter. The resulting counter is a Mod-$M$ counter with $N$ flip-flops. The value of $2*M+3*N$ is _____
3 votes
3 votes
2 answers
2
4 votes
4 votes
2 answers
3
gatecse asked Aug 30, 2020
249 views
There are $2^{2^3} = 256$ boolean functions of three variables. How many of these $3$-input Boolean functions depend on all three variables?
1 votes
1 votes
1 answer
4
gatecse asked Aug 30, 2020
113 views
The number of clock pulses needed to change the contents of a $6-$bit up counter from $100101$ to $000101$ is _____