Cart (Loading....) | Create Account
Close category search window
 

State assignment for low-power FSM synthesis using genetic local search

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
$31 $13
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

2 Author(s)
Olson, E. ; Beckman Inst. for Adv. Sci. & Technol., Illinois Univ., Urbana, IL, USA ; Kang, S.M.

The power consumption of a finite state machine can be reduced if fewer internal nodes change states during operation. We assign the symbolic states representation so that the most probable state machine transitions change fewer state bits. We calculate the state transition probabilities from the given input signal probabilities and the Markov chain state probabilities (estimated from probability simulation). We reduce the Hamming distances between the binary representations of frequently transitioning pairs of states. Using a genetic local search algorithm, we can quickly find near optimal state assignments for finite state machines with less than fifty states and good assignments for larger benchmarks. The average power consumption is estimated using a sequential transition density simulator on gate-mapped representation of the design. The gate's switching density is measured for each edge in the state transition graph and then scaled using the state transition density. Results using the MCNC benchmarks show that low-power state assignment produces encodings that consume about 20% less power than current “area optimizing” state encoding programs. When these encodings are synthesized into multilevel gate representations using SIS, we find that the area is also reduced

Published in:

Custom Integrated Circuits Conference, 1994., Proceedings of the IEEE 1994

Date of Conference:

1-4 May 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.