Recall: State Minimization

Two states are equivalent if it satisfies the following:

Corresponding next states for all input combinations are equivalent
Corresponding outputs for all input combinations are the same

Three techniques were taught under EEE 21

Reduction by Inspection (Very tedious, result may still be reducible)
Reduction by Partitioning (Usually involves many steps, gets the job done)
Reduction by Implication (Can be done in one table, gets the job done)

CoE 23: Lecture 2

Reduction by Inspection

CoE 23: Lecture 2

Reduction by Inspection

CoE 23: Lecture 2

Reduction by Inspection

CoE 23: Lecture 2

Reduction by Inspection

CoE 23: Lecture 2

Reduction by Implication

CoE 23: Lecture 2

Reduction by Implication
X
EH
X AD

/ X X
BD BD
CG
X X CG

EH
X AD / X X
AD AD AB
CF X X CF FG
X

CD CD BC AC
AC X X AC AG X AF
EG GH GH
X AH DH
X X X X
DH

CoE 23: Lecture 2

Reduction by Implication
X
EH
A = D = G
X /
AD
B = C = F
/ X X
E = H
X
BD
CG
X X X
BD
CG
I
EH
X /
AD / X X
AD
/
CF X X
AD
/
CF X
AB
FG
X

X
CD
AC X X X
CD
AC
BC
/
AG X X
AC
AF

X X
EG
AH X
GH
DH
X X X
GH
DH
X X

CoE 23: Lecture 2

Reduction by Implication
A = D = G
B = C = F
E = H
I

CoE 23: Lecture 2

Comparison
Reduction by
Inspection:
6 states

Reduction by
Implication:
4 states
CoE 23: Lecture 2
Incompletely Specified Machines
Input sequences that cannot occur will introduce dont
care conditions in state tables

This is a different condition compared to a state machine

with states that will never be activated
In this case, you just let the next states and outputs of those unassigned
states to be dont cares, and then proceed doing K-maps.

CoE 23: Lecture 2

Minimizing ISMs
Brute force: Assign dont cares in all possible ways and
minimize the resultant completely specified tables.

Forming maximum compatible pairs: Using implication

tables to form pairs and then choosing a set of classes
that would cover the new state.

CoE 23: Lecture 2

Brute force

1 = 2 if 2 = 3, but 2 != 3 (different output) so 1 != 2

1 != 3 (different output)
Cannot be reduced!

CoE 23: Lecture 2

Brute force

2 = 3, therefore...

CoE 23: Lecture 2

Now, try minimizing this...

Sorting out compatibles by inspection is VERY tedious!

CoE 23: Lecture 2