IEEE Transactions on Computers · 2019 · 129 citations · 24 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsLow-power DesignMicroelectronicsApproximation AlgorithmsCircuit ComplexityLow-power Digital Circuit DesignLow-power Fpga DesignPower ManagementPower OptimizationApproximate ComputingApproximate Computing For Low PowerApproximate Computing For Power ReductionArea-efficient DesignMultiplier DesignMultipliersPartial ProductsPower-efficient Architecture
Approximate computing is an emerging technique in which power-efficient circuits are designed with reduced complexity in exchange for some loss in accuracy. Such circuits are suitable for applications in which high accuracy is not a strict requirement. Radix-4 modified Booth encoding is a popular multiplication algorithm which reduces the size of the partial product array by half. In this paper, three Approximate Booth Multiplier Models (ABM-M1, ABM-M2, and ABM-M3) are proposed in which approximate computing is applied to the radix-4 modified Booth algorithm. Each of the three designs features a unique approximation technique that involves both reducing the logic complexity of the Booth partial product generator and modifying the method of partial product accumulation. The proposed approximate multipliers are demonstrated to have better performance than existing approximate Booth multipliers in terms of accuracy and power. Compared to the exact Booth multiplier, ABM-M1 achieves up to a 23 percent reduction in area and 15 percent reduction in power with a Mean Relative Error Distance (MRED) value of 7:9 × 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-4</sup> . ABM-M2 has area and power savings of up to 51 and 46 percent respectively with a MRED of 2:7 × 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-2</sup> . ABM-M3 has area savings of up to 56 percent and power savings of up to 46 percent with a MRED of 3:4 × 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-3</sup> . The proposed designs are compared with the state-of-the-art existing multipliers and are found to outperform them in terms of area and power savings while maintaining high accuracy. The performance of the proposed designs are demonstrated using image transformation, matrix multiplication, and Finite Impulse Response (FIR) filtering applications.
24
High-Speed Arithmetic in Binary Computers
O. L. Macsorley · Proceedings of the IRE · 1961 · 622 citations
Design and Analysis of Approximate Compressors for Multiplication
Amir Momeni, Jie Han, Paolo Montuschi et al. · IEEE Transactions on Computers · 2014 · 620 citations · Full text