Publication detail

An Efficient Selection Strategy for Digital Circuit Evolution

GAJDA, Z. SEKANINA, L.

Original Title

An Efficient Selection Strategy for Digital Circuit Evolution

English Title

An Efficient Selection Strategy for Digital Circuit Evolution

Type

conference paper

Language

en

Original Abstract

In this paper, we propose a new modification of Cartesian Genetic Programming (CGP) that enables to optimize digital circuits more significantly than standard CGP. We argue that considering fully functional but not necessarily smallest-discovered individual as the parent for new population can decrease the number of harmful mutations and so improve the search space exploration. This phenomenon was confirmed on common benchmarks such as combinational multipliers and the LGSynth91 circuits.

English abstract

In this paper, we propose a new modification of Cartesian Genetic Programming (CGP) that enables to optimize digital circuits more significantly than standard CGP. We argue that considering fully functional but not necessarily smallest-discovered individual as the parent for new population can decrease the number of harmful mutations and so improve the search space exploration. This phenomenon was confirmed on common benchmarks such as combinational multipliers and the LGSynth91 circuits.

Keywords

digital circuit, cartesian genetic programming, circuit design, evolutionary computation, selection operator

RIV year

2010

Released

08.09.2010

Publisher

Springer Verlag

Location

Berlin

ISBN

978-3-642-15322-8

Book

Evolvable Systems: From Biology to Hardware

Edition

Lecture Notes in Computer Science

Edition number

NEUVEDEN

Pages from

13

Pages to

24

Pages count

12

URL

BibTex


@inproceedings{BUT35729,
  author="Zbyšek {Gajda} and Lukáš {Sekanina}",
  title="An Efficient Selection Strategy for Digital Circuit Evolution",
  annote="In this paper, we propose a new modification of Cartesian Genetic Programming
(CGP) that enables to optimize digital circuits more significantly than standard
CGP. We argue that considering fully functional but not necessarily
smallest-discovered individual as the parent for new population can decrease the
number of harmful mutations and so improve the search space exploration. This
phenomenon was confirmed on common benchmarks such as combinational multipliers
and the LGSynth91 circuits.",
  address="Springer Verlag",
  booktitle="Evolvable Systems: From Biology to Hardware",
  chapter="35729",
  edition="Lecture Notes in Computer Science",
  howpublished="print",
  institution="Springer Verlag",
  year="2010",
  month="september",
  pages="13--24",
  publisher="Springer Verlag",
  type="conference paper"
}