State merging and state splitting via state assignment: a new FSM synthesis algorithm

Indexing terms: FSM synthesis, State assignment, State reduction, Design automation Abstract: In the paper the authors describe a state assignment algorithm for FSMs which produces an assignment of non-necessarily distinct, and eventually, incompletely specified codes. In this new approach, state reduction and state assign- ment are dealt with concurrently, and a restricted state splitting technique is explored. The algo- rithm is particularly appropriate for machines with compatibility relations among its states because the potentials of state merging are exploited during the state assignment step. The input to SMAS, the program implementing the algorithm, is a symbolic cover of the FSM. The output is a Boolean representation of both next state and output functions suitable to minimise with ESPRESSO. The machines in the MCNC benchmark set are used to test the new algorithm and to compare it with a well known state assign- ment program.

[1]  Watts S. Humphrey,et al.  Switching circuits with computer applications , 1958 .

[2]  Douglas B. Armstrong,et al.  A Programmed Algorithm for Assigning Internal Codes to Sequential Machines , 1962, IRE Trans. Electron. Comput..

[3]  Richard Edwin Stearns,et al.  Some Dangers in State Reduction of Sequential Machines , 1962, Inf. Control..

[4]  Stephen H. Unger,et al.  Asynchronous sequential switching circuits , 1969 .

[5]  Arun K. Choudhury,et al.  On the Determination of Irredundant Prime Closed Sets , 1971, IEEE Transactions on Computers.

[6]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[7]  Charles P. Pfleeger,et al.  State Reduction in Incompletely Specified Finite-State Machines , 1973, IEEE Transactions on Computers.

[8]  Jeanine Weekes Schroer,et al.  The Finite String Newsletter Abstracts of Current Literature Glisp User's Manual , 2022 .

[9]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[10]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[11]  Giovanni De Micheli.  Symbolic Design of Combinational and Sequential Logic Circuits Implemented by Two-Level Logic Macros , 1986, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Alberto L. Sangiovanni-Vincentelli,et al.  Irredundant sequential machines via optimal logic synthesis , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  G. Rietsche,et al.  CASTOR: state assignment in a finite state machine synthesis system , 1990, [Proceedings] EURO ASIC `90.

[14]  Tiziano Villa,et al.  NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations , 1989, 26th ACM/IEEE Design Automation Conference.

[15]  P. Ashar,et al.  Sequential Logic Synthesis , 1991 .

[16]  Exact and heuristic algorithms for the minimization of incompletely specified state machines , 1994, EURO-DAC '91.

[17]  Fabio Somenzi,et al.  Exact and heuristic algorithms for the minimization of incompletely specified state machines , 1994, Proceedings of the European Conference on Design Automation..

[18]  D. Sarma,et al.  Fast heuristic algorithms for finite state machine minimization , 1991, Proceedings of the European Conference on Design Automation..

[19]  José M. Quintana,et al.  Efficient state reduction methods for PLA-based sequential circuits , 1992 .