By Topic

State assignment in finite state machines for minimal switching power consumption

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
S. K. Hong ; Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul ; I. C. Park ; S. H. Hwang ; C. M. Kyung

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, ~45% less than that of NOVA with only a ~3% increase in the number of product terms

Published in:

Electronics Letters  (Volume:30 ,  Issue: 8 )