Detail publikace

On Logic Synthesis of Conventionally Hard to Synthesize Circuits Using Genetic Programming

Originální název

On Logic Synthesis of Conventionally Hard to Synthesize Circuits Using Genetic Programming

Anglický název

On Logic Synthesis of Conventionally Hard to Synthesize Circuits Using Genetic Programming

Jazyk

en

Originální abstrakt

Recently, it has been shown that synthesis of some circuits is quite difficult for conventional methods. In this paper we present a method of minimization 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 synthesize 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 optimize 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.

Anglický abstrakt

Recently, it has been shown that synthesis of some circuits is quite difficult for conventional methods. In this paper we present a method of minimization 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 synthesize 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 optimize 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.

BibTex


@inproceedings{BUT35425,
  author="Petr {Fišer} and Jan {Schmidt} and Zdeněk {Vašíček} and Lukáš {Sekanina}",
  title="On Logic Synthesis of Conventionally Hard to Synthesize Circuits Using Genetic Programming",
  annote="Recently, it has been shown that synthesis of some circuits is quite difficult
for conventional methods. In this paper we present a method of minimization 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 synthesize 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 optimize 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.",
  address="IEEE Computer Society",
  booktitle="Proc. of the 13th Int. IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems",
  chapter="35425",
  edition="NEUVEDEN",
  howpublished="print",
  institution="IEEE Computer Society",
  year="2010",
  month="april",
  pages="346--351",
  publisher="IEEE Computer Society",
  type="conference paper"
}