270L08-FSM+Analysis - Finite State Machines (FSMs) Now that...

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

View Full Document Right Arrow Icon
1 1 UM EECS 270 Fall 2009 Finite State Machines (FSMs) Now that we understand sequential circuits, we can use them to build: Synchronous (Clocked) Finite State Machines Finite number of states Flip-flops/latches run on clock signal(s) 2 FSM components: Next state logic (combinational) : next state = f(current state, inputs) Memory (sequential) : stores state in terms of state variables Output logic (combinational) : function depends on FSM type: Moore Machine : output = g(current state) Mealy Machine : output= g(current state, inputs) Next-State Logic Output Logic State (memory) Inputs Outputs Clock
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 3 UM EECS 270 Fall 2009 FSM Analysis • Goal: Given a FSM circuit, describe the circuit’s behavior 4 Excitation equations describe memory (FF or latch) input signals as a function of inputs and current state (i.e., state variables) 0 0 Q EN D = ( ) 1 1 0 1 Q EN Q Q EN D + = Excitation Equations:
Background image of page 2
3 5 UM EECS 270 Fall 2009 Transition equations describe the next state as a function of inputs and current state
Background image of page 3

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

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

This note was uploaded on 04/18/2011 for the course EECS 270 taught by Professor David during the Spring '11 term at Michigan State University.

Page1 / 5

270L08-FSM+Analysis - Finite State Machines (FSMs) Now that...

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

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