Elementary Functions and Approximate Computing
Year: 2020
Type: article
Abstract: In this article, we review some of the classical methods used for quickly obtaining low-precision approximations to the elementary functions. Then, for each of the three main classes of elementary function algorithms (shift-and-add algorithms, polynomial or rational approximations, and table-based methods) and for the additional, specific to approximate computing, “bit-manipulation” techniques, we examine what can be done for obtaining very fast estimates of a function, at the cost of a (controlled) loss in terms of accuracy.
Source: Proceedings of the IEEE
Author: Jean-Michel Muller
Institutions: Lyon 1 Université, École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Laboratoire de l'Informatique du Parallélisme, ARIC: Arithmétiques des ordinateurs, méthodes formelles, génération de code
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3021994671