A Uniform Framework of Low Power FSM Partition Approach

A new finite state machine (FSM) partitioning approach is proposed in this paper. Genetic algorithm (GA) is employed to search the optimal or near optimal partition. A new cost function is used to guide the optimization. The proposed algorithm is implemented in C. A new design model is proposed to implement partitioned sub-FSMs, which makes the existing monolithic FSM state assignment be applicable to partitioned FSMs. The experiment results show that the proposed approach can reduce power dissipation up to 80%.

[1]  Irith Pomeranz,et al.  GALLOP: genetic algorithm based low power FSM synthesis by simultaneous partitioning and state assignment , 2003, 16th International Conference on VLSI Design, 2003. Proceedings..

[2]  José C. Monteiro,et al.  Finite state machine decomposition for low power , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[3]  Bengt Oelmann,et al.  Mixed synchronous/asynchronous state memory for low power FSM design , 2004 .

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

[5]  Alan G. Williamson,et al.  Solving linear and non-linear equations , 1994 .

[6]  Chi-Ying Tsui,et al.  Finite state machine partitioning for low power , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[7]  TingTing Hwang,et al.  Low power realization of finite state machines—a decomposition approach , 1996, TODE.

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

[9]  Aurobindo Dasgupta,et al.  Divide and conquer: a strategy for synthesis of low power finite state machines , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.