Implication Chart method Algorithm for implication chart method

The approach uses a graphical grid to help find any 1. Construct implication chart, one square for each
implications or equivalences. combination
A systematic approach to reducing FSMs 2. Square labeled Si , Sj if outputs differ than square gets
Consider the following state table “X” otherwise write down implied state pairs for all
PS NS OUT input combinations
w=0 w=1 w=0 w=1 3. Advance through chart top-to-down and left-to-right. If
A C F 0 0 square Si , Sj contains NS pair Sm , Sn and that pair labels
B D E 0 0 a square already labeled “X” then Si , Sj is labeled “X”.
C H G 0 0 4. Continue executing STEP 3 until no new squares are
marked with “X”.
D B G 0 0
5. For each remaining unmarked square Si , Sj, then Si and
E E B 0 1
Sj are equivalent.
F F A 0 1
Exercises
G C G 0 1
Ex # 1
H C F 0 0
Determine the reduced state table using Implication chart
The table can be reduced by eliminating equivalent states PS NS OUT
1st, we observe that that states A and H are . w=0 w=1
We construct the implication chart as discussed in class. A D C 0
C-D B F H 0
B C E D 1
E-F
F-G A-D D A E 0
C A-G E-G E C A 1
B-C B-D G-G F F B 1
D F-G E-G A-B G B H 0
X X X --X- H C G 1
E
**The state table reduces to 6 states
X X X X A-B Ex # 2 Find the reduced state table using implication chart.
F E-F
X X X X C-E C-F PS NS OUT
G B-G A-G w=0 w=1 w=0 w=1
A B C D E F R B C 0 0
Since states A and E have different outputs, we place an X in B G H 0 0
the A-E square to indicate their incompatibility. C E R 0 0
Similarly: A-F; A-G; B-E; B-F; B-G; C-E; C-F; C-G; D-E; D F F 0 1
D-F; and D-G are incompatible. E B E 0 0
What remains could be (but not necessarily be) compatible. F D K 0 1
We place C-D and E-F in the square at the intersection of G E F 1 1
row B and column A to indicate the implication. We H R K 1 1
complete the implication chart as shown above. K K F 0 1
We next remove same state pairs (or reflective pairs such as
H-H) and self-implied pairs (such as B-D). **The state table reduces to 7 states
Now, consider square E-G. It contains C-E and B-G. Since C Ex # 3
and E are incompatible, then E and G are incompatible. Using implication chart, reduce the following multiple
Therefore, we cross square E-G. input state table
Also because E G, then B D; B C. P.S N.S OUT
Also because B C then A D. 00 01 10 11
A G, then F G; imply A C
S0 S0 S1 S2 S3 1
Since all squares corresponding to non-equivalent states
S1 S0 S3 S1 S5 0
have been Xed out, the coordinates of the remaining squares
S2 S1 S3 S2 S4 1
indicate equivalent state pairs.
From column-A A B S3 S1 S0 S4 S5 0
From column-C C D S4 S0 S1 S2 S5 1
From column-E E F S5 S1 S4 S0 S5 0
The resulting reduced table is shown below

PS NS OUT
w=0 w=1 w=0 w=1
A’ C E’ 0 0
C’ A’ G 0 0
E’ E’ A’ 0 1
G C’ G 0 1