Decompositions of Finite State Machines for Low Power: State Assignment for Submachines

• Main Authors: Chow, Sue-Hong, 周書弘
• Other Authors: Hwang, Ting-Ting
• Format: Others
• Language: en_US
• Published: 1996
• Online Access: http://ndltd.ncl.edu.tw/handle/15981544297163868471

碩士 === 國立清華大學 === 資訊科學研究所 === 84 === 　　In this thesis, we present a new approach to the synthesis problem for Finite State Machines with reduction of power dissipation as a design objective. A Finite State Machine is decomposed into a number of coupled submachines. Most of the time, Only one of the submachnes will be activated which, consequently, could lead to substantial savings in power consumption. The two key steps in this approach are: (1) decomposition of a Finite State Machine into submachines so that there is a high probability that state transitions will be confined to the smaller of the submachines most of the time, and (2) synthesis of the coupled submachines to optimize the logic circuits. Currently available state assignment tool considers only encoding of single Finite State Machine. A straightforward adoption of those encoding tools will result in unsatisfactory result. Therefore, in this thesis, we also address the problem of synthesizing coupled submachines so that the total area of submachines is minimized. Experimental results confirmed that our approach produced very good results.