DocumentCode
2102462
Title
Finite state machine decomposition for low power
Author
Monteiro, José C. ; Oliveria, A.L.
Author_Institution
IST, INESC, Lisbon, Portugal
fYear
1998
fDate
19-19 June 1998
Firstpage
758
Lastpage
763
Abstract
Clock-gating techniques have been shown to be very effective in the reduction of the switching activity in sequential logic circuits. The authors describe a new clock-gating technique based on finite state machine (FSM) decomposition. They compute two sub-FSMs that together have the same functionality as the original FSM. For all the transitions within one sub-FSM, the clock for the other sub-FSM is disabled. To minimize the average switching activity, they search for a small cluster of states with high stationary state probability and use it to create the small sub-FSM. This way one will have a small amount of logic that is active most of the time, during which is disabling a much larger circuit, the other sub-FSM. They provide a set of experimental results that show that power consumption can be substantially reduced, in some cases up to 80%.
Keywords
clocks; finite state machines; sequential circuits; sequential switching; clock-gating techniques; finite state machine decomposition; high stationary state probability; low power; minimized average switching activity; sequential logic circuits; state cluster searching; switching activity reduction; Automata; Clocks; Energy consumption; Frequency; Logic circuits; Permission; Registers; Sequential circuits; Stationary state; Switching circuits;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 1998. Proceedings
Conference_Location
San Francisco, CA, USA
Print_ISBN
0-89791-964-5
Type
conf
Filename
724573
Link To Document