Anytime Floating-Point Addition and Multiplication – Concepts and Implementations

Brand M, Witterauf M, Bosio A, Teich J (2020)


Publication Language: English

Publication Type: Conference contribution, Original article

Publication year: 2020

Conference Proceedings Title: Proceedings of the 31st IEEE International Conference on Application-specific Systems, Architectures and Processors

Event location: Manchester, U.K. GB

DOI: 10.1109/ASAP49362.2020.00034

Abstract

In this paper, we present anytime instructions for floating-

point additions and multiplications. Specific to such instructions is

their ability to compute an arithmetic operation at a programmable

accuracy of a most significant bits where a is encoded in the instruction

itself. Contrary to reduced-precision architectures, the word length is

maintained throughout the execution. Two approaches are presented for

the efficient implementation of anytime additions and multiplications, one

based on on-line arithmetic and the other on bitmasking. We propose

implementations of anytime functional units for both approaches and

evaluate them in terms of error, latency, area, as well as energy savings.

As a result, 15% of energy can be saved on average while computing a

floating-point addition with an error of less than 0.1%. Moreover, large

latency and energy savings are reported for iterative algorithms such as

a Jacobi algorithm with savings of up to 39% in energy.


Authors with CRIS profile

Related research project(s)

How to cite

APA:

Brand, M., Witterauf, M., Bosio, A., & Teich, J. (2020). Anytime Floating-Point Addition and Multiplication – Concepts and Implementations. In Proceedings of the 31st IEEE International Conference on Application-specific Systems, Architectures and Processors. Manchester, U.K., GB.

MLA:

Brand, Marcel, et al. "Anytime Floating-Point Addition and Multiplication – Concepts and Implementations." Proceedings of the Conference on Application-specific Systems, Architectures and Processors (ASAP 2020), Manchester, U.K. 2020.

BibTeX: Download