Elementary Functions and Approximate Computing
Résumé
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, table-based methods, 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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...