2008
DOI: 10.1016/j.vlsi.2007.02.002
|View full text |Cite
|
Sign up to set email alerts
|

Low-power state encoding for partitioned FSMs with mixed synchronous/asynchronous state memory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
6
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 6 publications
0
6
0
Order By: Relevance
“…Gated clock has been employed normally to selectively stop the clock in portions of circuits where active computation is not being performed [12]. In [12], the Finite State Machine (FSM) is partitioned into several sub-FSMs and these sub-FSMs are clocked when necessary.…”
Section: Low Power Clocking Schemementioning
confidence: 99%
See 2 more Smart Citations
“…Gated clock has been employed normally to selectively stop the clock in portions of circuits where active computation is not being performed [12]. In [12], the Finite State Machine (FSM) is partitioned into several sub-FSMs and these sub-FSMs are clocked when necessary.…”
Section: Low Power Clocking Schemementioning
confidence: 99%
“…In [12], the Finite State Machine (FSM) is partitioned into several sub-FSMs and these sub-FSMs are clocked when necessary. In this paper, an AMBA-based low power clocking scheme is devised for the interface to reduce the switching activity in the AMBA interface and the connecting DSP IP Cores.…”
Section: Low Power Clocking Schemementioning
confidence: 99%
See 1 more Smart Citation
“…RELATED WORK Different algorithms have been proposed to select the states of each sub-FSM, such as genetic algorithm [13] and KernighanLin algorithm [14]. All depart of original STG added with probabilistic information, as transition probability and state probability [13]. We can classify two types of target architecture: power-gated [15] and gated-clock [4].…”
Section: Introductionmentioning
confidence: 99%
“…For each state transition of STG, find the probabilities of transition and of state using the algorithm in [13]. Generate the STG*.…”
mentioning
confidence: 99%