Low Power Synthesis of Finite State Machines-State Assignment Decomposition Algorithm

Abstract

A new method for reducing power consumption in finite state machines (FSMs) is proposed. Probabilistic description of the FSMs is the theoretical background of power-oriented state assignment. The algorithm of state assignment is based on a decomposition strategy of coding. This idea uses a binary tree in which nodes are created by sharing a finite state machine. The algorithm has been applied to the LGSynth91 benchmark and has also been compared to other approaches. The experiments showed that the proposed method leads to a reduction in power consumption compared to the state encoding algorithms that have already been developed. Reduction of the circuits' area is also observed.