This course on Finite State Machines aims to teach students the following learning outcomes and goals: understanding the problem, drawing initial and minimized state diagrams, performing state assignment, choosing flip-flops, implementing D flip-flops, interpreting outputs, analyzing simulation results, and grasping schematic notation. The course covers topics such as specifications, state transition diagrams (Mealy and Moore), state transition tables (Mealy and Moore), and Gray coding. The teaching method involves a lecture format, and the intended audience includes students studying digital circuits and those interested in learning about Finite State Machines.
Overview
Syllabus
Intro
FINITE STATE MACHINE (FSM) Step 1: Understand the Problem
DRAW INITIAL DIAGRAM
DRAW MINIMIZED STATE DIAGRAM
PERFORM STATE ASSIGNMENT
STEP 5: CHOOSE FLIP-FLOPS
SPECIFICATIONS
UNDERSTAND PROBLEM
D FLIP-FLOP IMPLEMENTATION
OUTPUTS
SIMULATION RESULTS
SIDENOTE ON SCHEMATIC NOTATION
B: RENAME NET
DESCRIPTION OF PROBLEM
STATE TRANSITION DIAGRAM (MEALY)
STATE TRANSITION DIAGRAM (MOORE) 01
STEP 4: STATE TRANSITION TABLE (MEALY)
NOTE ON MOORE MACHINE
STEP 4: STATE TRANSITION TABLE (MOORE)
NOTE ON MEALY MACHINE
GRAY CODING Initial State
Taught by
Colin O'Flynn
