loading...
Gate-level Synthesis of Boolean Functions using Information Theory Concepts
Tlaxcala, Mexico September 08-September 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ENC.2003.1232904Fourth Mexican International Conferen ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Arturo Hern?ndez Aguirre, Mineral de Valenciana, Guanajuato
Carlos Coello Coello, CINVESTAV-IPN Computer Science Section
In this paper we apply information theory concepts to evolutionary Boolean circuit synthesis. We discuss the schema destruction problem when simple conditional entropy is used as fitness function. The design problem is the synthesis of Boolean functions by using the minimum number of binary multiplexers. We show that the fitness landscape of normalized mutual information exhibits better characteristics for evolutionary search than the landscape of simple mutual information. A comparison of minimum evolved circuits shows the potential of information theory concepts.
Citation:
Arturo Hern?ndez Aguirre, Carlos Coello Coello, "Gate-level Synthesis of Boolean Functions using Information Theory Concepts," enc, pp.268, Fourth Mexican International Conference on Computer Science, 2003
Usage of this product signifies your acceptance of the Terms of Use.