The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2005 vol.54)
pp: 304-318
Stuart F. Oberman , IEEE Computer Society
ABSTRACT
A table-based method for high-speed function approximation in single-precision floating-point format is presented in this paper. Our focus is the approximation of reciprocal, square root, square root reciprocal, exponentials, logarithms, trigonometric functions, powering (with a fixed exponent p), or special functions. The algorithm presented here combines table look-up, an enhanced minimax quadratic approximation, and an efficient evaluation of the second-degree polynomial (using a specialized squaring unit, redundant arithmetic, and multioperand addition). The execution times and area costs of an architecture implementing our method are estimated, showing the achievement of the fast execution times of linear approximation methods and the reduced area requirements of other second-degree interpolation algorithms. Moreover, the use of an enhanced minimax approximation which, through an iterative process, takes into account the effect of rounding the polynomial coefficients to a finite size allows for a further reduction in the size of the look-up tables to be used, making our method very suitable for the implementation of an elementary function generator in state-of-the-art DSPs or graphics processing units (GPUs).
INDEX TERMS
Table-based methods, reciprocal, square root, elementary functions, minimax polynomial approximation, single-precision computations, computer arithmetic.
CITATION
Jose-Alejandro Pi?eiro, Stuart F. Oberman, Jean-Michel Muller, Javier D. Bruguera, "High-Speed Function Approximation Using a Minimax Quadratic Interpolator", IEEE Transactions on Computers, vol.54, no. 3, pp. 304-318, March 2005, doi:10.1109/TC.2005.52
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool