21 - General Finite State Machines: Mealy and Moore...

This preview shows pages 1–5. Sign up to view the full content.

1 General Finite State General Finite State Machines: Machines: Mealy and Moore Mealy and Moore ECSE-2610 Co mputer C perations (CoCO) Fall 2006 11/02/06

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

View Full Document
2 Recap: Vending Machine Recap: Vending Machine Delivers package of gum after 15 cents is deposited Single coin slot for dimes, nickels No change given Reset N N N, D [ open ] 15¢ 10¢ D D Present State 10¢ 15¢ D 0 0 1 1 0 0 1 1 0 0 1 1 X N 0 1 0 1 0 1 0 1 0 1 0 1 X Inputs Next State 10¢ X 10¢ 15¢ X 10¢ 15¢ 15¢ X 15¢ Output Open 0 0 0 X 0 0 0 X 0 0 0 X 1
3 Combinational logic for outputs Recap: Vending Machine FSM Recap: Vending Machine FSM D 1 = Q 1 + D + Q 0 N D 0 = N Q 0 + Q 0 N + Q 1 N + Q 1 D OPEN = Q 1 Q 0 Step 6. Implementation: D FFs Step 6. Implementation: D FFs Combinational logic for next state inputs Flip-Flops (memory) CLK OPEN CLK Q 0 D R Q Q D R Q Q \ Q 1 \reset \reset \ Q 0 \ Q 0 Q 0 Q 0 Q 1 Q 1 Q 1 Q 1 D D N N N \ N D 1 D 0

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

View Full Document
4 General Circuit Structure General Circuit Structure
This is the end of the preview. Sign up to access the rest of the document.

This homework help was uploaded on 04/22/2008 for the course ECSE 2610 taught by Professor Ji during the Spring '08 term at Rensselaer Polytechnic Institute.

Page1 / 18

21 - General Finite State Machines: Mealy and Moore...

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

View Full Document
Ask a homework question - tutors are online