Quest about jkflip flops and transition state diagramsg

[Amol S.]

_____So there are four inputs QdQcQbQa. I did the Karnaugh maps. But now how do I find the controls required by flip flops Jd Kd Jc Kc Jb Kb Ja Ka so that it goes to the next state. Lets say for example if Qa is the ones and Qd is the eights and we need to make a state transition table that also shows the controls required for the flip flops. and the counter is to the Fibonacci sequence from1 to 13 such that QdQcQbQa= 0001(one) to 2 (0010) , to 3 (0011), to 5 (0101) to 8 (1000) to 13 (1101), then repeat to 0001.
how would one then create a state transition diagram then.
Note I do not understand what the teacher teaches in class because he teaches us things in backwards, unlike how it is suppose to be abcd he tells us that a is not the 8s but the ones a d is not the ones but the 8s.

The counter only uses a JK flip flop and no other type of flip flop.

Help? Please?

 

[videogames101]

If you're studying for an EE/CE course I've got to tell you state diagrams (and on a basic level, flip-flops) are one of the most important things to understand. So, sure there are people on here that could go through the process for you, but this material is covered in every textbook ever and on countless online resources. I highly recommend trying to solve this one on your own.

But in a nutshell, for each state you need to specify the next set of inputs which will bring you to the next state in your sequence. For example if you're at 3 (0011), you need to set the third bit and unset the second bit to reach 5 (0101). Find the inputs Kx and Jx which will set and unset the correct bits, these are the "outputs" of the state. Repeat for each state. The transition logic between states will likely be your increment signal, etc.

 

[Amol S.]

If you're studying for an EE/CE course I've got to tell you state diagrams (and on a basic level, flip-flops) are one of the most important things to understand. So, sure there are people on here that could go through the process for you, but this material is covered in every textbook ever and on countless online resources. I highly recommend trying to solve this one on your own.

But in a nutshell, for each state you need to specify the next set of inputs which will bring you to the next state in your sequence. For example if you're at 3 (0011), you need to set the third bit and unset the second bit to reach 5 (0101). Find the inputs Kx and Jx which will set and unset the correct bits, these are the "outputs" of the state. Repeat for each state. The transition logic between states will likely be your increment signal, etc.

thank you bro:thumbsup::thumbsup::thumbsup: