State assignment of finite-state machines

The state-assignment problem of finite-state machines (FSMs) is addressed. State assignment is a mapping from the set of states (symbolic names) of an FSM to the set of binary codes with the objective of minimising the area of the combinational circuit required to realise the FSM. It is one of the most important optimisation problems in the automatic synthesis of sequential circuits since it has a major impact on the area, speed, power and testability of the circuits. The problem of finding an optimal state assignment is NP-hard. A new scheme is presented based on mean-field annealing (MFA) to solve the graph-embedding problem which is the main step in the state-assignment process. The MFA algorithm combines the characteristics of the simulated annealing and the Hopfield neural network. To solve the problem by MFA, the graph-embedding problem is mapped into a neural network and an energy function is formulated. Experiments over the MCNC FSM benchmarks demonstrate that the proposed MFA algorithm can produce superior results compared with the specialised methods such as the MUSTANG, NOVA and genetic algorithm.

[1]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  Nirwan Ansari,et al.  Traffic management of a satellite communication network using stochastic optimization , 1996, IEEE Trans. Neural Networks.

[4]  José M. Quintana,et al.  Efficiency of state assignment methods for PLA-based sequential circuits , 1989 .

[5]  Robert K. Brayton,et al.  Optimal State Assignment for Finite State Machines , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  José Nelson Amaral,et al.  Designing genetic algorithms for the state assignment problem , 1995, IEEE Trans. Syst. Man Cybern..

[7]  A. Richard Newton,et al.  MUSE: a multilevel symbolic encoding algorithm for state assignment , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Tevfik Bultan,et al.  A New Mapping Heuristic Based on Mean Field Annealing , 1992, J. Parallel Distributed Comput..

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

[10]  William J. B. Oldham,et al.  Dynamic Task Allocation Models for Large Distributed Computing Systems , 1995, IEEE Trans. Parallel Distributed Syst..

[11]  Massoud Pedram,et al.  A fast state assignment procedure for large FSMs , 1995, DAC '95.

[12]  A. E. A. Almaini,et al.  State assignment of finite state machines using a genetic algorithm , 1995 .

[13]  David E. van den Bout,et al.  Graph partitioning using annealed neural networks , 1990, International 1989 Joint Conference on Neural Networks.

[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]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Bernhard Eschermann,et al.  State assignment for hardwired VLSI control units , 1993, CSUR.

[17]  Alberto L. Sangiovanni-Vincentelli,et al.  MUSTANG: state assignment of finite state machines targeting multilevel logic implementations , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..