Cartesian Genetic Programming as Local Optimizer of Logic Networks

conference paper

English

Logic synthesis and optimization methods work either globally on the whole logic network or locally on preselected subnetworks. Evolutionary design methods have already been applied to evolve and optimize logic circuits at the global level. In this paper, we propose a new method based on Cartesian genetic programming (CGP) as a local area optimizer in combinational logic networks. First, a subcircuit is extracted from a complex circuit, then the subcircuit is optimized by CGP and finally the optimized subcircuit replaces the original one. The procedure is repeated until a termination criterion is satisfied. We present a performance comparison of local and global evolutionary optimization methods with a conventional approach based on ABC and analyze these methods using differently pre-optimized benchmark circuits. If a sufficient time is available, the proposed locally optimizing CGP gives better results than other locally operating methods reported in the literature; however, its performance is significantly worse than the evolutionary global optimization.

logic network, cartesian genetic programming, optimization, digital circuit

SEKANINA, L.; PTÁK, O.; VAŠÍČEK, Z.

2014

5. 7. 2014

IEEE Computational Intelligence Society

Beijing

978-1-4799-1488-3

2014 IEEE Congress on Evolutionary Computation

2901

2908

8

https://www.fit.vut.cz/research/publication/10504/

localres_final.pdf