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”

Evolutionary approximation of complex digital circuits

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F15%3APU116958" target="_blank" >RIV/00216305:26230/15:PU116958 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1145/2739482.2764657" target="_blank" >http://dx.doi.org/10.1145/2739482.2764657</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/2739482.2764657" target="_blank" >10.1145/2739482.2764657</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Evolutionary approximation of complex digital circuits

  • Original language description

    Circuit approximation has been developed in recent years as a viable method for constructing energy efficient electronic systems. An open problem is how to effectively obtain approximate circuits showing good compromises between key circuit parameters - the error, power consumption, area and delay.  The use of evolutionary algorithms in the task of circuit approximation has led to promising results; however, only relative simple circuit instances have been tackled because of the scalability problems of the evolutionary design method. We propose to replace the most time consuming part of the evolutionary design algorithm, i.e. the fitness calculation exponentially depending on the number of circuit inputs, by an equivalence checking algorithm operating over Binary Decision Diagrams (BDDs). Approximate circuits are evolved using Cartesian genetic programming which calls a  BDD solver to calculate the fitness value of candidate circuits. The method enables to obtain approximate circuits consisting of tens of inputs and hundreds of gates and showing desired trade-off between key circuit parameters.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2015

  • 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

    Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference

  • ISBN

    978-1-4503-3488-4

  • ISSN

  • e-ISSN

  • Number of pages

    2

  • Pages from-to

    1505-1506

  • Publisher name

    Association for Computing Machinery

  • Place of publication

    New York

  • Event location

    Madrid

  • Event date

    Jul 11, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article