1 / 14

Lecture 20

Lecture 20. FSM simplification. FSM minimization. Two simple FSMs for odd parity checking. Collapsing states. Can collapse S 0 and S 2 into one state. FSM minimization. Row matching Easier to do by hand Misses minimization opportunities Implication chart

nicholasn
Télécharger la présentation

Lecture 20

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 20 • FSM simplification

  2. FSM minimization • Two simple FSMs for odd parity checking

  3. Collapsing states • Can collapse S0 and S2 into one state

  4. FSM minimization • Row matching • Easier to do by hand • Misses minimization opportunities • Implication chart • Guaranteed to find the most reduced FSM • More complicated algorithm (but still relatively easy to write a program to do it)

  5. Simple problem • Design a Mealy machine with a single bit input and a single bit output. The machine should output a 0, except once every four cycles, if the previous four inputs matched one of two patterns (0110, 1010) • Example input/output trace:in: 0010 0110 1100 1010 0011 …out: 0000 0001 0000 0001 0000 …

  6. … and a simple solution

  7. Find matching rows

  8. Find matching rows

  9. Merge matching rows

  10. Merge until no more matches

  11. Final state transition table

  12. Final FSM

  13. Row matching not optimal • Again, the two FSMs for odd parity checking

  14. No rows match!

More Related