Evolutionary Design of Complex Approximate Combinational Circuits

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F16%3APU121566" target="_blank" >RIV/00216305:26230/16:PU121566 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/s10710-015-9257-1" target="_blank" >http://dx.doi.org/10.1007/s10710-015-9257-1</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10710-015-9257-1" target="_blank" >10.1007/s10710-015-9257-1</a>

Result language

angličtina

Original language name

Evolutionary Design of Complex Approximate Combinational Circuits

Original language description

Functional approximation is one of the methods allowing designers to approximate circuits at the level of logic behavior. By introducing a suitable functional approximation, power consumption, area or delay of a circuit can be reduced if some errors are acceptable in a particular application. As the error quantification is usually based on an arithmetic error metric in existing approximation methods, these methods are primarily suitable for the approximation of arithmetic and signal processing circuits. This paper deals with the approximation of general logic (such as pattern matching circuits and complex encoders) in which no additional information is usually available to establish a suitable error metric and hence the error of approximation is expressed in terms of Hamming distance between the output values produced by a candidate approximate circuit and the accurate circuit. We propose a circuit approximation method based on Cartesian genetic programming in which gate-level circuits are internally represented using directed acyclic graphs. In order to eliminate the well-known scalability problems of evolutionary circuit design, the error of approximation is determined by binary decision diagrams. The method is analyzed in terms of computational time and quality of approximation. It is able to deliver detailed Pareto fronts showing various compromises between the area, delay and error. Results are presented for 16 circuits (with 27-50 inputs) that are too complex to be approximated by means of existing evolutionary circuit design methods.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

20206 - Computer hardware and architecture

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

2016

Confidentiality

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

Name of the periodical

Genetic Programming and Evolvable Machines

ISSN

1389-2576

e-ISSN

1573-7632

Volume of the periodical

17

Issue of the periodical within the volume

2

Country of publishing house

US - UNITED STATES

Number of pages

24

Pages from-to

169-192

UT code for WoS article

000376876700004

EID of the result in the Scopus database

2-s2.0-84949685438