3. State encoding

• Encode states uniquely

  • 4 states:
    • 2 bits minimum
    • 4 bits maximum
  • Look for optimal encoding
  • Assume D flip-flops

present state inputs next state present Q0 Q1 D N D0 D1 output 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 1 0 1 1 – – – 0 1 0 0 1 0 0 0 1 0 1 0 1 0 1 1 0 1 1 – – – 1 0 0 0 1 0 0 0 1 1 1 0 1 0 1 1 0 1 1 – – – 1 1 – – 1 1 1

Previous slide

Next slide

Back to first slide

View graphic version