Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
100 IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, VOL. XX, NO. Y, MONTH 1999 Designing Genetic Algorithms for the State
 

Summary: 100 IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, VOL. XX, NO. Y, MONTH 1999
Designing Genetic Algorithms for the State
Assignment Problem
Jos'e Nelson Amaral, Kagan Tumer and Joydeep Ghosh
Abstract--- Finding the best state assignment for imple­
menting a synchronous sequential circuit is important for
reducing silicon area or chip count in many digital designs.
This State Assignment Problem (SAP) belongs to a broader
class of combinatorial optimization problems than the well
studied traveling salesman problem, which can be formu­
lated as a special case of SAP. The search for a good solution
is considerably involved for the SAP due to a large number
of equivalent solutions, and no effective heuristic has been
found so far to cater to all types of circuits.
In this paper, a matrix representation is used as the geno­
type for a Genetic Algorithm (GA) approach to this prob­
lem. A novel selection mechanism is introduced, and suit­
able genetic operators for crossover and mutation, are con­
structed. The properties of each of these elements of the GA
are discussed and an analysis of parameters that influence

  

Source: Amaral, José Nelson - Department of Computing Science, University of Alberta

 

Collections: Computer Technologies and Information Sciences