Instruction-based development: From evolution to generic structures of digital circuits

Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex solution) represents a significant obstacle for the evolution of complex extensive systems. The computational development represents one of the approaches in the evolutionary design techniques that tries to overcome the problem of scale. In this paper an instruction-based developmental method is presented for the evolutionary design of generic structures of digital circuits. The developmental system involves a set of application-specific instructions constituting programs in order to solve a given task. In particular, the goal is to construct generic structures of combinational circuits. An evolutionary algorithm is utilized for the design of these programs that represent a mapping from the genotypes to the phenotypes during the evolutionary process, i.e. the prescription for the construction of target circuits. Two case-studies are presented in order to demonstrate the successfulness of this approach: (1) the evolutionary design of generic combinational multipliers and (2) the evolutionary design of generic sorting networks.

[1]  Sung-Soon Choi,et al.  A hybrid genetic search for the sorting network problem with evolving parallel layers , 2001 .

[2]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[3]  Adrian Thompson,et al.  Silicon evolution , 1996 .

[4]  Hiroaki Kitano,et al.  Designing Neural Networks Using Genetic Algorithms with Graph Generation System , 1990, Complex Syst..

[5]  Byung Ro Moon,et al.  More Effective Genetic Search For The Sorting Network Problem , 2002, GECCO.

[6]  Lukás Sekanina,et al.  Evolutionary Design of Arbitrarily Large Sorting Networks Using Development , 2005, Genetic Programming and Evolvable Machines.

[7]  Hugues Juillé.  Evolution of Non-Deterministic Incremental Algorithms as a New Approach for Search in State Spaces , 1995, ICGA.

[8]  John F. Wakerly,et al.  Digital design - principles and practices , 1990, Prentice Hall Series in computer engineering.

[9]  Sanjeev Kumar,et al.  Investigating computational models of development for the construction of shape and form , 2004 .

[10]  P. Nordin.  Genetic Programming III - Darwinian Invention and Problem Solving , 1999 .

[11]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[12]  Gregory S. Hornby,et al.  The advantages of generative grammatical encodings for physical design , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[13]  Lukás Sekanina,et al.  Easily testable image operators: the class of circuits where evolution beats engineers , 2003, NASA/DoD Conference on Evolvable Hardware, 2003. Proceedings..

[14]  Gunnar Tufte,et al.  Extending Artificial Development: Exploiting Environmental Information for the Achievement of Phenotypic Plasticity , 2007, ICES.

[15]  Julian Francis Miller,et al.  A Developmental Method for Growing Graphs and Circuits , 2003, ICES.

[16]  Peter J. Bentley,et al.  Towards development in evolvable hardware , 2002, Proceedings 2002 NASA/DoD Conference on Evolvable Hardware.

[17]  John R. Koza,et al.  Genetic Programming III: Darwinian Invention & Problem Solving , 1999 .

[18]  Michal Bidlo.  Evolutionary Design of Generic Combinational Multipliers Using Development , 2007, ICES.

[19]  W. Daniel Hillis,et al.  Co-evolving parasites improve simulated evolution as an optimization procedure , 1990 .

[20]  W. Wergin.  Essential cell biology (2nd edition). By Bruce Alberts, Dennis Bray, Karen Hopkin, Alexander Johnson, Julian Lewis, Martin Raff, Keith Roberts, Peter Walter. Garland Science/Taylor and Francis Group, New York and London (2003). ISBN 0-8153-3480-X; hardback; 740 pages illustrated; $105.00 , 2006 .

[21]  Byung Ro Moon,et al.  Isomorphism, Normalization, And A Genetic Algorithm For Sorting Network Optimization , 2002, GECCO.