Automatic Code Generation on a MOVE Processor Using Cartesian Genetic Programming

Research output: Contribution to journalArticlepeer-review


This paper presents for the first time the application of Cartesian Genetic Programming to the evolution of machine code for a simple implementation of a MOVE processor. The effectiveness of the algorithm is demonstrated by evolving machine code for a 4-bit multiplier with three different levels of parallelism. The results show that 100% successful solutions were found by COP and by further optimising the size of the solutions, it is possible to find efficient implementations of the 4-bit multiplier that have the potential to be "human competitive". Further analysis of the results revealed that the structure of some solutions followed a known general design methodology.

Original languageEnglish
Pages (from-to)238-249
Number of pages12
Journal9th International Conference on Evolvable Systems
Publication statusPublished - Sept 2010

Cite this