ESKISS : a program for optimal state assignment
Cam Oerlemans, Jfm Frans Theeuwen · TU/e Research Portal · 1987
Report on activity S.2.A: Review of the state encoding problem.Study of relations between state encoding and logic minimisation.Abatract: Solving the problem of optimal state assignment solves a variety of problems involving controllers, as they can effectively be realized using a Finite State Machine (FSM).Assigning the right codes to the right states of the FSM is very important, as it strongly affects the size of the implementation of the FSM.In this report an algorithm is presented, eskiss, that searches for an optimal encoding o~ the states with regard to the needed size of a PLA to implement the FSM.The description of the FSM is given by means of a symboliC cover (state transition table) and is firstly minimized by the symbolic minimizer ESPRESSO.Eskisa generates state groups, containing states that show identical transitions in the transition table.Based on these state groups a relation can be stated, such that if the encodings of the states satisfy the relation.the assignment has been optimal with regard to the size of the PLA.This relation is called the constraint relation.Eskiss generates an encoding that satisfies this constraint relation.