This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Approximating Elementary Functions with Symmetric Bipartite Tables
August 1999 (vol. 48 no. 8)
pp. 842-847

Abstract—This paper presents a high-speed method for function approximation that employs symmetric bipartite tables. This method performs two parallel table lookups to obtain a carry-save (borrow-save) function approximation, which is either converted to a two's complement number or is Booth encoded. Compared to previous methods for bipartite table approximations, this method uses less memory by taking advantage of symmetry and leading zeros in one of the two tables. It also has a closed-form solution for the table entries, provides tight bounds on the maximum absolute error, and can be applied to a wide range of functions. A variation of this method provides accurate initial approximations that are useful in multiplicative divide and square root algorithms.

[1] V.K. Jain and L. Lin, “High-Speed Double Precision Computation of Nonlinear Functions,” Proc. 12th Symp. Computer Arithmetic, pp. 107-114, 1995.
[2] Y.M. Hu, “CORDIC-Based VLSI Architectures for Digital Signal Processing,” IEEE Signal Processing Magazine, vol. 9, pp. 16-35, 1992.
[3] J.M. Muller, Elementary Functions. Algorithms and Implementation. Birkhauser, 1997.
[4] J.E. Volder, “The CORDIC Trigonometric Computing Technique,” IRE Trans. Electronic Computers, vol. 8, pp. 330-334, 1959.
[5] J.S. Walther, “A Unified Approach for Elementary Functions,” Proc. Spring Joint Computer Conf., pp. 379-385, 1971.
[6] P. Farmwald, “High Bandwidth Evaluation of Elementary Functions,” Proc. Fifth Symp. Computer Arithmetic, pp. 139-142, 1981.
[7] M.J. Schulte and E.E. Swartzlander Jr., Hardware Designs for Exactly Rounded Elementary Functions IEEE Trans. Computers, vol. 43, no. 8, pp. 964-973, Aug. 1994.
[8] P.T.P. Tang, “Table-Lookup Algorithms for Elementary Functions and Their Error Analysis,” Proc. 10th Symp. Computer Arithmetic, pp. 232-236, 1991.
[9] T. Lynch et al., “The K5 Transcendental Functions,” Proc. 12th Symp. Computer Arithmetic, pp. 163-171, 1995.
[10] I. Koren, “Evaluating Elementary Functions in a Numerical Coprocessor Based on Rational Approximations,” IEEE Trans. Computers, vol. 40, pp. 1,030-1,037, 1990.
[11] H. Hassler and N. Takagi, "Function Evaluation by Table Look-Up and Addition," Proc. 12th Symp. Computer Arithmetic, pp. 10-16, July 1995.
[12] D. DasSarma and D.W. Matula, “Faithful Bipartite ROM Reciprocal Tables,” Proc. 12th Symp. Computer Arithmetic, pp. 17-28, 1995.
[13] A.D. Booth, “A Signed Multiplication Technique,” Quarterly J. Mechanical Applied Mathematics, vol. 4, pp. 236-240, 1951.
[14] C.N. Lyu and D.W. Matula, “Redundant Binary Booth Recoding,” Proc. 12th Symp. Computer Arithmetic, pp. 50-57, 1995.
[15] M.J. Flynn, “On Division by Functional Iteration,” IEEE Trans. Computers, vol. 19, pp. 702-706, 1970.
[16] C.V. Ramamoorthy and J. Goodman, “Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication,” IEEE Trans. Computers, vol. 21, pp. 837-847, 1972.
[17] D.C. Wong and M.J. Flynn, “Fast Division Using Accurate Quotient Approximations to Reduce the Number of Iterations,” Proc. 10th Symp. Computer Arithmetic, pp. 191-201, 1991.
[18] M. Ito, N. Takagi, and S. Yajima, "Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification," IEEE Trans. Computers, vol. 46, no. 4, pp. 495-498, Apr. 1997.
[19] H. Kwan, R.L. Nelson, and E.E. Swartzlander Jr., “Cascaded Implementation of an Iterative Inverse-Square Root Algorithm with Overflow Lookahead,” Proc. 12th Symp. Computer Arithmetic, pp. 114-123, 1995.
[20] M.J. Schulte and J.E. Stine, “Symmetric Bipartite Tables for Accurate Function Approximation” Proc. 13th Symp. Computer Arithmetic (ARITH13), pp. 175-183, 1997.
[21] D. Das Sarma and D.W. Matula, “Measuring the Accuracy of ROM Reciprocal Tables,” IEEE Trans. Computers, vol. 43, no. 8, Aug. 1994.
[22] M.J. Schulte, J. Omar, and E.E. Swartzlander Jr., “Optimal Initial Approximations for the Newton-Raphson Division Algorithm,” Computing, vol. 53, pp. 233-242, 1994.
[23] P. Montuschi and M. Messalama, “Optimal Absolute Error Starting Value for Newton-Raphson Calculation of Square Root,” Computing, vol. 46, pp. 67-86, 1991.
[24] J.E. Stine and M.J. Schulte, “The Symmetric Table Addition Method for Accurate Function Approximation,” J. VLSI Signal Processing Systems for Signal Image and Video Technology, vol. 21, pp. 167-177, 1999.
[25] N. Takagi, "Generating a Power of an Operand by a Table Look-Up and a Multiplication," Proc. 13th Symp. Computer Arithmetic, pp. 126-131, July 1997.

Index Terms:
Elementary functions, approximations, table lookups, bipartite tables.
Citation:
Michael J. Schulte, James E. Stine, "Approximating Elementary Functions with Symmetric Bipartite Tables," IEEE Transactions on Computers, vol. 48, no. 8, pp. 842-847, Aug. 1999, doi:10.1109/12.795125
Usage of this product signifies your acceptance of the Terms of Use.