STATE ASSIGNMENT IN FINITE-STATE MACHINES FOR MINIMAL SWITCHING POWER-CONSUMPTION

Authors
HONG SK PARK IC HWANG SH KYUNG CM
Citation
Sk. Hong et al., STATE ASSIGNMENT IN FINITE-STATE MACHINES FOR MINIMAL SWITCHING POWER-CONSUMPTION, Electronics Letters, 30(8), 1994, pp. 627-629
Citations number
6
Categorie Soggetti
Engineering, Eletrical & Electronic
Journal title
Electronics Letters → ACNP
ISSN journal
00135194
Volume
30
Issue
8
Year of publication
1994
Pages
627 - 629
Database
ISI
SICI code
0013-5194(1994)30:8<627:SAIFMF>2.0.ZU;2-V
Abstract
A state assignment algorithm for minimal switching power consumption i s proposed. It minimises the switching activity caused by state transi tions by assigning codes closer in Hamming distance to the states with higher state transition probabilities. Experimental results show that the switching activity obtained by the proposed algorithm is, on the average, approximately 45%. less than that of NOVA [1] with only a app roximately 3% increase in the number of product terms.