The document provides a review for ECE 120 Midterm 3. It covers the exam solutions from fall 2013 and compares Moore and Mealy state machines. Finally, it outlines the general steps for designing a state machine, including defining inputs/outputs, states, filling tables, solving K-maps, and drawing diagrams. The solutions may differ from what is posted online since this is a design class.
The document provides a review for ECE 120 Midterm 3. It covers the exam solutions from fall 2013 and compares Moore and Mealy state machines. Finally, it outlines the general steps for designing a state machine, including defining inputs/outputs, states, filling tables, solving K-maps, and drawing diagrams. The solutions may differ from what is posted online since this is a design class.
The document provides a review for ECE 120 Midterm 3. It covers the exam solutions from fall 2013 and compares Moore and Mealy state machines. Finally, it outlines the general steps for designing a state machine, including defining inputs/outputs, states, filling tables, solving K-maps, and drawing diagrams. The solutions may differ from what is posted online since this is a design class.
Exam/solutions and these slides are posted on Midterm 3 page NOTE: My solutions might dier from the ones online. Thats OK! This is a design class!
RAM 2n m RAM has n address lines, m data lines
State Machine Comparison
Moore What output(s) Current state depend(s) on
Mealy Current state and inputs
Diagram key NAME S/O
NAME S
General State Machine Algorithm
State machine with n states, m outputs, p inputs 1. 2. 3. 4. 5. 6. 7. 8. 9.
Define inputs and outputs
Define states and their descriptions Determine the number of state bits q log2n Fill in a 2p+q-row next-state table Fill in a 2q-row output table Solve q (p+q)-variable next-state K-maps Solve m q-variable output K-maps Draw logic diagram Draw state transition diagram WITH KEY and n2p arcs