06_fsms - Finite State Machines Readings: 8-8.4.7 Need to...

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

View Full Document Right Arrow Icon
110 Finite State Machines Readings: 8-8.4.7 Need to implement circuits that remember history Traffic Light controller, Sequence Lock, . .. History will be held in flip flops Sequential Logic needs more complex design steps State Diagram to describe behavior State Table to specify functions (like Truth Table) Implementation of combinational logic as controller Controller (combinational logic) FFs Inputs Outputs Next State Previous (Current) State 111 Finite State Machine Example Example: Odd Parity Checker Assert output whenever have previously seen an odd # of 1's (I.e. how many have you seen NOT INCLUDING the current one) State Diagram Even: State = 0, Odd: State = 1 Even Out=0 Odd Out=1 Reset 0 0 1 1 Present State Input Next State Output 00 01 10 11
Background image of page 1

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

View Full DocumentRight Arrow Icon
112 Finite State Machine Example (cont.) NS = PS xor Input; OUT = PS Clk Input 10 0 11 0 101 11 0 D R Q Input CLK PS Reset NS Output PS/Output 113 State Diagrams Graphical diagram of FSM behavior States represented by circles Transitions (actions) represented by arrows connecting states Outputs labeled on states Labels on Transitions give cause of action Note: We cover Moore machines here;
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 02/11/2012.

Page1 / 12

06_fsms - Finite State Machines Readings: 8-8.4.7 Need to...

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

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