abstract = "Logic synthesis and optimisation methods work either
globally on the whole logic network or locally on
preselected sub-networks. Evolutionary design methods
have already been applied to evolve and optimise logic
circuits at the global level. In this paper, we propose
a new method based on Cartesian genetic programming
(CGP) as a local area optimiser in combinational logic
networks. First, a subcircuit is extracted from a
complex circuit, then the subcircuit is optimised by
CGP and finally the optimised 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
optimisation methods with a conventional approach based
on ABC and analyse these methods using differently
pre-optimised benchmark circuits. If a sufficient time
is available, the proposed locally optimising CGP gives
better results than other locally operating methods
reported in the literature; however, its performance is
significantly worse than the evolutionary global
optimisation.",
notes = "Brno University of Technology, Faculty of Information
Technology, IT4Innovations Centre of
ExcellenceBozetechova 2, 61266 Brno, Czech
Republic