High-radix logarithm with selection by rounding

A high-radix digit-recurrence algorithm or the computation of the logarithm is presented in this paper. Selection by rounding is used in iterations j/spl ges/2, and selection by table in the first iteration is combined with a restricted digit-set for the second one, in order to guarantee the convergence of the algorithm. A sequential architecture is proposed. and the execution time and hardware requirements of this architecture are estimated, for a target precision of n=32 bits and a radix r=256. These estimates are obtained according to a rough model for the delay and area cost of the main logic blocks employed, and show the achievement of a speed-up by over 4 times with regard to a conventional radix-2 implementation with redundant arithmetic.

[1]  Robert W. Bemer,et al.  A subroutine method for calculating logarithms , 1958, CACM.

[2]  John N. Mitchell,et al.  Computer Multiplication and Division Using Binary Logarithms , 1962, IRE Trans. Electron. Comput..

[3]  W. H. Specker.  A Class of Algorithms for Ln x, Exp x, Sin x, Cos x, Tan-1 x, and Cot-1 x , 1965, IEEE Trans. Electron. Comput..

[4]  C. T. Fike.  Computer Evaluation of Mathematical Functions , 1970 .

[5]  T. C. Chen.  Automatic computation of exponentials, logarithms, ratios and square roots , 1972 .

[6]  Milos D. Ercegovac.  Radix-16 Evaluation of Certain Elementary Functions , 1973, IEEE Transactions on Computers.

[7]  P. W. Baker.  Parallel Multiplicative Algorithms for Some Elementary Functions , 1975, IEEE Transactions on Computers.

[8]  William M. Waite,et al.  Software manual for the elementary functions , 1980 .

[9]  Tomás Lang,et al.  Very high radix division with selection by rounding and prescaling , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[10]  M. Ercegovac,et al.  Division and Square Root: Digit-Recurrence Algorithms and Implementations , 1994 .

[11]  Weng-Fai Wong,et al.  Fast Hardware-Based Algorithms for Elementary Function Computations Using Rectangular Multipliers , 1994, IEEE Trans. Computers.

[12]  Tomás Lang,et al.  Very-High Radix Division with Prescaling and Selection by Rounding , 1994, IEEE Trans. Computers.

[13]  David Lewis.  114 MFLOPS logarithmic number system arithmetic unit for DSP applications , 1995 .

[14]  Javier D. Bruguera,et al.  High Radix Cordic Rotation Based on Selection by Rounding , 1996, Euro-Par, Vol. II.

[15]  Stamatis Vassiliadis,et al.  Sigmoid Generators for Neural Computing Using Piecewise Approximations , 1996, IEEE Trans. Computers.

[16]  Jean-Michel Muller,et al.  Elementary Functions: Algorithms and Implementation , 1997 .

[17]  J. Muller.  Elementary Functions , 1997, Birkhäuser Boston.

[18]  Javier D. Bruguera,et al.  Computation of sqrt(x/d) in a Very High Radix Combined Division/Square-Root Unit with Scaling , 1998, IEEE Trans. Computers.

[19]  Lee-Sup Kim,et al.  A minimized hardware architecture of fast Phong shader using Taylor series approximation in 3D graphics , 1998, Proceedings International Conference on Computer Design. VLSI in Computers and Processors (Cat. No.98CB36273).

[20]  Arnaud Tisserand,et al.  Reciprocation, square root, inverse square root, and some elementary functions using small multipliers , 1998, Optics & Photonics.

[21]  Tomás Lang,et al.  Very High Radix Square Root with Prescaling and Rounding and a Combined Division/Square Root Unit , 1999, IEEE Trans. Computers.

[22]  Milos D. Ercegovac,et al.  Improving Goldschmidt Division, Square Root, and Square Root Reciprocal , 2000, IEEE Trans. Computers.