synchronous counter

We want to design a synchronous counter that counts the sequence 0−1−0−2−0−3 and then repeats. The minimum number of J-K flip-flops required to implement this counter is _____________.

how to approach this question ?

shivani @shivani1234
2 Oct 2017 07:21 pm
hope it helps, in case of any doubt ping me

set2018 @setgate
2 Oct 2017 08:55 pm

sorry shivani1234 m not getting .pls explain how to differentiate ?

to design  synchronous counter ,for any arbitrary sequence like 7,3,1,2,5,4,6,7,3,1,2,4,5,6    I simply using state table diagram and  by minimization it is easy to design circuit.Also to identify minimum number of flip flop in synchronous counter I just calculating  number of bits used in counter .

shivani @shivani1234
3 Oct 2017 10:14 am

some pattern should be there for the formation of synchronous sequential counters

set2018 @setgate
3 Oct 2017 02:53 pm

why we need 4 flip flop ?

Vipul Ahuja @vipul2097
18 Aug 2019 11:10 am
suppose, we can represent 0,1,2,3 this four unique number using 2 bits, but there are three zeros so to uniquely represent these three zero as different state in state diagram we need two more bits to differentiates them all that's why we need two extra bits, so 2+2=4 bits.
Ambikesh Kumar Singh @ambikeshkumarsingh
21 Aug 2019 07:32 pm

For this type of question go with the following method:

Total number of bits required =

number of bits to represent total states  + no. of bits to represent maximum outgoing edges 

To identify 4 states we need log_{2}^4=2 bits

but if you see, from state 0 there are three outgoing states so the number of bits to represent 3 edges = \left \lceil log_{2} ^3\right \rceil=2

Total bits= 2+2=4