How to Evolve Complex Combinational Circuits From Scratch?

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU112025" target="_blank" >RIV/00216305:26230/14:PU112025 - isvavai.cz</a>

Result on the web

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

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ICES.2014.7008732" target="_blank" >10.1109/ICES.2014.7008732</a>

Result language

angličtina

Original language name

How to Evolve Complex Combinational Circuits From Scratch?

Original language description

One of the serious criticisms of the evolutionary circuit design method is that it is not suitable for the design of complex large circuits. This problem is especially visible in the evolutionary design of combinational circuits, such as arithmetic circuits, in which a perfect response is requested for every possible combination of inputs. This paper deals with a new method which enables us to evolve complex circuits from a randomly seeded initial population and without providing any information about the circuit structure to the evolutionary algorithm. The proposed solution is based on an advanced approach to the evaluation of candidate circuits. Every candidate circuit is transformed to a corresponding binary decision diagram (BDD) and its functional similarity is determined against the specification given as another BDD. The fitness value is the Hamming distance between the output vectors of functions represented by the two BDDs. It is shown in the paper that the BDD-based evaluation procedure can be performed much faster than evaluating all possible assignments to the inputs. It also significantly increases the success rate of the evolutionary design process. The method is evaluated using selected benchmark circuits from the LGSynth91 set. For example, a correct implementation was evolved for a 28-input frg1 circuit. The evolved circuit contains less gates (a 57% reduction was obtained) than the result of a conventional optimization conducted by ABC. 

Czech name

—

Czech description

—

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)

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)

Publication year

2014

Confidentiality

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

Article name in the collection

2014 IEEE International Conference on Evolvable Systems Proceedings

ISBN

978-1-4799-4480-4

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

133-140

Publisher name

Institute of Electrical and Electronics Engineers

Place of publication

Piscataway

Event location

Orlando

Event date

Dec 9, 2014

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—