Detail výsledku
Circuit Approximation Using Single- and Multi-Objective Cartesian GP
In this paper, the approximate circuit design problem is formulated as a multi-objective optimization problem in which the accuracy and power consumption are conflicting design objectives. We compare multi-objective and single-objective Cartesian genetic programming in the task of parallel adder and multiplier approximation. It is analyzed how the setting of the methods, formulating the problem as multi-objective or single-objective, and constraining the execution time can influence the quality of results. One of the conclusions is that the multi-objective approach is useful if the number of allowed evaluations is low. When more time is available, the single-objective approach becomes more efficient.
approximate circuit, Cartesian genetic programming, design method, multiobjective optimization
@inproceedings{BUT119796,
author="Zdeněk {Vašíček} and Lukáš {Sekanina}",
title="Circuit Approximation Using Single- and Multi-Objective Cartesian GP",
booktitle="Genetic Programming",
year="2015",
series="Lecture Notes in Computer Science",
volume="9025",
pages="217--229",
publisher="Springer International Publishing",
address="Berlin",
doi="10.1007/978-3-319-16501-1\{_}18",
isbn="978-3-319-16500-4",
url="https://www.fit.vut.cz/research/publication/10763/"
}