Advanced techniques for the creation and propagation of modules in cartesian genetic programming

The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, which encodes an array of logic gates into a chromosome. While several smaller circuits have been successfully evolved on this model, it lacks scalability. A recent approach towards scalable hardware evolution is based on the automated creation of modules from primitive gates. In this paper, we present two novel approaches for module creation, an age-based and a cone-based technique. Further, we detail a cone-based crossover operator for use with cartesian genetic programming. We evaluate the different techniques and compare them with related work. The results show that age-based module creation is highly effective, while cone-based approaches are only beneficial for regularly structured, multiple output functions such as multipliers. Categories and Subject Descriptors I.2.2 [Artificial Intelligence]: Automa...

• Type: Conference
• Year: 2008
• Where: GECCO
• Authors: Paul Kaufmann, Marco Platzner
• Keywords: Cartesian Genetic Programming, Crossover Operator, GECCO 2008, Module Creation, Optimization