Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F20%3APU138634" target="_blank" >RIV/00216305:26230/20:PU138634 - isvavai.cz</a>
Result on the web
<a href="https://www.fit.vut.cz/research/publication/12354/" target="_blank" >https://www.fit.vut.cz/research/publication/12354/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-51825-7_33" target="_blank" >10.1007/978-3-030-51825-7_33</a>
Alternative languages
Result language
angličtina
Original language name
Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits
Original language description
Approximate circuits that trade the chip area or power consumption for the precision of the computation play a key role in development of energy-aware systems. Designing complex approximate circuits is, however, very difficult, especially, when a given approximation error has to be guaranteed. Evolutionary search algorithms together with SAT-based error evaluation currently represent one of the most successful approaches for automated circuit approximation. In this paper, we apply satisfiability solving not only for circuit evaluation but also for its minimisation. We consider and evaluate several approaches to this task, both inspired by existing works as well as novel ones. Our experiments show that a combined strategy, integrating evolutionary search and SMT-based sub-circuit minimisation (using quantified theory of arrays) that we propose, is able to find complex approximate circuits (e.g. 16-bit multipliers) with considerably better trade-offs between the circuit precision and size than existing~approaches.
Czech name
—
Czech description
—
Classification
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)
Result continuities
Project
<a href="/en/project/GJ20-02328Y" target="_blank" >GJ20-02328Y: CAQtuS: Computer-Aided Quantitative Synthesis</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Theory and Applications of Satisfiability Testing - SAT 2020
ISBN
978-3-030-51824-0
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
481-491
Publisher name
Springer International Publishing
Place of publication
Alghero
Event location
Alghero
Event date
Jul 3, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000711645300033