Genetic algorithm based state assignment for power and area optimisation.

Xia, Yinshui; Almaini, A E A

Abstract

The use of assignment to minimise power dissipation and area for finite-state machines is computationally difficult. Most published results show that the reduction of switching activity often trades with area penalty. Two cost functions are introduced and a genetic algorithm is used. to optimise the cost functions. Experimental results show a significant reduction of switching activity without area penalty or with smaller area penalty than previous publications.

A novel approach is presented utilising genetic algorithms, based on the Darwinian principle of survival of the fittest, to find efficient state assignment that leads to significant saving in power without the usual silicon area penalty or with much reduced area depending on the designer's elicited criteria.

Citation

Xia, Y., & Almaini, A. E. A. (2002). Genetic algorithm based state assignment for power and area optimisation. IEE proceedings. Computers and digital techniques, 149, 128-133. https://doi.org/10.1049/ip-cdt%3A20020431

• Journal Article Type: Article
• Publication Date: 2002-07
• Deposit Date: Oct 19, 2007
• Print ISSN: 1350-2387
• Publisher: Institution of Engineering and Technology (IET)
• Peer Reviewed: Peer Reviewed
• Volume: 149
• Pages: 128-133
• DOI: https://doi.org/10.1049/ip-cdt%3A20020431
• Keywords: power saving; genetic algorithms; state assignment; silicon area; computer programming; electronic engineering
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/13
• Publisher URL: http://dx.doi.org/10.1049/ip-cdt:20020431