218L21F08

# 218L21F08 - ESE218 Lecture 21 FSM examples Binary...

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

11/25/08 ESE218 Fall 2008 Lecture 21 1 ESE218 Lecture 21: FSM examples, Binary Multipliers Outline ± Finite state machine ± Examples ± Binary multiplication ± Combinational multipliers ± Sequential multipliers ± algorithm ± block diagram ± Design examples ± Summary

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

View Full Document
11/25/08 ESE218 Fall 2008 Lecture 21 2 Max operating frequency Q 1 Q 0 t PROP COMB t SETUP t PROP-FF t PROP COMB t SETUP t PROP-FF t PROP COMB t SETUP t PROP-FF MIN CLOCK PERIOD FF 0 FF 1 CLK Combinational circuit: FF excitation X Combinational circuit: Moore output Z 1 Combinational circuit: Mealy output Z 2
11/25/08 ESE218 Fall 2008 Lecture 21 3 1 st vending machine 215 B.C.: A self-contained urn squirted holy water whenever a patron of the church inserted a coin

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

View Full Document
11/25/08 ESE218 Fall 2008 Lecture 21 4 Contemporary vending machine
11/25/08 ESE218 Fall 2008 Lecture 21 5 2-coin vending machine Design the synchronous controller for a candy vending machine that uses only nickels and dimes. A candy bar costs 10c and only one coin can be dropped into the coin detection mechanism at a time. 1) 1 DIME or 2 NICKELS should dispense a CANDY BAR 2) 1 NICKEL and 1 DIME should dispense a CANDY BAR and 5c CHANGE should be returned Assume the clock speed is much faster than the time it takes for a coin to drop through the detection mechanism. When a nickel (dime) drops into the slot, the detection mechanism provides 1 for input N (D) until the coin leaves the coin slot and drops into the collection bucket, at which time N (D) returns to 0.

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

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

## This note was uploaded on 03/21/2010 for the course ESE 218 taught by Professor Donetsky during the Fall '08 term at SUNY Stony Brook.

### Page1 / 24

218L21F08 - ESE218 Lecture 21 FSM examples Binary...

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

View Full Document
Ask a homework question - tutors are online