Table of Contents
Chapter 9 -- Simplification of Sequential Circuits
Redundant States in Sequential Circuits
Equivalent States
Equivalent States Illustration
Equivalence Relations
Methods for Finding Equivalent States
Finding Equivalent States By Inspection
Finding Equivalent States by Partitioning
Example 9.2 -- Partitioning example
Example 9.3 -- Another partitioning example
Example 9.4 -- Yet another partitioning example
Finding Equivalent States by Implication Tables
Example 9.5 -- Using implication tables to find equivalent states
Example 9.6 -- An implication table example
Incompletely Specified Circuits
Compatibility Relations
Examples 9.8 and 9.9 -- Generating Maximal Compatibles and Incompatibles
Merger diagrams
Example 9.10 -- Merger diagrams for example 9.8
Minimization Procedure
Bounding the number of states
State Reduction Algorithm
Example 9.11 -- Reduced state table corresponding to example 9.8
Example 9.12 -- State reduction problem
Example 9.13 -- Another state table reduction problem
Example 9.14 -- Yet another state reduction problem
Example 9.15 -- Optimal state assignments
Unique State Assignments for Four States
State Assignments for a Four State Machine
D flip-flop realization for assignment 1
D flip-flop realization for assignment 2
D flip-flop realization for assignment 3
State adjacencies for four-state assignments
Example 9.18 -- Implication Graphs
Example 9.19 -- Closed subgraphs
Example 9.20 -- Optimal state assignment
PPT Slide
A D flip-flop realization of the previous example
Example 9.24 -- Closed partitions
Example 9.25 -- Cross dependency
|