Adaptive verifiability-driven strategy for evolutionary approximation of arithmetic circuits

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F20%3APU138660" target="_blank" >RIV/00216305:26230/20:PU138660 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.fit.vut.cz/research/publication/12312/" target="_blank" >https://www.fit.vut.cz/research/publication/12312/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.asoc.2020.106466" target="_blank" >10.1016/j.asoc.2020.106466</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Adaptive verifiability-driven strategy for evolutionary approximation of arithmetic circuits

Popis výsledku v původním jazyce

We present a novel approach for designing complex approximate arithmetic circuits that trade correctness for power consumption and play important role in many energy-aware applications. Our approach integrates in a unique way formal methods providing formal guarantees on the approximation error into an evolutionary circuit optimisation algorithm. The key idea is to employ a novel adaptive search strategy that drives the evolution towards promptly verifiable approximate circuits. As demonstrated in an extensive evaluation including several structurally different arithmetic circuits and target precisions, the search strategy provides superior scalability and versatility with respect to various approximation scenarios. Our approach significantly improves capabilities of the existing methods and paves a way towards an automated design process of provably-correct circuit approximations.

Název v anglickém jazyce

Adaptive verifiability-driven strategy for evolutionary approximation of arithmetic circuits

Popis výsledku anglicky

We present a novel approach for designing complex approximate arithmetic circuits that trade correctness for power consumption and play important role in many energy-aware applications. Our approach integrates in a unique way formal methods providing formal guarantees on the approximation error into an evolutionary circuit optimisation algorithm. The key idea is to employ a novel adaptive search strategy that drives the evolution towards promptly verifiable approximate circuits. As demonstrated in an extensive evaluation including several structurally different arithmetic circuits and target precisions, the search strategy provides superior scalability and versatility with respect to various approximation scenarios. Our approach significantly improves capabilities of the existing methods and paves a way towards an automated design process of provably-correct circuit approximations.

Druh

J_imp - Článek v periodiku v databázi Web of Science

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/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>

Návaznosti

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

Rok uplatnění

2020

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 periodika

APPLIED SOFT COMPUTING

ISSN

1568-4946

e-ISSN

1872-9681

Svazek periodika

95

Číslo periodika v rámci svazku

106466

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

17

Strana od-do

1-17

Kód UT WoS článku

000576773900009

EID výsledku v databázi Scopus

2-s2.0-85086825652