Fast Evaluation of the Elementary Functions in Single Precision
Lists
Only you see this
Abstract
In this paper we introduce a new method for the fast evaluation of the elementary functions in single precision based on the evaluation of truncated Taylor series using a difference method. We assume the availability of large and fast (at least for read purposes) memory. We call this method the ATA (Add-Table lookup-Add) method. As the name implies, the hardware required for the method are adders (both two/ and multi/operand adders) and fast tables. For IEEE single precision numbers our initial estimates indicate that we can calculate the basic elementary functions, namely reciprocal, square root, logarithm, exponential, trigonometric and inverse trigonometric functions, within the latency of two to four floating point multiplies.<
BibTeX
@article{wong1995fast,
author = {Weng-Fai Wong and Eiichi Goto},
title = {{Fast Evaluation of the Elementary Functions in Single Precision}},
journal = {IEEE Trans. Computers},
year = {1995},
doi = {10.1109/12.372037},
}Loading related content...