Salim Ullah
Akash Kumar
ABSTRACT
The main focus of the existing approximate arithmetic circuits has been on ASIC-based designs. However, due to the architectural differences between ASICs and FPGAs, comparable performance gains cannot be achieved for FPGA-based systems by using the approximations defined, particularly for ASIC-based systems. This paper exploits the structure of the 6-input lookup tables and associated carry chains of modern FPGAs to define a methodology for designing approximate multipliers optimized for FPGA-based systems. Using our presented methodology, we present SMApproxLib, an open source library of approximate multipliers with different bit-widths, output accuracies and performance gains. Being the first open source library of FPGA-based approximate multipliers, SMAp-proxLib can serve as a benchmark for designing and comparing future FPGA-based approximate arithmetic circuits.
- Kartikeya Bhardwaj, Pravin S Mane, and Jorg Henkel. 2014. Power-and area-efficient Approximate Wallace Tree Multiplier for error-resilient systems. In Quality Electronic Design (ISQED), 2014 15th International Symposium on. IEEE, 263--269.Google Scholar
Cross Ref
- Vinay K Chippa, Srimat T Chakradhar, Kaushik Roy, and Anand Raghunathan. 2013. Analysis and characterization of inherent application resilience for approximate computing. In Proceedings of the 50th Annual Design Automation Conference. ACM, 113. Google ScholarDigital Library
- Jie Han and Michael Orshansky. 2013. Approximate computing: An emerging paradigm for energy-efficient design. In Test Symposium (ETS), 2013 18th IEEE European. IEEE, 1--6.Google ScholarCross Ref
- Parag Kulkarni, Puneet Gupta, and Milos Ercegovac. 2011. Trading accuracy for power with an underdesigned multiplier architecture. In VLSI Design (VLSI Design), 2011 24th International Conference on. IEEE, 346--351. Google ScholarDigital Library
- Martin Kumm, Shahid Abbas, and Peter Zipf. 2015. An efficient softcore multiplier architecture for Xilinx FPGAs. In Computer Arithmetic (ARITH), 2015 IEEE 22nd Symposium on. IEEE, 18--25. Google ScholarDigital Library
- Ian Kuon and Jonathan Rose. 2007. Measuring the gap between FPGAs and ASICs. IEEE Transactions on computer-aided design of integrated circuits and systems 26, 2 (2007), 203--215. Google ScholarDigital Library
- Chia-Hao Lin and Chao Lin. 2013. High accuracy approximate multiplier with error correction. In Computer Design (ICCD), 2013 IEEE 31st International Conference on. IEEE, 33--38.Google ScholarCross Ref
- Cong Liu, Jie Han, and Fabrizio Lombardi. 2014. A low-power, high-performance approximate multiplier with configurable partial error recovery. In Proceedings of the conference on Design, Automation & Test in Europe. European Design and Automation Association, 95. Google ScholarDigital Library
- Vojtech Mrazek, Radek Hrbacek, Zdenek Vasicek, and Lukas Sekanina. 2017. EvoApproxSb: Library of approximate adders and multipliers for circuit design and benchmarking of approximation methods. In 2017 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 258--261. Google ScholarDigital Library
- Hadi Parandeh-Afshar and Paolo Ienne. 2011. Measuring and reducing the performance gap between embedded and soft multipliers on FPGAs. In Field Programmable Logic and Applications (FPL), 2011 International Conference on. IEEE, 225--231. Google ScholarDigital Library
- Semeen Rehman, Walaa El-Harouni, Muhammad Shafique, Akash Kumar, and Jörg Henkel. 2016. Architectural-space Exploration of Approximate Multipliers. In Proceedings of the 35th International Conference on Computer-Aided Design (ICCAD '16). ACM, New York, NY, USA, Article 80, 8 pages. Google ScholarDigital Library
- M. Shafique, W. Ahmad, R. Hafiz, and J. Henkel. 2015. A low latency generic accuracy configurable adder. In 2015 52nd ACM/EDAC/IEEE Design Automation Conference (DAC). 1--6. Google ScholarDigital Library
- Zarrin Tasnim Sworna, Mubin Ul Haque, Hafiz Md Hasan Babu, Lafifa Jamal, and Ashis Kumer Biswas. 2017. An Efficient Design of an FPGA-Based Multiplier Using LUT Merging Theorem. In VLSI (ISVLSI), 2017 IEEE Computer Society Annual Symposium on. IEEE, 116--121.Google ScholarCross Ref
- Xilinx. 2011. Logicore IP multiplier v11.2. https://www.xilinx.com/support/documentation/ip_documentation/mult_gen_ds255.pdfGoogle Scholar
- Xilinx. 2017. Xilinx 7 Series Configurable Logic Block. https://www.xilinx.com/support/documentation/ip_documentation/mult_gen_ds255.pdfGoogle Scholar
Recommendations
Hardware implementation of approximate multipliers for signal processing applications
Multiplication is a complex and substantial arithmetic task involved in signal processing applications. The hardware complexity of the multiplier is always high when compared with any other arithmetic operation. Approximate multiplication is a common ...
Analysis and Design of CMOS Manchester Adders with Variable Carry-Skip
Two different CMOS implementations of the Manchester carry-skip adder are analyzed using the RC timing model, which provides a unified way of analyzing both CMOS circuits and interconnect. Based on the RC timing model, the authors develop efficient ...
Design and Evaluation of Adiabatic Arithmetic Units
Special issue: analog design issues in digital VSLI circuits and systemsAdiabatic design is an attractive approach to reducing energy consumption in VLSI circuits after exhausting the potential of conventional energy-saving techniques. Despite the plethora of adiabatic logic architectures that have been proposed in recent years,...
Comments