Finite State Machine Synthesis Based on Relay-Based Algorithm

This paper presents a relay-based algorithm for the synthesis of a finite state machine to determine the optimal state assignment with less area and power dissipations. The algorithm utilizes the experience of past runners as in a relay race by a guide and the configuration of past solutions by a relay. Combined with rough and focusing methods, it could escape local optima and achieve an effective convergence. The experiments performed on a suite of benchmarks have established the fact that the proposed method outperforms the published GA-based algorithms. The quality of the solution obtained and the high rate of convergence have shown the effectiveness of the proposed method in solving the difficult problem.

[1]  Santanu Chattopadhyay,et al.  Finite state machine state assignment targeting low power consumption , 2004 .

[2]  Atsushi Takahashi,et al.  Relay-Race Algorithm: A Novel Heuristic Approach to VLSI/PCB Placement , 2011, 2011 IEEE Computer Society Annual Symposium on VLSI.

[3]  Yinshui Xia,et al.  Genetic algorithm based state assignment for power and area optimisation , 2002 .

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Wen-Tsong Shiue,et al.  Novel state minimization and state assignment in finite state machine design for low-power portable devices , 2005, Integr..

[6]  Walid Mohamed Aly.  Solving the State Assignment Problem Using Stochastic Search Aided with Simulated Annealing , 2009 .

[7]  Tiziano Villa,et al.  Synthesis of FSMs: logic optimization , 1997 .

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

[9]  Sying-Jyan Wang,et al.  State assignment of finite state machines for low power applications , 1996 .

[10]  Chong-Min Kyung,et al.  State assignment in finite state machines for minimal switching power consumption , 1994 .

[11]  Edward J. McCluskey,et al.  The Coding of Internal States of Sequential Circuits , 1964, IEEE Trans. Electron. Comput..

[12]  Santanu Chattopadhyay,et al.  Area Conscious State Assignment with Flip-Flop and Output Polarity Selection for Finite State Machine Synthesis?A Genetic Algorithm Approach , 2005, Comput. J..

[13]  Neil Urquhart,et al.  State assignment for sequential circuits using multi-objective genetic algorithm , 2011, IET Comput. Digit. Tech..

[14]  F. Joel Ferguson,et al.  On state reduction of incompletely specified finite state machines , 2007, Comput. Electr. Eng..

[15]  Stephen H. Unger,et al.  A Note on the Number of Internal Variable Assignments for Sequential Switching Circuits , 1959, IRE Trans. Electron. Comput..

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

[17]  A.E.A. Almaini,et al.  Minimisation of multioutput Reed-Muller binary decision diagrams using hybrid genetic algorithm , 1995 .