Elementary Functions and Approximate Computing - Archive ouverte HAL Access content directly
Journal Articles Proceedings of the IEEE Year : 2020

Elementary Functions and Approximate Computing


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) 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.
Fichier principal
Vignette du fichier
FINAL_VERSION.pdf (3.55 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02517784 , version 1 (24-03-2020)
hal-02517784 , version 2 (29-04-2020)



Jean-Michel Muller. Elementary Functions and Approximate Computing. Proceedings of the IEEE, 2020, 108 (12), pp.1558-2256. ⟨10.1109/JPROC.2020.2991885⟩. ⟨hal-02517784v2⟩
277 View
840 Download



Gmail Facebook Twitter LinkedIn More