Professional Documents
Culture Documents
Techniques
Presented By :
Name:
Amit Grover
Email :
grover@usc.edu
Definition
Given a sequential machine, our aim is to
find the finite state machine which have
same behavior as the given machine but has
reduced states.
01
11
10
State
Variables
1
2
3
4
6
State
Variables
External Inputs
A
B
1
2,0
3,1
4,1
1,0
2,0
1,1
3,1
6,0
6,0
5,1
4,1
5,0
5
6
No dont
cares
State
Variables
External Inputs
A
B
1
-,0
3,1
4,1
-,0
2,0
1,-
3,1
-,-
6,0
5,1
-,-
-,0
5
6
10
11
Pairchart Algorithm.
-
Flow table.
12
Given CSSM
A
2,0
3,1
4,1
1,0
2,0
1,1
3,1
6,0
6,0
5,1
4,1
5,0
5
6
Figure 1
13
2,0
3,1
4,1
1,0
2,0
1,1
3,1
6,0
6,0
5,1
4,1
5,0
14
15
Increasing Order
1
2
3
4
5
6
1
Increasing Order
6
16
Increasing Order
1
2
3
Cutting
from
diagonal
4
5
6
1
Increasing Order
6
18
Increasing Order
A
Figure2
1
1
2
3
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
5
6
1
Increasing Order
6
19
Column 1
- Check if 1 is output compatible
1
2
3
1
2
Answer: No.
For same Input A or B
State 1 and State 2 has
different output.
5
6
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
5
6
1
6
21
Column 1
-check if 1 is output compatible
with 3 for both input A and B
1
2
Answer: Yes.
For same Input A and B
State 1 and State 3 has
same output.
-So we dont do
anything with the
block at the inter
section of 1 and 3.
3
4
1
2
3
4
5
6
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
5
6
1
6
22
1
2
5
X
5
6
4
X
3
4
1
2
3
X
1
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
X
X
X
2
6
23
24
X
1
5
X
1
2
3
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
X
X
X
2
6
25
26
1
X
3
4
X
1
5
6
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
X
1
X
3
6
27
1
X
2
3
2
3
X
4
X
1
X
2
5
6
5
6
1
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
X
X
X
3
6
28
4
5
6
2
3
1
2
X
1
4
X
X
4
X
3
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
X
3
X
5
6
29
Column 1
- Check each block in column 1 for
e.g block at the intersection of 1 and 3.
Check Row 2 Column 2
and vice versa..
2 = 2, so
it is okay.Reason is on Slide 17
1
X
2
3
5
6
X
1
X
4
3
1
6
2
4
5
6
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
1
2
3
X
5
6
31
Column 1 continue.
- Checking next block in column 1
i.e block at the intersection of 1 and 5.
1
X
2
3
X
1
X
4
3
4
5
1
6
X
4
X
1
4
5
6
1
2
3
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
X
3
X
5
6
32
Column 2
- Check each block in column 2
for e g block at the intersection of 2 and 4.
Check Row 4 Column 3
and vice versa
It has a Cross So Mark
This block with X
Column 3 Row 4.
1
X
2
3
4
5
6
4
3
3
X
1
1
6
X
4
X
3
1
2
3
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
X
3
X
5
6
33
1
2
3
2
3
5
6
X
1
X
4
3
4
5
1
x6
X
4
X
3
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
X
3
X
4
X
5
6
34
36
5
2
6
4
->Look at column 1
6 is compatible with none
37
38
4
5
2
6
39
1
2
3
4
5
6
2,0
4,1
2,0
3,1
6,0
4,1
3,1
1,0
1,1
6,0
5,1
5,0
A
135
26,0
B
135,1
26
4,1
135,0
135,1
26,0
ISSM Algorithm
ISSM Algorithm is continuation of CSSM
pairchart algorithm..
But there are some more additional algorithms..
Steps
Pairchart (we already discussed)
Skill algorithm( To get MCs (Maximum Compatibility
Sets)
Bargain Hunter Algorithm.
MEU
42
ISSM - Pairchart
Since we had talked about Pairchart, I will
skip the details and will proceed further..
But one thing to keep in mind is that in ISSM
we have dont cares and in the pairchart where
ever we encounter dont cares we write dont
cares directly..
Example is shown in the next slide.
43
Given:
5
6
7
8
44
1
2
X
8
45
Skill Algorithm
This algorithms helps us to get minimal
covering machine for ISSM.
This algorithms gives the MCs (Maximum
Compatibility.
Lets see how it works
46
47
Sk
NULL
NULL
MCs
7
6
5
4
3
2
1
48
Look for
states which
intersect
Concatenate 7
with states which
Intersects.
In this case nothing intersect so
Put just 7 in L
MCs
Sk
NULL
NULL
NULL
7,8
Nothing covers
each other so
6
5
4
3
2
1
49
Sk
NULL
NULL
NULL
7,8
67,6
67,8
67 covers 6 and
7 But not 8 so
67,8 in L
5
4
3
2
1
50
Look for
states which
Intersects.
Sk
NULL
NULL
NULL
7,8
67,6
67,8
67
567,5
567,8
MCs
4
3
2
1
51
Look for
states which
Intersects.
Sk
NULL
NULL
NULL
7,8
67,6
67,8
67
567,5
567,8
46,4
567,46,8
46 covers 4
so 567,8, 46
in L
3
2
1
52
Look for
states which
Intersects.
MCs
Sk
NULL
NULL
NULL
7,8
67,6
67,8
67
567,5
567,8
46,4
567,46,8
567
3567,3
46,3567,8
3567 covers
5,367 but not
8,46 so 3567,8, 46
in L
2
1
53
MCs
Sk
NULL
NULL
NULL
7,8
67,6
67,8
67
567,5
567,8
46,4
567,46,8
567
3567,3
46,3567,8
347
24,237,2
46,24,3567
,8,237
24,237 covers 2
so 3567,8, 46,237,24
in L
54
MCs
Sk
NULL
NULL
NULL
7,8
67,6
67,8
67
567
567,8
46
567,46,8
567
3567
46,3567,8
347
24,237
46,24,3567
,8,237
14,1
46,8,3567,
24,237,14
14 covers 1 so
3567,8,46,237,24,14
in L
55
56
1
2
4
3
4
X
4
X
5
6
-,0
-,0
1,1
2,-,5,-
1
2
3
4
2
5
1 2
2 4
2
4
2
5X
-,-,0
2,4,4,1
-,0
4,3,-,-,-,1
2,0
6
57
Skill Algorithm
MCs
Sk
NULL
NULL
5,6
45
45,6
456
345,36
345,36
24
24,36,345
2456
16,145,124
124,16,145,
345,36
60
MCs from
Skill Algorithm
36
16
34
35
45
12
14
24
15
All Possible
Subsets of MCs
3
4
5
1
2
61
62
Inputs
1
CS
345
12
24
124
34
145
36
15
16
16
34
12
24
35
24
45
12
34
14
24
15
1
2
3
4
-,0
-,-
4,-
-,0
-,0
3,-
1,1
2,-
-,-
2,-
4,-
-,-
-,-
4,1
-,1
5,-
-,0
2,0
63
Inputs
1
CS
345
12
24
124
34
145
36
15
16
16
34
12
24
35
24
45
12
34
14
24
15
1
2
3
4
-,0
-,-
4 ,-
-,0
-,0
3,-
1,1
2,-
-,-
2,-
4,-
-,-
-,-
4,1
-,1
5,-
-,0
2,0
64
65
Inputs
1
CS
345
12
24
12,24
124
34
34
145
NULL
36
15
15
16
16
24
34
12
24
12,24
35
24
24
45
NULL
12
34
34
14
NULL
24
NULL
15
NULL
NULL
NULL
NULL
NULL
NULL
NULL
1
2
3
4
5
6
-,0
-,0
1,1
2,-,5,-
-,-,0
2,4,4,1
-,0
4,3,-,-,-,1
2,0
66
Inputs
1
CS
345
12
24
12,24
124
34
34
Ignore
145
Singleton 36
NULL
15
15
16
16
24
34
12
24
12,24
35
24
24
45
NULL
12
34
34
14
NULL
24
NULL
15
NULL
NULL
NULL
NULL
NULL
NULL
NULL
1
2
3
4
5
6
-,0
-,0
1,1
2,-,5,-
-,-,0
2,4,4,1
-,0
4,3,-,-,-,1
2,0
67
CS
345
12,24
124
34
145
NULL
36
15
16
24
34
12,24
35
24
45
NULL
12
34
14
NULL
24
NULL
15
NULL
NULL
NULL
NULL
CC 24 is better than CC 2
NULL
NULL
NULL
CC
CS
PC
345
12,24
345
124
34
124
145
NULL
145
36
15
36
16
24
16
35
24
35
24
NULL
24
NULL
NULL
Prime Compatibles
70
MEU Method
PCs : 345, 124, 145, 36 ,16 ,35, 24, 3,6
State 2 is occurring the least.
choose 2 and write all those PCs
which covers 2 i.e PC 24,124
24
Starting Point
NULL
(1,2,3,4,5,6)
324433
Uresin class
Number of occurrences
in PCs
124
PCs : 345,124,145,36,16,35,24,3,6
72
MEU Method
36
We will choose 1/5/6
I am choosing right most
You can choose whatever
you want
16
24
6
(1,2,3,4,5,6)
PC 124 has CS
34 and thus
includes
1,2 3,and 4
but not
5,6
so Uresinof 124 is
(34,5,6)
3 4 3 3
Number of occurrences
in PCs
124
(34,5,6) Uresin class
1, 3, 3
345
We will choose 34
Left most
73
MEU Method
PC
CS
345
12,24
124
34
145
NULL
36
15
16
24
35
24
24
NULL
NULL
NULL
PC 36 has
CS 15 and thus
when compared
with previous PC
24s Uresin class
It includes
everything
So its Uresin is 15
36
(15)
24
(1,3,5,6)
NULL
16
(3,5)
PC 16 has CS 24,
but 24 does not appear
in the Uresin class of 16
because 24 is contained
in earlier node 24.
Thats why this node is
NOT eliminated by P1
- see Pruning Principle
slides below).
PC 6 has
CS NULL and thus
when compared
with previous PC
24s Uresin class
It includes
6 but not 1,3,5
thus its
Uresin is 1,3,5
(1,2,3,4,5,6)
124
(34,5,6)
(1,3,5)
345
(6)
PC 345 has
CS 12,24 and Observe
that it covers previous
PC 124 completely.
It shows that Uresin will
be 6 only
74
PCs : 345,124,145,36,16,35,24,3,6
MEU Method
PC 145 has
CS NULL and it
Covers his previous PC
36s Uresin class
completely
So its Uresin is NULL
15 is covered by145
36
(15)
(3,5)
(1,3,5,6)
(1,2,3,4,5,6)
124
(34,5,6)
(NULL)
16
24
NULL
145
(1,3,5)
Since there is
nothing else So no
need to check other
PCs, we will
stop here and will go
ahead to create
Minimum
Covering machine
345
(12,24,6)
PCs : 345,124,145,36,16,35,24,3,6
75
76
Input
145
24
36
States
0
24,0
-,0
-,-
4,-
-,0
-,0
3,-
1,1
2,-
-,-
2,-
4,-
-,-
-,-
4,1
-,1
5,-
-,0
2,0
Input
145
24
36
States
0
24,0
1
24,1
-,0
-,-
4,-
-,0
-,0
3,-
1,1
2,-
-,-
2,-
4,-
-,-
-,-
4,1
-,1
5,-
-,0
2,0
Input
145
24
36
States
0
24,0
1
24,1
2
24,1
-,0
-,-
4,-
-,0
-,0
3,-
1,1
2,-
-,-
2,-
4,-
-,-
-,-
4,1
-,1
5,-
-,0
2,0
Input
145
0
24,0
1
24,1
24
24,0
24,0
36
145,1
24,0
States
2
24,1
36,1
24,0
-,0
-,-
4,-
-,0
-,0
3,-
1,1
2,-
-,-
2,-
4,-
-,-
-,-
4,1
-,1
5,-
-,0
2,0
80
81
84
CS
1345
124,26,56
156
145,246
124
13,26
126
14,15,24
345
24
145
NULL
134
12,26,56
56
45
16
15,24
15
14
24
13
12
26
26
14
34
NULL
NULL
NULL
85
124
(26,56)
124
(13,26)
345
(24,1,6)
NULL
(1,2,3,4,5,6)
134
( 12,26,56)
24
(13,6)
126
(15,24,56)
26
(12,56)
Incomplete
Can be finished as shown
in previous examples.
1345 X P1
134
(12,26,56)
124
(15,56)
24
(15,56)
156 X P2
(145,246,12)
56
(45,12)
34
( 1,2,5,6)
Pruned by P1
because CC
1345 contains
earlier node,
345
Pruned by P2
because the Uresin
class of CC 156
has member 246
that covers
earlier node, 26
86
References
Techniques in Advanced Logic Switching
Theory book by Prof. Ellison
Examples are taken from Discussion
sessions and class lectures and above
mentioned book for easy understanding for
future students.
87
Declaration
I alone prepared and wrote this project. I received no help
from any one else. This material is not copied or
paraphrased from any other source except where
specifically indicated. I grant my permission for this
project to be placed on the course homepage during future
semesters. I understand that I could receive an F for the
course retroactively, even after graduation, if this work us
later found to be plagiarized.
Amit Grover
88