Proceedings of the 35th Annual Conference on Design Automation Conference - DAC '98 1998
DOI: 10.1145/277044.277235
|View full text |Cite
|
Sign up to set email alerts
|

Finite state machine decomposition for low power

Abstract: Clock-gating techniques have been shown to be very effective in the reduction of the switching activity in sequential logic circuits. In this paper we describe a new clock-gating technique based on finite state machine (FSM) decomposition. We 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, we search for a small cluster of states with high stati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2000
2000
2013
2013

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 68 publications
(24 citation statements)
references
References 17 publications
0
24
0
Order By: Relevance
“…For state partitioning, we use Kernighan-Lin algorithm to find a small cluster of states composing the first sub-FSM and all other states composing the second one [9]. The cost function is based on transition probability and the smaller sub-FSM should has high probability of state transitions inside itself, and low probability of crossing transitions to the other sub-FSM.…”
Section: Resultsmentioning
confidence: 99%
“…For state partitioning, we use Kernighan-Lin algorithm to find a small cluster of states composing the first sub-FSM and all other states composing the second one [9]. The cost function is based on transition probability and the smaller sub-FSM should has high probability of state transitions inside itself, and low probability of crossing transitions to the other sub-FSM.…”
Section: Resultsmentioning
confidence: 99%
“…Decomposition of finite state machines for low power has been proposed in [21]. The basic idea is to decompose the STG of a finite state machine (FSM) into two STGs that jointly produce the equivalent input-output behavior as the original machine.…”
Section: State Machine Decompositionmentioning
confidence: 99%
“…Other techniques for reducing switching activities, including loop folding [8] and finite state machine decomposition [14], have also been studied. In addition, the effect of high-level compiler optimizations on system power has been investigated [7].…”
Section: Preliminariesmentioning
confidence: 99%