.png){kind=icon}
.png){kind=icon}
Return
Elementary Functions and Approximate Computing
.png){kind=icon}
OA
AI
DOI：10.1109/JPROC.2020.2991885.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Approximation algorithms
Approximate computing
Hardware
Software algorithms
Fixed-point arithmetic
Approximate computing
elementary functions
fixed-point arithmetic
floating-point arithmetic
polynomial approximations
shift-and-add algorithms
table-based methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.