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”

Parallel Multi-Objective Evolutionary Design of Approximate Circuits

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="http://www.fit.vutbr.cz/research/pubs/all.php?id=10815" target="_blank" >http://www.fit.vutbr.cz/research/pubs/all.php?id=10815</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Parallel Multi-Objective Evolutionary Design of Approximate Circuits

  • Original language description

    Evolutionary design of digital circuits has been well established in recent years. Besides correct functionality, the demands placed on current circuits include the area of the circuit and its power consumption. By relaxing the functionality requirement, one can obtain more efficient circuits in terms of the area or power consumption at the cost of an error introduced to the output of the circuit. As a result, a variety of trade-offs between error and efficiency can be found. In this paper, a multiobjective evolutionary algorithm for the design of approximate digital circuits is proposed. The scalability of the evolutionary design has been recently improved using parallel implementation of the fitness function and by employing spatially structured evolutionary algorithms. The proposed multiobjective approach uses Cartesian Genetic Programming for the circuit representation and a modified NSGA-II algorithm. Multiple isolated islands are evolving in parallel and the populations are periodically merged and new populations are distributed across the islands. The method is evaluated in the task of approximate arithmetical circuits design.

  • 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/GA14-04197S" target="_blank" >GA14-04197S: Advanced Methods for Evolutionary Design of Complex Digital Circuits</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

    GECCO '15 Proceedings of the 2015 conference on Genetic and evolutionary computation

  • ISBN

    978-1-4503-3472-3

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    687-694

  • 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

    000358795700087