Determine the Main Cycle of a Counter (JK flip-flops)

  • Thread starter Thread starter enmar
  • Start date Start date
  • Tags Tags
    Counter Cycle
AI Thread Summary
The discussion focuses on determining the main cycle of a synchronous counter using JK flip-flops. The initial attempt at solving the problem revealed confusion regarding the state transitions, particularly starting from 000. After clarification, the correct sequence was identified as 000->110->011->001->101->000, establishing a clear main cycle. Additionally, the behavior of unused states was analyzed, showing that starting from 010 leads to a loop, while 100 and 111 transition back into the main sequence. Understanding the state table and transitions is crucial for solving such problems effectively.
enmar
Messages
6
Reaction score
0

Homework Statement


For the counter shown below, determine the main cycle, and for each of the unused states, show what happens if it starts up there.

http://i45.tinypic.com/33l1lhc.jpg

Homework Equations


N/A

The Attempt at a Solution


I thought I knew how to do this, but after some deliberation I've determined that I probably don't. It seems to me that, if I started at 000...I would get the sequence 000->010->100->101->010...which would then repeat through three states. I don't know why, but something tells me this isn't right. Can anyone explain to me how to do problems like these? And this is a synchronous counter, right?
 
Physics news on Phys.org
enmar said:

Homework Statement


For the counter shown below, determine the main cycle, and for each of the unused states, show what happens if it starts up there.

http://i45.tinypic.com/33l1lhc.jpg

Homework Equations


N/A

The Attempt at a Solution


I thought I knew how to do this, but after some deliberation I've determined that I probably don't. It seems to me that, if I started at 000...I would get the sequence 000->010->100->101->010...which would then repeat through three states. I don't know why, but something tells me this isn't right. Can anyone explain to me how to do problems like these? And this is a synchronous counter, right?

Yes, it is a synchronous counter. I would solve it by setting up a little table like this$$
\begin{array}{|c|c|c|c|c|c|}
\hline
Q_1Q_2Q_3& J_1=\bar Q_2& K_1= 1& J_2=\bar Q_3& K_2=Q_3& J_3=Q_1& K_3=Q_1\\
\hline
000&1&1&1&0&0&0 \\
\hline
110&&&&&& \\
\hline
&&&&&& \\
\hline
&&&&&& \\
\hline
\end{array}$$On the left in the first row you have the current state ##Q_1Q_2Q_3## which you use to fill out the J's and K's in the first row. That allows you to figure out ##Q_1Q_2Q_3## for the next row etc. Notice that we have a disagreement for the next state of 000 already.
 
Last edited:
Well damn, that was a lot easier than I thought it was. So for the sequence, I get:

000->110->011->001->101->000

And when I start on the following out-of-sequence numbers, the following results:

010->010->loop
100->001->seq.
111->000->seq.

Thanks Kurtz
 
enmar said:
Well damn, that was a lot easier than I thought it was. So for the sequence, I get:

000->110->011->001->101->000

And when I start on the following out-of-sequence numbers, the following results:

010->010->loop
100->001->seq.
111->000->seq.

Thanks Kurtz

Check that one.
 

Similar threads

Replies
6
Views
2K
Replies
6
Views
5K
Replies
1
Views
2K
Replies
1
Views
2K
Replies
4
Views
2K
Back
Top