Fast Evaluation of the Elementary Functions in Single Precision

Authors:
E. Goto;W. f. Wong
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1995

Citing 3
Cited 9

An accurate elementary mathematical library for the IEEE floating point standard

ACM Transactions on Mathematical Software (TOMS)
Fast Division Using Accurate Quotient Approximations to Reduce the Number of Iterations

IEEE Transactions on Computers - Special issue on computer arithmetic
High-Speed Addition in CMOS

IEEE Transactions on Computers

Hardware Starting Approximation Method and Its Application to the Square Root Operation

IEEE Transactions on Computers
Very High Radix Square Root with Prescaling and Rounding and a Combined Division/Square Root Unit

IEEE Transactions on Computers
Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers

IEEE Transactions on Computers - Special issue on computer arithmetic
Accurate Function Approximations by Symmetric Table Lookup and Addition

ASAP '97 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
Radix-4 Reciprocal Square-Root and Its Combination with Division and Square Root

IEEE Transactions on Computers
Multipartite Table Methods

IEEE Transactions on Computers
Numerical Function Generators Using LUT Cascades

IEEE Transactions on Computers
High-performance hardware operators for polynomial evaluation

International Journal of High Performance Systems Architecture
Mathematical model of stored logic based computation

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	15.00

Visualization

Abstract

In this paper we will 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.