PPT Slide

7 – Sequential Logic Examples

© 1996 Gaetano Borriello

Finite string pattern recognizer

• Review of process

  • write down sample inputs and outputs to understand specification
    • understanding problem
  • write down sequences of states and transitions for sequences to be recognized
    • derive a state diagram
  • add missing transitions; reuse states as much as possible
    • minimize number of states
  • encode states with unique patterns
    • state assignment or encoding
  • verify I/O behavior of your state diagram to ensure it matches specification
    • simulate realization

15

Previous slide

Next slide

Back to first slide

View graphic version