LeAp: Leading-one Detection-based Softcore Approximate Multipliers with Tunable Accuracy

Approximate multipliers are ubiquitously used in diverse applications by exploiting circuit simplification, mainly specialized for Application-Specific Integrated Circuit (ASIC) platforms. However, the intrinsic architectural specifications of Field-Programmable Gate Arrays (FPGAs) prohibited comparable resource gains when directly applying these techniques. LeAp is an area-, throughput-, and energy-efficient approximate multiplier for FPGAs which efficiently utilizes 6-input Look-up Tables (6-LUTs) and fast carry chains in its novel approximate log calculator to implement Mitchell’s algorithm. Moreover, three novel error-refinement schemes with negligible area overhead and independent from multiplier-size, have boosted accuracy to $\gt 99$%. Experimental results obtained from Vivado, Artificial Neural Network (ANN) and image processing applications indicate superiority of proposed multiplier over accurate and state-of-the-art approximate counterparts. In particular, LeAp outperforms the 32x32 accurate multiplier by achieving 69.7%, 14.7%, 42.1%, and 37.1% improvement in area, throughput, power, and energy, respectively. The library of RTL and behavioral implementations will be open-sourced at https://cfaed.tu-dresden.de/pd-downloads.

[1]  Muhammad Shafique,et al.  DeMAS: An efficient design methodology for building approximate adders for FPGA-based systems , 2018, 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[2]  Roland Vollgraf,et al.  Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms , 2017, ArXiv.

[3]  Jonathan Rose,et al.  Measuring the Gap Between FPGAs and ASICs , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Fabrizio Lombardi,et al.  A low-power, high-performance approximate multiplier with configurable partial error recovery , 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[5]  L. Deng,et al.  The MNIST Database of Handwritten Digit Images for Machine Learning Research [Best of the Web] , 2012, IEEE Signal Processing Magazine.

[6]  Puneet Gupta,et al.  Trading Accuracy for Power with an Underdesigned Multiplier Architecture , 2011, 2011 24th Internatioal Conference on VLSI Design.

[7]  Natalie D. Enright Jerger,et al.  Reduced-Precision Strategies for Bounded Memory in Deep Neural Nets , 2015, ArXiv.

[8]  Swagath Venkataramani,et al.  Compensated-DNN: Energy Efficient Low-Precision Deep Neural Networks by Compensating Quantization Errors , 2018, 2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC).

[9]  Lei Wu,et al.  Hierarchical Synthesis of Approximate Multiplier Design for Field-programmable Gate Arrays (FPGA)-CSRmesh System , 2018 .

[10]  Akash Kumar,et al.  SMApproxLib: Library of FPGA-based Approximate Multipliers , 2018, 2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC).

[11]  Sri Parameswaran,et al.  Minimally Biased Multipliers for Approximate Integer and Floating-Point Multiplication , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Kartikeya Bhardwaj,et al.  Power- and area-efficient Approximate Wallace Tree Multiplier for error-resilient systems , 2014, Fifteenth International Symposium on Quality Electronic Design.

[13]  Guy Lemieux,et al.  Reducing the cost of floating-point mantissa alignment and normalization in FPGAs , 2012, FPGA '12.

[14]  Kiat Seng Yeo,et al.  Low-power high-speed multiplier for error-tolerant application , 2010, 2010 IEEE International Conference of Electron Devices and Solid-State Circuits (EDSSC).

[15]  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.

[16]  Patricio Bulic,et al.  Applicability of approximate multipliers in hardware neural networks , 2012, Neurocomputing.

[17]  Muhammad Shafique,et al.  Invited: Cross-layer approximate computing: From logic to architectures , 2016, 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[18]  L M Patnaik,et al.  FPGA based Recursive Error Free Mitchell Log Multiplier for image Filters , 2012, 2012 IEEE International Conference on Computational Intelligence and Computing Research.

[19]  Semeen Rehman,et al.  Architectural-space exploration of approximate multipliers , 2016, 2016 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[20]  Ching-Chuen Jong,et al.  Unified Mitchell-Based Approximation for Efficient Logarithmic Conversion Circuit , 2015, IEEE Transactions on Computers.

[21]  Sherief Reda,et al.  DRUM: A Dynamic Range Unbiased Multiplier for approximate applications , 2015, 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[22]  Maurizio Valle,et al.  Approximate Multipliers Based on Inexact Adders for Energy Efficient Data Processing , 2017, 2017 New Generation of CAS (NGCAS).

[23]  E. V. Krishnamurthy,et al.  On Computer Multiplication and Division Using Binary Logarithms , 1963, IEEE Transactions on Electronic Computers.

[24]  Muhammad Shafique,et al.  Area-Optimized Low-Latency Approximate Multipliers for FPGA-based Hardware Accelerators , 2018, 2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC).

[25]  Andreas Ehliar.  Optimizing Xilinx designs through primitive instantiation , 2010 .

[26]  Taejoon Park,et al.  Energy-Efficient Approximate Multiplication for Digital Signal Processing and Classification Applications , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[27]  Yang Jing,et al.  FPGA Design and Implementation of an Improved 32-bit Binary Logarithm Converter , 2008, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.