{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture 8-10

# Lecture 8-10 - Lecture 8-10 Announcements Hwk 3 due Friday...

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

Lecture 8-10 –9/13/10 –9/17/10 Announcements Hwk 3 due Friday; Hwk 4 posted Tuesday night Abbreviated office hours on Wednesday Test 1: Sept. 29 th BEL 328 5:45 -7PM through Lecture 10 Last Week (P&P 3.4-3.6) Storage Sequential Logic Clocks This Week (P&P 3.6-3.7; 2) Finite State Machines LC-3 Datapath Representation Next Week LC-3 CS310 Fall 2010 -Boral Finite State Machine (FSM) A mechanism for describing a system that includes storage and computation Output is a function of the inputs as well as history Implemented by sequential logic Represented by a state diagram States (Circles) Transitions (Arcs) Example: D-Latch CS310 Fall 2010 -Boral

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

View Full Document
FSM: Definition An FSM has the following components: A set of states A set of inputs A set of outputs A state transition function (of the states and inputs) An output function Moore machine: of the states only Mealy machine: of the states and inputs An FSM is synchronous if all changes to memory (state) occur at the same time determined by a global system clock Represented by a state diagram States (Circles, labeled with output (Moore)) Transitions (Arcs, labeled with input values and output (Mealy)) Clock is typically not shown CS310 Fall 2010 -Boral Example 1: 2-Bit Counter Counter starts at 0 (green), increments each time the clock cycles, overflowing back to 0 when it gets to 3 H old L old H new L new 0 0 0 1 0 1 1 0 1 0 1 1 1 1 0 0 CS310 Fall 2010 -Boral
Example 1: 2-Bit Counter (cont’) L new = H old ’L old ’ + H old L old ’ = L old H new = H old ’L old + H old L old H old L old H new L new 0 0 0 1 0 1 1 0 1 0 1 1 1 1 0 0 CS310 Fall 2010 -Boral Example 2: 2-Bit Counter With Reset Counter starts at 0 (green), increments each time the clock cycles, overflowing back to 0 when it gets to 3 L new = R’H old ’L old ’ + R’H old L old = R’L old ’ = (R + L old )’ H new = R’H old ’L old + R’H old L old = R’(H old ’L old + H old L old ’) R H old L old H new L new 0 0 0 0 1 0 0 1 1 0 0 1 0 1 1 0 1 1 0 0 1 X X 0 0 CS310 Fall 2010 -Boral

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

View Full Document
Example 2: 2-Bit Counter With Reset (cont’) L new = (R + L old )’ H new = R’(H old ’L old + H old L old ’) CS310 Fall 2010 -Boral Example 3: 2-Bit Counter With Display Each segment in the display can be lit independently to allow all ten decimal digits to display L new = (R + L old )’ H new = R’(H old
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 14

Lecture 8-10 - Lecture 8-10 Announcements Hwk 3 due Friday...

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

View Full Document
Ask a homework question - tutors are online