EE101Lecture20

EE101Lecture20 - Introduction to Digital Logic Lecture 20:...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
© Mark Redekopp, All rights reserved Introduction to Digital Logic Lecture 20: State Machines State Machine Analysis
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
© Mark Redekopp, All rights reserved State Machines • Provide the “brains” or control for electronic and electro- mechanical systems • Implement a set of steps (or algorithm) to control or solve a problem • Combine Sequential and Combinational logic elements – Sequential Logic to remember what step (state) we’re in – Combinational Logic to find what step (state) to go to next • Goal is to generate output values at specific times • Use state diagrams (a.k.a. flowcharts) to specify the operation of the corresponding state machine
Background image of page 2
© Mark Redekopp, All rights reserved Washing Machine State Diagram Boxes represent states or steps in the algorithm Arrows = transitions w/ conditions telling us when to take that transition Output values can be associated with a state and transition or only with a state Idle N=2 Fill WV = 1 Agitate Motor = 1 Drain DV = 1 N = N - 1 N > 0 N = 0 COINS + DOOR COINS • DOOR FULL FULL 5 MIN 5 MIN / Reset_Timer=1 EMPTY EMPTY Outputs Generated Transition Conditions /RESET
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
© Mark Redekopp, All rights reserved Washing Machine State Diagram We move through the states based on the conditions. Outputs get asserted when the machine is in that state and the transition is true. Idle N=2 Fill WV = 1 Agitate Motor = 1 Drain DV = 1 N = N - 1 N > 0 N = 0 COINS + DOOR COINS • DOOR FULL FULL 5 MIN 5 MIN / Reset_Timer=1 EMPTY EMPTY /RESET Stay in the initial state until there is enough money (coins) and the door is closed
Background image of page 4
© Mark Redekopp, All rights reserved Washing Machine State Diagram Idle N=2 Fill WV = 1 Agitate Motor = 1 Drain DV = 1 N = N - 1 N > 0 N = 0 COINS + DOOR COINS • DOOR FULL FULL 5 MIN 5 MIN / Reset_Timer=1 EMPTY EMPTY /RESET Move to the Fill state when there is enough money (coins) and the door is closed
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
© Mark Redekopp, All rights reserved Washing Machine State Diagram Stay in the Fill state until it is full…also set the Water Valve Open output to be true Idle N=2 Fill WV = 1 Agitate Motor = 1 Drain DV = 1 N = N - 1 N > 0 N = 0 COINS + DOOR COINS • DOOR FULL FULL 5 MIN 5 MIN / Reset_Timer=1 EMPTY EMPTY /RESET
Background image of page 6
© Mark Redekopp, All rights reserved Washing Machine State Diagram Move to the Agitate state after it is full Idle N=2 Fill WV = 1 Agitate Motor = 1 Drain DV = 1 N = N - 1 N > 0 N = 0 COINS + DOOR COINS • DOOR FULL FULL 5 MIN 5 MIN / Reset_Timer=1 EMPTY EMPTY /RESET
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
© Mark Redekopp, All rights reserved State Machines Use sequential and combinational logic to implement a set of steps (i.e. an algorithm) Goal is to produce outputs at specific points of time – Combinational logic alone cannot do that because the outputs will change as soon as the inputs change (no notion of time)
Background image of page 8
© Mark Redekopp, All rights reserved State Diagrams • Used to show operation or function of a state machine • Like a flowchart but called a state diagram • 3 parts – States – Transitions –Ou tpu ts State Diagram for a Washing Machine Idle N=2 Fill WV = 1 Agitate Motor = 1 Drain DV = 1 N = N - 1 N > 0 N = 0 COINS + DOOR COINS • DOOR FULL FULL 5 MIN 5 MIN / Reset_Timer=1 EMPTY EMPTY /RESET
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/27/2008 for the course EE 101 taught by Professor Redekopp during the Fall '06 term at USC.

Page1 / 36

EE101Lecture20 - Introduction to Digital Logic Lecture 20:...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online