in Digital Logic edited by
10,345 views
12 votes
12 votes

A modulus -$12$ ring counter requires a minimum of

  1. $10$ flip-flops
  2. $12$ flip-flops
  3. $8$ flip-flops
  4. $6$ flip-flops
in Digital Logic edited by
by
10.3k views

1 comment

edited by
  • A ring counter is a circular shift register with only one flip-flop being set at any particular time; all others are cleared.
  • A $k$ - bit ring counter circulates a single bit among the flip flops to provide $k$ distinguishable states.

 

1
1

3 Answers

12 votes
12 votes
Best answer
12 flip flops required.
In ring counter, n flip flops generate n states where in twisted ring counter n flip flops generate 2n states.
for more info
http://www.electronics-tutorials.ws/sequential/seq_6.html

4 Comments

Answer is b) 12 flip-flops

The “MODULO” or “MODULUS” of a counter is the number of states the counter counts or sequences through before repeating itself and a ring counter can be made to output any modulo number.

A “mod-n” ring counter will require “n” number of flip-flops connected together to circulate a single data bit providing “n” different output states.

For example, a mod-8 ring counter requires eight flip-flops and a mod-16 ring counter would require sixteen flip-flops.
0
0
plzz give 2015 and 2014 isro answer key.
0
0
0
0
1 vote
1 vote
Answer- 12 flip flop
1 vote
1 vote

For any counter:-

  1. There are a certain number of Flip Flops from which it is built.
  2. There are a certain number of states that the counter can be in. Each state represents a unique value.

Synchronous Counters:

$n$ Flip Flops count $2^n$ different values.

Or you can say that $n$ Flip Flops result in $2^n$ states, and each state represents a distinguishable value.


 

Asynchronous Counters (aka Ripple Counters):

$n$ Flip Flops count $2^n$ different values.

Or you can say that $n$ Flip Flops result in $2^n$ states, and each state represents a distinguishable value.


 

Johnson Counter: (aka Twisted Ring Counter, Switch-Tail Ring Counter)

$n$ Flip Flops count $2n$ different values.

Or you can say that $n$ Flip Flops result in $2n$ states, and each state represents a distinguishable value.


 

Ring Counters:

$n$ Flip Flops count $n$ different values.

Or you can say that $n$ Flip Flops result in $n$ states, and each state represents a distinguishable value.

 

Now unless explicitly mentioned otherwise, a ring counter should be assumed as a straight ring counter, which leads us to Option B

Answer:

Related questions