My assignment is to design a sequential circuit that counts out the sequence "0-1-0-2-0-3-0-4-4-4..." in binary (when the count reaches '4', it latches and remains that way unless externally reset.)
My problem: That repeating zero is really confusing me. I've searched this forum and found a couple of other mentions of repeating states, but they weren't similar enough for me to be able to figure this problem out.
I've got the states named:
A = 000
B = 001
C = 010
D = 011
E = 100
So the circuit should follow this state path: "A-> B-> A-> C-> A-> D-> A-> E -> E...". But how is the circuit supposed to tell the 'A's apart? They are all '000' in binary, so it seems like the circuit would just get stuck on the "A-> B-> A" part without ever moving to C.
*scratching my head*
Any links to further reading on this would be greatly appreciated.
My problem: That repeating zero is really confusing me. I've searched this forum and found a couple of other mentions of repeating states, but they weren't similar enough for me to be able to figure this problem out.
I've got the states named:
A = 000
B = 001
C = 010
D = 011
E = 100
So the circuit should follow this state path: "A-> B-> A-> C-> A-> D-> A-> E -> E...". But how is the circuit supposed to tell the 'A's apart? They are all '000' in binary, so it seems like the circuit would just get stuck on the "A-> B-> A" part without ever moving to C.
*scratching my head*
Any links to further reading on this would be greatly appreciated.