Gate-level Synthesis of Boolean Functions using Information Theory Concepts

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Arturo Hern?ndez Aguirre Articles by Carlos Coello Coello

Fourth Mexican International Conference on Computer Science

Tlaxcala, Mexico

September 08-September 12

ISBN: 0-7695-1915-6

	ASCII Text	x
	Arturo Hern?ndez Aguirre, Carlos Coello Coello, "Gate-level Synthesis of Boolean Functions using Information Theory Concepts," Mexican International Conference on Computer Science, pp. 268, Fourth Mexican International Conference on Computer Science, 2003.

	BibTex	x
	@article{ 10.1109/ENC.2003.1232904, author = {Arturo Hern?ndez Aguirre and Carlos Coello Coello}, title = {Gate-level Synthesis of Boolean Functions using Information Theory Concepts}, journal ={Mexican International Conference on Computer Science}, volume = {0}, year = {2003}, isbn = {0-7695-1915-6}, pages = {268}, doi = {http://doi.ieeecomputersociety.org/10.1109/ENC.2003.1232904}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Mexican International Conference on Computer Science TI - Gate-level Synthesis of Boolean Functions using Information Theory Concepts SN - 0-7695-1915-6 SP EP A1 - Arturo Hern?ndez Aguirre, A1 - Carlos Coello Coello, PY - 2003 KW - null VL - 0 JA - Mexican International Conference on Computer Science ER -

Arturo Hern?ndez Aguirre, Mineral de Valenciana, Guanajuato

Carlos Coello Coello, CINVESTAV-IPN Computer Science Section

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ENC.2003.1232904

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.