Evolutionary approximation of complex digital circuits

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

Evolutionary approximation of complex digital circuits

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Evolutionary approximation of complex digital circuits

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

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

Rok uplatnění

2015

Kód důvěrnosti údajů

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

Název statě ve sborníku

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

ISBN

978-1-4503-3488-4

ISSN

—

e-ISSN

—

Počet stran výsledku

2

Strana od-do

1505-1506

Název nakladatele

Association for Computing Machinery

Místo vydání

New York

Místo konání akce

Madrid

Datum konání akce

11. 7. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—