On logic synthesis of conventionally hard to synthesize circuits using genetic programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.7954
- @InProceedings{Fiser:2010:DDECS,
-
author = "Petr Fiser and Jan Schmidt and Zdenek Vasicek and
Lukas Sekanina",
-
title = "On logic synthesis of conventionally hard to
synthesize circuits using genetic programming",
-
booktitle = "13th IEEE International Symposium on Design and
Diagnostics of Electronic Circuits and Systems (DDECS),
2010",
-
year = "2010",
-
month = apr,
-
pages = "346--351",
-
abstract = "Recently, it has been shown that synthesis of some
circuits is quite difficult for conventional methods.
In this paper we present a method of minimisation of
multi-level logic networks which can solve these
difficult circuit instances. The synthesis problem is
transformed on the search problem. A search algorithm
called Cartesian genetic programming (CGP) is applied
to synthesise various difficult circuits. Conventional
circuit synthesis usually fails for these difficult
circuits; specific synthesis processes must be employed
to obtain satisfactory results. We have found that CGP
is able to implicitly discover new efficient circuit
structures. Thus, it is able to optimise circuits
universally, regardless their structure. The circuit
optimization by CGP has been found especially efficient
when applied to circuits already optimized by a
conventional synthesis. The total runtime is reduced,
while the result quality is improved further more.",
-
keywords = "genetic algorithms, genetic programming, Cartesian
genetic programming, circuit optimisation, circuit
synthesis, logic synthesis, multilevel logic networks,
search algorithm, specific synthesis processes, logic
design, search problems",
-
DOI = "doi:10.1109/DDECS.2010.5491755",
-
notes = "Also known as \cite{5491755}",
- }
Genetic Programming entries for
Petr Fiser
Jan Schmidt
Zdenek Vasicek
Lukas Sekanina
Citations