Energy-Efficient and High-Speed Approximate Signed Multipliers with Sign-Focused Compressors

Approximate computing has emerged as a promising approach to reduce energy by sacrificing some accuracy in error-tolerant applications. For these applications, multiplication is a key fundamental operation. In the paper, we propose an approximate signed multiplier design with a low power consumption and a short critical path. Inexact sign-focused compressors are first proposed to accumulate partial products, which cut the carry propagation and simplify the circuit complexity. Moreover, three types of approximate multipliers are presented to achieve different trade-offs between accuracy loss and hardware saving. Experimental results show that the most accurate proposed multiplier reduces power by 52.44%, area by 37.73%, and delay by 22.14%, compare with the exact signed multiplier. In addition, the proposed multiplier design costs less hardware than other multipliers with a comparable accuracy. At last, an application to image processing shows the efficiency of proposed signed multipliers.

[1]  O. L. Macsorley High-Speed Arithmetic in Binary Computers , 1961, Proceedings of the IRE.

[2]  Fabrizio Lombardi,et al.  Design of Approximate Radix-4 Booth Multipliers for Error-Tolerant Computing , 2017, IEEE Transactions on Computers.

[3]  Bruce F. Cockburn,et al.  Low-Power Approximate Multipliers Using Encoded Partial Products and Approximate Compressors , 2018, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[4]  Seok-Bum Ko,et al.  Design of Power and Area Efficient Approximate Multipliers , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[5]  Fabrizio Lombardi,et al.  Design and Analysis of Approximate Compressors for Multiplication , 2015, IEEE Transactions on Computers.

[6]  Jie Han,et al.  Approximate computing: An emerging paradigm for energy-efficient design , 2013, 2013 18th IEEE European Test Symposium (ETS).

[7]  Toshinori Sato,et al.  A low-power high-speed accuracy-controllable approximate multiplier design , 2018, 2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC).

[8]  Fabrizio Lombardi,et al.  New Metrics for the Reliability of Approximate and Probabilistic Adders , 2013, IEEE Transactions on Computers.

[9]  Magnus Själander,et al.  High-speed and low-power multipliers using the Baugh-Wooley algorithm and HPM reduction tree , 2008, 2008 15th IEEE International Conference on Electronics, Circuits and Systems.

[10]  Mehdi Kamal,et al.  Dual-Quality 4:2 Compressors for Utilizing in Dynamic Accuracy Configurable Multipliers , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  Bo Chen,et al.  Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inference , 2017, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition.

[12]  Jie Han,et al.  Scalable Construction of Approximate Multipliers With Formally Guaranteed Worst Case Error , 2018, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[13]  Bruce A. Wooley,et al.  A Two's Complement Parallel Array Multiplication Algorithm , 1973, IEEE Transactions on Computers.

[14]  Yi Guo,et al.  Low-Cost Approximate Multiplier Design using Probability-Driven Inexact Compressors , 2018, 2018 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS).