Automated Search-Based Functional Approximation for Digital Circuits

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.

[1]  Sung-Jea Ko,et al.  Center weighted median filters and their applications to image enhancement , 1991 .

[2]  Sherief Reda,et al.  Automated High-Level Generation of Low-Power Approximate Computing Circuits , 2019, IEEE Transactions on Emerging Topics in Computing.

[3]  John Sartori,et al.  Statistical analysis and modeling for error composition in approximate computation circuits , 2013, 2013 IEEE 31st International Conference on Computer Design (ICCD).

[4]  Lukás Sekanina,et al.  Evolutionary design of approximate multipliers under different error metrics , 2014, 17th International Symposium on Design and Diagnostics of Electronic Circuits & Systems.

[5]  Ehsanollah Kabir,et al.  Approximate Arithmetic for Low-Power Image Median Filtering , 2015, Circuits Syst. Signal Process..

[6]  Sherief Reda,et al.  ABACUS: A technique for automated behavioral synthesis of approximate computing circuits , 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[7]  Lukás Sekanina,et al.  Approximating complex arithmetic circuits with formal error guarantees: 32-bit multipliers accomplished , 2017, 2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[8]  Lukás Sekanina,et al.  Evolutionary Approach to Approximate Digital Circuits Design , 2015, IEEE Transactions on Evolutionary Computation.

[9]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[10]  Zdenek Vasicek,et al.  Relaxed equivalence checking: a new challenge in logic synthesis , 2017, 2017 IEEE 20th International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS).

[11]  Kaushik Roy,et al.  Design of power-efficient approximate multipliers for approximate artificial neural networks , 2016, 2016 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[12]  Lukás Sekanina,et al.  Evolutionary design of complex approximate combinational circuits , 2015, Genetic Programming and Evolvable Machines.

[13]  Puneet Gupta,et al.  Trading Accuracy for Power in a Multiplier Architecture , 2011, J. Low Power Electron..

[14]  Lukás Sekanina,et al.  EvoApproxSb: Library of approximate adders and multipliers for circuit design and benchmarking of approximation methods , 2017, Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017.

[15]  Lukás Sekanina,et al.  Approximate circuit design by means of evolvable hardware , 2013, 2013 IEEE International Conference on Evolvable Systems (ICES).

[16]  Julian F. Miller,et al.  Designing Electronic Circuits Using Evolutionary Algorithms. Arithmetic Circuits: A Case Study , 2007 .

[17]  Caro Lucas,et al.  Bio-Inspired Imprecise Computational Blocks for Efficient VLSI Implementation of Soft-Computing Applications , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.

[18]  Zdenek Vasícek,et al.  Trading between quality and non-functional properties of median filter in embedded systems , 2017, Genetic Programming and Evolvable Machines.

[19]  Thomas S. Huang,et al.  A fast two-dimensional median filtering algorithm , 1979 .

[20]  Zdenek Vasícek,et al.  Automatic design of approximate circuits by means of multi-objective evolutionary algorithms , 2016, 2016 International Conference on Design and Technology of Integrated Systems in Nanoscale Era (DTIS).

[21]  Lukás Sekanina,et al.  Towards low power approximate DCT architecture for HEVC standard , 2017, Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017.

[22]  Kaushik Roy,et al.  MACACO: Modeling and analysis of circuits for approximate computing , 2011, 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[23]  L. Sekanina,et al.  Approximate Circuits in Low-Power Image and Video Processing: The Approximate Median Filter , 2017 .

[24]  John P. Hayes,et al.  Behavior of stochastic circuits under severe error conditions , 2014, it Inf. Technol..

[25]  Lukás Sekanina,et al.  Evolution of efficient real-time non-linear image filters for FPGAs , 2013, Soft Comput..

[26]  Julian Francis Miller.  Cartesian Genetic Programming , 2011, Cartesian Genetic Programming.

[27]  Richard A. Haddad,et al.  Adaptive median filters: new algorithms and results , 1995, IEEE Trans. Image Process..

[28]  Rolf Drechsler,et al.  Precise error determination of approximated components in sequential circuits with model checking , 2016, 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[29]  Lukás Sekanina,et al.  An Area-Efficient Alternative to Adaptive Median Filtering in FPGAs , 2007, 2007 International Conference on Field Programmable Logic and Applications.

[30]  Rajesh K. Gupta,et al.  Grater: An approximation workflow for exploiting data-level parallelism in FPGA acceleration , 2016, 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[31]  Kaushik Roy,et al.  Substitute-and-simplify: A unified design paradigm for approximate and quality configurable circuits , 2013, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[32]  Zdenek Vasícek,et al.  Efficient Phenotype Evaluation in Cartesian Genetic Programming , 2012, EuroGP.

[33]  Lukás Sekanina,et al.  A global postsynthesis optimization method for combinational circuits , 2011, 2011 Design, Automation & Test in Europe.

[34]  Fabrizio Lombardi,et al.  A comparative evaluation of approximate multipliers , 2016, 2016 IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH).