Week9, Lecture2: Sequential

Click here to start

Table of Contents

Overview
Moore versus Mealy machines
Specifying outputs for a Moore machine
Specifying outputs for a Mealy machine
Comparison of Moore and Mealy machines
Class example: Moore versus Mealy machines
Class example: Moore versus Mealy machines
Design example: A vending machine
Abstract representation: State diagram
State minimization & symbolic state table
State encoding
Minimize logic
Implement design
Map design to registered PLD
Retime design
Retimed PLD implementation
Vending machine as a Mealy machine
Synchronous (or registered) Mealy machine

Author: Chris Diorio

Email: cse-webmaster@cs.washington.edu

Home Page: http://www.cs.washington.edu/education/courses/370/CurrentQtr