Theoretical bounds for switching activity analysis in finite-state machines

2000 ◽  
Vol 8 (3) ◽  
pp. 335-339 ◽  
Author(s):  
D. Marculescu ◽  
R. Marculescu ◽  
M. Pedram
Keyword(s):  
Finite State Machines ◽  
Activity Analysis ◽  
State Machines ◽  
Switching Activity ◽  
Finite State

STATE ENCODING OF FINITE STATE MACHINES FOR LOW POWER DESIGN

1996 ◽  
Vol 06 (06) ◽  
pp. 649-661 ◽  
Author(s):  
DE-SHENG CHEN ◽  
MAJID SARRAFZADEH ◽  
GARY K.H. YEAP
Keyword(s):  
Low Power ◽  
Power Dissipation ◽  
Finite State Machines ◽  
Low Power Design ◽  
Design Flow ◽  
State Machines ◽  
Switching Activity ◽  
Wide Range ◽  
Finite State ◽  
State Encoding

We address the problem of state encoding for synchronous finite state machines (FSMs), targeted for low power design. Most previous work in FSM state encoding has been focused on minimizing chip area and does not consider switching activity of the circuit. As a result, this does not always lead to a power efficient implementation. Especially in CMOS circuits, the switching activity is a very important factor to power dissipation. In this work, we define a function λ for automatic tradeoff between switching activity and area that contribute to power dissipation. λ is used in determining the encoding affinity between states and is observed to be related to the number of states of an FSM in our experiments. A state encoding algorithm, based on hypercube embedding, is proposed to find encodings of states such that the sum of bit toggles between each pair of states times the encoding affinity between them is minimized. The proposed approach does not require any change in the functional specification of the state machine and can be easily incorporated in present design flow. Results over a wide range of MCNC benchmark examples which show the efficacy of our technique are presented. A simple function for λ is provided, and it is shown to be robust in finding low-power state encodings.

Sign in / Sign up

Export Citation Format

Share Document