Automated Search-Based Functional Approximation for Digital Circuits
Created by W.Langdon from
gp-bibliography.bib Revision:1.8120
- @InCollection{Sekanina:2019:AC,
-
author = "Lukas Sekanina and Zdenek Vasicek and Vojtech Mrazek",
-
title = "Automated Search-Based Functional Approximation for
Digital Circuits",
-
booktitle = "Approximate Circuits Methodologies and CAD",
-
publisher = "Springer",
-
year = "2019",
-
editor = "Sherief Reda and Muhammad Shafique",
-
pages = "175--203",
-
keywords = "genetic algorithms, genetic programming",
-
isbn13 = "978-3-319-99321-8",
-
DOI = "doi:10.1007/978-3-319-99322-5_9",
-
abstract = "The problem of developing an approximate
implementation of a given combinational circuit can be
formulated as a multi-objective design problem and
solved by means of a search algorithm. This approach
usually provides many solutions showing high-quality
tradeoffs between key design objectives; however, it is
very computationally expensive. This chapter presents a
general-purpose method based on genetic programming for
an automated functional approximation of combinational
circuits at the gate and register-transfer levels. It
surveys relevant error metrics and circuit parameters
that are typically optimized by genetic programming. A
special attention is given to the techniques capable of
providing formal guarantees in terms of error bounds
and accelerating the search process. Case studies
dealing with approximate implementations of arithmetic
circuits and image operators are presented to highlight
the quality of results obtained by the search-based
functional approximation in completely different
application domains.",
- }
Genetic Programming entries for
Lukas Sekanina
Zdenek Vasicek
Vojtech Mrazek
Citations