Prof. Ing. Lukáš Sekanina, Ph.D.

VAŠÍČEK Zdeněk and SEKANINA Lukáš. Evolutionary Design of Complex Approximate Combinational Circuits. Genetic Programming and Evolvable Machines. Berlin: Springer Verlag, 2016, vol. 17, no. 2, pp. 169-192. ISSN 1389-2576. Available from: http://dx.doi.org/10.1007/s10710-015-9257-1
Publication language:english
Original title:Evolutionary Design of Complex Approximate Combinational Circuits
Title (cs):Evoluční návrh složitých aproximovaných kombinačních obvodů
Pages:169-192
Place:DE
Year:2016
URL:http://dx.doi.org/10.1007/s10710-015-9257-1
Journal:Genetic Programming and Evolvable Machines, Vol. 17, No. 2, Berlin, DE
ISSN:1389-2576
Files: 
++Type Name Title Size Last modified
icongenp16.pdf954 KB2016-08-28 22:57:40
^ Select all
With selected:
Keywords
Approximate circuit, Cartesian genetic programming, Binary decision diagram, Fitness function
Annotation
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.
BibTeX:
@ARTICLE{
   author = {Zden{\v{e}}k Va{\v{s}}{\'{i}}{\v{c}}ek and Luk{\'{a}}{\v{s}}
	Sekanina},
   title = {Evolutionary Design of Complex Approximate Combinational
	Circuits},
   pages = {169--192},
   journal = {Genetic Programming and Evolvable Machines},
   volume = {17},
   number = {2},
   year = {2016},
   ISSN = {1389-2576},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=10916}
}

Your IPv4 address: 54.147.40.153
Switch to IPv6 connection

DNSSEC [dnssec]