retagged by
2,947 views

2 Answers

0 votes
0 votes
As far as i know Ripple counter may require maximum decoding ckt.

A johnson counter divides the clk by the factor of 2N where N is no. Of ff required.

A ring counter can also be worked out be a simple shift register. And work synchronously.

A ripple counter however requires maximum propagation delay for counting therefore increasing the number of ckt for every count exceeded.
0 votes
0 votes
Ripple counters require less complex circuit than synchronous counters. So lets look at Johnson and ring counters which are synchronous. Out of both, Johnson counter is more complex.

Related questions

1 votes
1 votes
0 answers
1
sh!va asked Feb 22, 2017
685 views
$000, 001, 010, 011, 100\; \&$ repeats$100, 011, 010, 001, 000\; \&$ repeat$010, 011, 100, 000, 001\; \&$ repeats$101, 110, 111, 000, 001, 010, 011, 100 \;\&$ repeats
18 votes
18 votes
3 answers
2
makhdoom ghaya asked Nov 15, 2016
3,764 views
The below figure shows four $\text{D}$-type flip-flops connected as a shift register using a $\text{XOR}$ gate. The initial state and three subsequent states for three cl...
1 votes
1 votes
2 answers
3
sh!va asked Feb 21, 2017
676 views
Simplify Boolean function represented in sum of product of min-terms, $\text{F}(x, y, z)= \Sigma(0, 2, 4,5, 6)$ $z' + xy'$$x' y'z' + xyz+ xy'z'$$xyz + x' + y' + z'$$xy+yz...
1 votes
1 votes
1 answer
4
sh!va asked Feb 21, 2017
1,682 views
How is the status of the carry, auxiliary carry and parity flag affected if write instruction?MOV A,#9C ADD A,#64H$\text{CY = 0, AC = 0, P = 0}$$\text{CY = 1, AC = 1, P =...