UMBC CMSC 313, Computer Organization & Assembly Language, Fall 2003, Section 0101

Finite State Machine Design

Tuesday 12/02, 2001

Up]

Assigned Reading in Murdocca & Heuring:   

Assigned Reading in Neveln:   

Assigned:  digsim2

Due:   

Topics Covered:

• Slides are available in PDF: Slides26.pdf
• Reviewed three steps involved in simplifying a finite state machine: state reduction, state assignment and choice of flip-flops. The first two of these were discussed in detail last lecture. This lecture discussed choice of flip-flops using the serial adder example in the textbook and also the sequence detector example.
• Discussed DigSim Exercise 2.

Circuits in DigSim:

Following these links will launch the DigSim Java applet and load the circuit described.

• A Sequence Detector (optimized)