2002 23rd International Conference on Microelectronics. Proceedings (Cat. No.02TH8595) 2002
DOI: 10.1109/miel.2002.1003330
|View full text |Cite
|
Sign up to set email alerts
|

FSM non-minimal state encoding for low power

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2005
2005
2009
2009

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 6 publications
0
7
0
Order By: Relevance
“…A couple of recent papers on nonminimal length encoding algorithms show that power may be improved with code length longer than the lower bound [19], [24]. These methods require extra state register(s) in Weighted STG of the original FSM in Fig.…”
Section: B State Encoding For Low Powermentioning
confidence: 99%
See 1 more Smart Citation
“…A couple of recent papers on nonminimal length encoding algorithms show that power may be improved with code length longer than the lower bound [19], [24]. These methods require extra state register(s) in Weighted STG of the original FSM in Fig.…”
Section: B State Encoding For Low Powermentioning
confidence: 99%
“…This problem is known to be NP-hard and many heuristic algorithms have been proposed. Such techniques include state encoding with minimal code length [3], [26], [30], nonminimal code length [19], [24] and variable code length [28], state re-encoding approaches [8], [31], and simultaneous power and area optimization encoding [17], [25].…”
Section: Introductionmentioning
confidence: 99%
“…There are a couple of recent work on non-minimal length encoding algorithms showing that power may be improved with code length longer than this bound [3,4]. These methods require extra state register(s) in the FSM implementation which will add to the hardware cost and cause area increase.…”
Section: Related Workmentioning
confidence: 99%
“…This problem is NP-hard and many heuristic algorithms have been proposed mainly based on the idea of assigning codes with small Hamming distance to pairs of states that have a high transition probability. Such techniques include state encoding with minimal code length [1,6,8] and non-minimal code length [3,4]; state re-encoding approaches [2,9]; and techniques that try to minimize power and area simultaneously [5].…”
Section: Introductionmentioning
confidence: 99%
“…This problem is NP-hard and many heuristic algorithms have been proposed mainly based on the idea of assigning codes with small Hamming distance to pairs of states that have a high transition probability. Such techniques include state encoding with minimal code length [1,6,8] and non-minimal code length [3,4]; state re-encoding approaches [2,9]; and techniques that try to minimize power and area simultaneously [5].…”
Section: Introductionmentioning
confidence: 99%