Sciweavers

ISCAS
2002
IEEE

Switching activity estimation of finite state machines for low power synthesis

14 years 5 months ago
Switching activity estimation of finite state machines for low power synthesis
A technique for computing the switching activity of synchronous Finite State Machine (FSM) implementations including the influence of temporal correlation among the next state signals is described. The approach is based upon the computation that a FSM is in a given state which, in turn, is used to compute the conditional probability that a next state bit changes given its present state value. All computations are performed using Decision Diagram (DD) data structures. As an application of this method, the next state activity information is utilized for low power optimization in the synthesis of Binary Decision Diagram (BDD) mapped circuits. Experimental results are presented based on a set of the ISCAS89 sequential benchmarks showing an average power reduction of 40 percent and up to 90 percent reduction for individual benchmarks on the estimated power dissipation.
Mikael Kerttu, Per Lindgren, Mitchell A. Thornton,
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Where ISCAS
Authors Mikael Kerttu, Per Lindgren, Mitchell A. Thornton, Rolf Drechsler
Comments (0)