DocumentCode
1307959
Title
State assignment of finite state machines for low power applications
Author
Wang, S.-J.
Author_Institution
Inst. of Comput. Sci., Nat. Chung-Hsing Univ., Taichung
Volume
32
Issue
25
fYear
1996
fDate
12/5/1996 12:00:00 AM
Firstpage
2323
Lastpage
2324
Abstract
The authors present an algorithm for the state assignment in finite state machines targeted for minimal switching power dissipation. The adjacent states are assigned codes closer in Hamming distance by our algorithm, which modifies the given state transition graph so that it can be embedded in an n-cube. Experimental results show that the switching activity obtained by the proposed method is better than the previous method
Keywords
finite state machines; graph theory; hypercube networks; logic design; minimisation of switching nets; state assignment; Hamming distance; algorithm; codes; finite state machines; low power applications; minimal switching power dissipation; n-cube embedding; state assignment; state transition graph; switching activity;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19961547
Filename
555954
Link To Document