HPR-Mul: An Area and Energy-Efficient High-Precision Redundancy Multiplier by Approximate Computing
Jafar Vafaei, Omid Akbari

TL;DR
This paper introduces HPR-Mul, a high-precision, energy-efficient, and area-saving multiplier based on approximate computing, designed to replace traditional fault-tolerant schemes in critical applications.
Contribution
It proposes a novel HPR-Mul architecture combining full and reduced precision multipliers with a simple voter, improving energy efficiency, area, and soft error tolerance over existing methods.
Findings
Up to 70% lower power consumption compared to TMR multipliers.
Up to 69% reduction in area relative to TMR schemes.
Achieves 84% higher soft error tolerance than state-of-the-art RPR-Mul.
Abstract
For critical applications that require a higher level of reliability, the Triple Modular Redundancy (TMR) scheme is usually employed to implement fault-tolerant arithmetic units. However, this method imposes a significant area and power/energy overhead. Also, the majority-based voter in the typical TMR designs is highly sensitive to soft errors and the design diversity of the triplicated module, which may result in an error for a small difference between the output of the TMR modules. However, a wide range of applications deployed in critical systems are inherently error-resilient, i.e., they can tolerate some inexact results at their output while having a given level of reliability. In this paper, we propose a High Precision Redundancy Multiplier (HPR-Mul) that relies on the principles of approximate computing to achieve higher energy efficiency and lower area, as well as resolve the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
