Towards a Scalable EA-based Optimization of Digital Circuits

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F19%3APU132057" target="_blank" >RIV/00216305:26230/19:PU132057 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-16670-0_6" target="_blank" >10.1007/978-3-030-16670-0_6</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Towards a Scalable EA-based Optimization of Digital Circuits

Popis výsledku v původním jazyce

Scalability of fitness evaluation was the main bottleneck preventing adopting the evolution in the task of logic circuits synthesis since early nineties. Recently, various formal approaches have been introduced to this field to overcome this issue. This made it possible to optimize complex circuits consisting of hundreds of inputs and thousands of gates. Unfortunately, we are facing to the another problem - scalability of representation. The efficiency of the evolutionary optimization applied at the global level deteriorates with the increasing complexity. In this paper, we propose to apply the concept of local resynthesis. Resynthesis is an iterative process based on extraction of smaller sub-circuits from a complex circuit that are optimized locally and implanted back to the original circuit. When applied appropriately, this approach can mitigate the problem of scalability of representation. Our evaluation on a set of nontrivial real-world benchmark problems shows that the proposed method provides better results compared to global evolutionary optimization. In more than 60% cases, substantially higher number of redundant gates was removed while keeping the computational effort at the same level.

Název v anglickém jazyce

Towards a Scalable EA-based Optimization of Digital Circuits

Popis výsledku anglicky

Scalability of fitness evaluation was the main bottleneck preventing adopting the evolution in the task of logic circuits synthesis since early nineties. Recently, various formal approaches have been introduced to this field to overcome this issue. This made it possible to optimize complex circuits consisting of hundreds of inputs and thousands of gates. Unfortunately, we are facing to the another problem - scalability of representation. The efficiency of the evolutionary optimization applied at the global level deteriorates with the increasing complexity. In this paper, we propose to apply the concept of local resynthesis. Resynthesis is an iterative process based on extraction of smaller sub-circuits from a complex circuit that are optimized locally and implanted back to the original circuit. When applied appropriately, this approach can mitigate the problem of scalability of representation. Our evaluation on a set of nontrivial real-world benchmark problems shows that the proposed method provides better results compared to global evolutionary optimization. In more than 60% cases, substantially higher number of redundant gates was removed while keeping the computational effort at the same level.

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/LTC18053" target="_blank" >LTC18053: Pokročilé metody Nature-Inspired optimalizačních algoritmů a HPC implementace pro řešení reálných aplikací</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

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

Genetic Programming 22nd European Conference, EuroGP 2019

ISBN

978-3-030-16669-4

ISSN

—

e-ISSN

—

Počet stran výsledku

17

Strana od-do

81-97

Název nakladatele

Springer International Publishing

Místo vydání

Cham

Místo konání akce

Leipzig

Datum konání akce

24. 4. 2019

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

WRD - Celosvětová akce

Kód UT WoS článku

—