All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F10%3A00167768" target="_blank" >RIV/68407700:21240/10:00167768 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/DDECS.2010.5491755" target="_blank" >http://dx.doi.org/10.1109/DDECS.2010.5491755</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/DDECS.2010.5491755" target="_blank" >10.1109/DDECS.2010.5491755</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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 CGPhas 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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA102%2F09%2F1668" target="_blank" >GA102/09/1668: SoC circuits reliability and availability improvement</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2010

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proc. of the 13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems

  • ISBN

    978-1-4244-6613-9

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    346-351

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Vienna

  • Event date

    Apr 14, 2010

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article