FSM Decomposition for Low Power in FPGA

In this paper, the realization of low power finite state machines (FSMs) on FPGAs using decomposition techniques is addressed. The original FSM is divided into two submachines using a probabilistic criterion. Only one submachine is active at a time, meanwhile the other is disabled to save power. Different deactivation alternatives and state encoding have been studied. For each option, actual measurements of power consumption have been done using the MCNC and the PREP benchmark circuits. A Xilinx XC4K device has been utilized as technological framework. The proposed technique fits well with big FSM, where power reductions up to 46% are obtained.

[1]  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).

[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]  Reiner Kolla,et al.  Spanning tree based state encoding for low power dissipation , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[4]  Luca Benini,et al.  Automatic synthesis of low-power gated-clock finite-state machines , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Chi-Ying Tsui,et al.  Exact and Approximate Methods for Calculating Signal and Transition Probabilities in FSMs , 1994, 31st Design Automation Conference.

[6]  Thomas Müller-Wipperfürth,et al.  FSM decomposition revisited: algebraic structure theory applied to MCNC benchmark FSMs , 1991, 28th ACM/IEEE Design Automation Conference.

[7]  Dwight B. Davis.  Tektronix Inc. , 1993 .

[8]  Luca Benini,et al.  Transformation and synthesis of FSMs for low-power gated-clock implementation , 1995, ISLPED '95.

[9]  Madhav P. Desai,et al.  Orthogonal partitioning and gated clock architecture for low power realization of FSMs , 2000, Proceedings of 13th Annual IEEE International ASIC/SOC Conference (Cat. No.00TH8541).

[10]  Luca Benini,et al.  State assignment for low power dissipation , 1995 .

[11]  Srinivas Devadas,et al.  Optimum and heuristic algorithms for an approach to finite state machine decomposition , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Massoud Pedram,et al.  Multi-code state assignment for low power design , 2000 .

[13]  Madhav P. Desai,et al.  Decomposition of finite state machines for area, delay minimization , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[14]  A. Despain,et al.  Low Power State Assignment Targeting Two- And Multi-level Logic Implementations , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[15]  Marios C. Papaefthymiou,et al.  Precomputation-based sequential logic optimization for low power , 1994, ICCAD '94.

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

[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]  Julien Dunoyer,et al.  Intrinsic Limitations of Logarithmic Encodings for Low Power Finite State Machines , 1997 .

[19]  E. Boemo,et al.  End-user low-power alternatives at topological and physical levels. Some examples on FPGAs , 2000 .