binary modulo n counter means Asynchronous mod n up/down counter.

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+14 votes

+22 votes

Best answer

+5

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?

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. @Shaik Masthan

+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 ⌉

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

0

@Shaik Masthan for ring counter and johnson's counter is the output of left flipflop is MSB?

And also please mention which is the MSB for asynchronous UP and down counter.

- All categories
- General Aptitude 1.8k
- Engineering Mathematics 7.3k
- Digital Logic 2.9k
- Programming & DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6k
- Compiler Design 2k
- Databases 4.1k
- CO & Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.4k
- Others 1.4k
- Admissions 596
- Exam Queries 577
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

49,532 questions

54,136 answers

187,341 comments

71,060 users