A fast BDD Minimization Framework for Approximate Computing
Andreas Wendlera and Oliver Keszoczeb
Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
aandreas.wendler@fau.de
boliver.keszoecze@fau.de
ABSTRACT
Approximate Computing is a design paradigm that trades off computational accuracy for gains in non-functional aspects such as reduced area, increased computation speed, or power reduction. Computing the error of the approximated design is an essential step to determine its quality. The computation time for determining the error can become very large, effectively rendering the entire logic approximation procedure infeasible. As a remedy, we present methods to accelerate the computation of error metric computations by (a) exploiting structural information and (b) computing estimates of the metrics for multi-output Boolean functions represented as BDDs. We further present a novel greedy, bucket-based BDD minimization framework employing the newly proposed error metric computations to produce Pareto-optimal solutions with respect to BDD size and multiple error metrics. The applicability of the proposed minimization framework is demonstrated by an experimental evaluation. We can report considerable speedups while, at the same time, creating high-quality approximated BDDs.
Keywords: Approximate Computing, Design Space Exploration, Multi-Objective Optimization, BDD Minimization, Logic Minimization, Error Metrics.
