Xia, Y and Almaini, A E A (2002) Genetic algorithm based state assignment for power and area optimisation. IEE Proceedings - Computers and digital techniques, 149 (4). pp. 128-133. ISSN 1350 2387Full text not available from this repository. (Request a copy)
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.
|Print ISSN:||1350 2387|
|Uncontrolled Keywords:||power saving; genetic algorithms; state assignment; silicon area; computer programming; electronic engineering;|
|University Divisions/Research Centres:||Faculty of Engineering, Computing and Creative Industries > School of Engineering and the Built Environment|
|Dewey Decimal Subjects:||600 Technology > 620 Engineering > 621 Electronic & mechanical engineering|
000 Computer science, information & general works > 000 Computer science, knowledge & systems > 005 Computer programming, programs & data
|Library of Congress Subjects:||T Technology > TK Electrical engineering. Electronics Nuclear engineering|
Q Science > QA Mathematics > QA76 Computer software
|Depositing User:||Users 2 not found.|
|Date Deposited:||19 Oct 2007 14:12|
|Last Modified:||17 Jun 2013 15:45|
Actions (login required)