1

ECE 465 Digital Systems

Instructor: Shantanu Dutt Department of Electrical and Computer Engineering University of Illinois at Chicago

Lecture Notes # 8 State Minimization of Incompletely Specied Machines

c Shantanu Dutt, UIC



 

 

! 

2 State Reduction Algorithm Step 1 Find the maximal compatibles using the implication table and merger diagram. Step 2 Find the maximal incompatibles using the implication table and merger diagram. Step 3 Find the bounds on the # of reqd. states, and : , where # sets of max. compatibles, # of original states and = # states in th max incompatible group. Step 4 Obtain the closure table for all max compatible groups. Step 5 Obtain the covering table in which the rows are the max compatible groups, and the columns are each original state and each distinct next-state-group of the closure table. There is an at the intersection of row i and col j if the state(s) in col j are all contained in the th max compatible group. Step 6 Find the minimum # of max compatible groups that cover all the columns using a technique similar to (single-function) QM; the cost of each max compatible group = 1. Step 7 The set of max compatible groups selected in the above step is the set of new states of the FSM that satisfy completeness and consistency and should be near-minimal in most cases.
  "        $ # % &

Example
x 0 A B C D E 1 B C B C D E A B AD C BC D AC AD E D E D A A B C A/ / C/1 B/0 D/0 /1 /B/ A/0 C/1

(a) State Table (b) Implication Table

Max compatible groups = {(ABD), (ACD), (ACE)} U = min{3,5}

Max incompatible groups = {(BE), (ED)} L=max{2,2}=2

(c) Merger diagram for max compatibles

D X E AC AD X X X X X 2 1

(d) Merger diagram for max incompatibles

x 0 (ABD) (ACD) (ACE) AC AD AD 1 B B C *(ABD) (ACD) *(ACE) A X X X B X X X C x 0 1 A=(ABD) B/1 A/0 B=(ACE) A/0 B/1

(e) Closure Table

1 1 2 1 2 2 1 Minimal cover (selected max compatible groups) = {(ABD), (ACE)}

(g) Reduced State Table

3

(f) Covering Table

c Shantanu Dutt, UIC