fsm sequence recognizer

Discussion in 'Homework Help' started by xmadmaxx, Jun 27, 2007.

  1. xmadmaxx

    Thread Starter New Member

    Apr 22, 2007
    Hi i need to design a sequential circuit that recognizes sequence 01010.

    I've drawn the state diagram that has 5 states but now when I want to get the current state/next state table I get like 10 possible outcomes for inputs 0/1. I can't get rid of any states, What am I supposed to do to get the K-maps right...

    I think I'm supposed to have like 3-bits(3flip-flops)... please help :(
  2. beenthere

    Retired Moderator

    Apr 20, 2004
    You might want to hit the books a bit harder. I count 5 bits in yoyr sequence.

    By what means were you planning on validating the bit sequence?

    Being a crusty old technician, I'd grab a logic manual and find chips to do the function...
  3. n9352527

    AAC Fanatic!

    Oct 14, 2005
    Post your state table please. It does require 3 bits for 5 states and only two possible transitions from any state.
  4. Papabravo


    Feb 24, 2006
    To recognize a sequence you don't necessarily need a state machine. You can do it with a shift register and a some gates. Whenever the pattern in the shift register is equal to the value you want, just have a gate which says so! The shift register recognizer is an fsm with 32 states and one output, by the way.