By Topic

Low power state assignment and flipflop selection for finite state machine synthesis - a genetic algorithmic approach

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

1 Author(s)
Chattopadhyay, S. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Guwahati, India

Current renewed emphasis for more aggressive logic designs with lesser area, delay, and power, demands exploration of alternative avenues that could lead to better designs, albeit at the higher cost of computation. The author explores the avenue of genetic algorithms for a holistic view for synthesis of finite state machines (FSM) targeting power reduction by incorporating both state assignment and sequential element selection. Exhaustive experimentation performed on a large suite of benchmarks has established the fact that this tool results in state encodings with on average 46.08% reduction in power requirement over NOVA, without any significant increase in the number of product terms. The effectiveness of judicious flipflop, selection has been demonstrated by showing that the approach with all D-flipflops as the sequential element requires 33.78% more power than the approach with a choice of D and T flipflop types. Moreover, as compared to the technique presented in LPSA, the algorithm presented requires 38.96% less power when using a mix of D and T flipflops. The quality of the solution obtained and the high rate of convergence have established the effectiveness of the genetic algorithm in solving this particular NP-complete problem. Further, the inherent parallelism of genetic algorithms makes the proposed scheme ideal for solving the problem in a multiprocessor environment

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:148 ,  Issue: 45 )