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

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 270
  • Download : 0
A state assignment algorithm for minimal switching power consumption is proposed. It minimises the switching activity caused by state transitions 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 approximately 3% increase in the number of product terms.
Publisher
IEE-INST ELEC ENG
Issue Date
1994-04
Language
English
Article Type
Article
Citation

ELECTRONICS LETTERS, v.30, no.8, pp.627 - 629

ISSN
0013-5194
URI
http://hdl.handle.net/10203/62502
Appears in Collection
EE-Journal Papers(저널논문)RIMS Journal Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0