Efficient Arithmetic Error Rate Calculus for Visibility Reduced Approximate Adders

Echavarria Gutiérrez JA, Wildermann S, Potwigin E, Teich J (2017)

Publication Language: English

Publication Type: Journal article, Original article

Publication year: 2017

Journal

IEEE Embedded Systems Letters Institute of Electrical and Electronics Engineers (IEEE)

Article Number: 99

Journal Issue: Approximate Computing

DOI: 10.1109/LES.2017.2760922

Abstract

In this paper, we present a novel methodology to calculate the Arithmetic Error Rate (AER) for deterministic approximate adder architectures where the calculation of each output bit is restricted to a subset of the input bits, denoted as visibilities. Such architectures have been widely proposed in the literature and are, e.g., obtained when splitting the carry chain in a carry-propagate adder into partitions each computed by a separate parallel adder, or when removing carry-lookahead operators in a parallel prefix adder. Our contribution is a unified calculus for determining the arithmetic error rate for (a) such deterministic approximate adder architectures making use of visibilities and (b) the general case of arbitrarily (also non-uniformly) distributed input bits.

Authors with CRIS profile

Jorge Alfonso Echavarria Gutiérrez Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design) Stefan Wildermann Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design) Jürgen Teich Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)

Related research project(s)

None - None

How to cite

APA:

Echavarria Gutiérrez, J.A., Wildermann, S., Potwigin, E., & Teich, J. (2017). Efficient Arithmetic Error Rate Calculus for Visibility Reduced Approximate Adders. IEEE Embedded Systems Letters, Approximate Computing. https://doi.org/10.1109/LES.2017.2760922

MLA:

Echavarria Gutiérrez, Jorge Alfonso, et al. "Efficient Arithmetic Error Rate Calculus for Visibility Reduced Approximate Adders." IEEE Embedded Systems Letters Approximate Computing (2017).

BibTeX: Download