Low-Power Approximate RPR Scheme for Unsigned Integer Arithmetic Computation

Ke Chen, Weiqiang Liu, Ahmed Louri, Fabrizio Lombardi

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


A scheme often used for error tolerance of arithmetic circuits is the so-called Reduced Precision Redundancy (RPR). Rather than replicating multiple times the entire module, RPR uses reduced precision (inexact) copies to significantly reduce the redundancy overhead, while still being able to correct the largest errors. This paper focuses on the low-power operation for RPR; a new scheme is proposed. At circuit level, power gating is initially utilized in the arithmetic modules to power off one of the modules (i.e., the exact module) when the inexact modules' error is smaller than the threshold. The proposed design is applicable to (unsigned integer) addition, multiplication, and MAC (multiply and add) by proposing RPR implementations that reduce the power consumption with a limited impact on its error correction capability. The proposed schemes have been implemented and tested for various applications (image and DCT processing). The results show that they can significantly reduce power consumption; moreover, the simulation results show that the Mean Square Error (MSE) at the proposed schemes' output is low.

Original languageEnglish (US)
Pages (from-to)36-44
Number of pages9
JournalIEEE Open Journal of Nanotechnology
StatePublished - 2022


  • Digital arithmetic
  • approximation methods
  • integrated circuit design
  • redundant systems

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Materials Chemistry
  • Electrical and Electronic Engineering
  • Computer Science Applications


Dive into the research topics of 'Low-Power Approximate RPR Scheme for Unsigned Integer Arithmetic Computation'. Together they form a unique fingerprint.

Cite this