Gate-level Synthesis of Boolean Functions using Information Theory Concepts

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.

[1]  A. Lloris,et al.  Using decision trees for the minimization of multiple-valued functions , 1993 .

[2]  Guy Marchal,et al.  Multimodality image registration by maximization of mutual information , 1997, IEEE Transactions on Medical Imaging.

[3]  Claudio Moraga,et al.  Evolutionary multi-level network synthesis in given design style , 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).

[4]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[5]  Carlos A. Coello Coello,et al.  Design of combinational logic circuits through an evolutionary multiobjective optimization approach , 2002, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[6]  Guy Marchal,et al.  Multi-modality image registration by maximization of mutual information , 1996, Proceedings of the Workshop on Mathematical Methods in Biomedical Image Analysis.

[7]  Claudio Moraga,et al.  Application of design style in evolutionary multi-level networks synthesis , 2000, Proceedings of the 26th Euromicro Conference. EUROMICRO 2000. Informatics: Inventing the Future.

[8]  Carlos A. Coello Coello,et al.  A genetic programming approach to logic function synthesis by means of multiplexers , 1999, Proceedings of the First NASA/DoD Workshop on Evolvable Hardware.

[9]  David E. Goldberg,et al.  From Twomax To The Ising Model: Easy And Hard Symmetrical Problems , 2002, GECCO.

[10]  P. Varshney,et al.  Application of information theory to switching function minimisation , 1990 .

[11]  J. Ross Quinlan,et al.  Learning Efficient Classification Procedures and Their Application to Chess End Games , 1983 .

[12]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[13]  Charles F. Hockett,et al.  A mathematical theory of communication , 1948, MOCO.

[14]  Colin Studholme,et al.  An overlap invariant entropy measure of 3D medical image alignment , 1999, Pattern Recognit..

[15]  Pramod K. Varshney,et al.  Application of information theory to the construction of efficient decision trees , 1982, IEEE Trans. Inf. Theory.

[16]  Claudio Moraga,et al.  Information theory method for flexible network synthesis , 2001, Proceedings 31st IEEE International Symposium on Multiple-Valued Logic.