1.1k views
Design a synchronous counter to go through the following states:$$1, 4, 2, 3, 1, 4, 2, 3, 1, 4 \dots$$
| 1.1k views
0

I think $, D, JK or SR-Flip Flop$ any one of them could be used.

What is your opinion Praveen Saini ji ?

+2
why cannot we do this via 2 FF only?Make a transitions from 0,3,1,2 and make a function to add 1 to each value that will turn into 1,4,2,3 counting ffs.If we have 3 FFs problem is we need to ensure so that it does not go into some unused state and doesn't return back to our used states....
0

@Surajit ji, Your opinion looks elegant and correct.

0

@Surajit brother can you please show via diagram ,your approach by using only two FFS

Sequence given is as

$1,4,2,3,1\ldots$

From the given sequence of states we can design the state table and Suppose we are using T-FF for sequential circuit of counter.$$\small \begin{array}{|ccc|ccc|ccc|}\hline \rlap{\textbf{Present State}}& & & \rlap{\textbf{Next State}} & & & \rlap{\textbf{FF Inputs}} & & & \\\hline \;\; A\;\; &\;\; B\;\; &\;\; C \;\; & A^{+} & B^{+} & C^{+} & T_{A} & T_{B} & T_{C} \\\hline 0 & 0 & 0 & x& x & x & x & x & x \\\hline 0 & 0 & 1 & 1&0 &0 &1 &0 & 1 \\\hline 0 & 1 & 0 & 0&1 &1 &0 &0 & 1 \\\hline 0 & 1 & 1 & 0&0 &1 &0 &1 &0 \\\hline 1 & 0 & 0 & 0&1&0 &1 &1 & 0 \\\hline 1 & 0 & 1 & x& x & x & x & x & x \\\hline 1 & 1 & 0 & x& x & x & x & x & x \\\hline 1 & 1 & 1 & x& x & x & x & x & x \\\hline \end{array}$$From the above table, we will find the equation of $T_A$, $T_B$ and $T_C$    by Veteran (56.6k points)
edited
0
Is it necessary to cover all the possibilities? I mean we can only make the k-map for 1->4->2->3 and then i can find the Input expression for all three flipflops.
0
Need to fill at minterm loc in kmap while finding expression.
+2
since there are 4 distinct states ( 1,4,2,3 ) can we use only two flipflops?
0

Tuhin Dutta   HOW?

0

If we use ripple or jhonson counter we can make it, right? Since for k FF we can have 2k or 2k states respectively.

0
@Tuhin, you are right.
0
Might we need some extra logic gate to represent state 4?
0
yes..
0
Thanks for clarifying it, sir.
0
here sequence is given then why are you not following the given sequence only like (1 4 2 3 1 4 2.......).

means why are you covering all like(1 2 3 4 5 6 7 ).
+1
ripple is asyhnchronous it s asking about synchronus
+1
@rajoramanoj,   from state sequence we get state 4 where we need 3 bits to represent,100, with 3 bits we have 8 combinations 0 to 7, those state are not in sequence are unused states, for those next state is shown as dont cares.
0

Hi @Praveen Saini ji,

Thanks for your valuable effort. But to make circuit more error tolerant instead of using DO NOT CARE. We should move to some valid state from Invalid state.

+3
why Tb is not A+BC?

why B XNOR C??

acc to me Tb should be A+BC.
0

@Chhotu @Praveen Saini
Can we implement any sequence of 4 distinct states

With 2 FFs

like 0,7,1,9,0,7,1,9.. ?

0

https://gateoverflow.in/2117/gate2011-15 check this question.

We can have log n FF for n states. We just have to design the combinational circuit which will provide the appropriate input during next clock cycle to count those many states.

0
Yes thats right ..but here to represnt 7 ..we need 3 bits ..1 FF output ==> 1 bit

eg 2 FFs ..FF1 ==> Q0,...FF2 ==> Q1
0
yes correct. depends on input. 😊

Generally synchronous counter are designed by using D- flip flop and asynchronous counter are designed by using T- flip flop. So here counter designed by using D flip-flop by (259 points)
+1
D1=not(Q0) only