Internet Tools for
Accurate Function Approximation by Symmetric Table Lookup and Addition
Michael J. Schulte
James E. Stine
EECS Department
Lehigh University

• J. E. Stine and M. J. Schulte, ``The Symmetric Table Addition Method for Accurate Function Approximation,'' in Journal of VLSI Signal Processing, vol. 21, no. 2, pp. 167-177, June, 1999. (Postscript File)
• M. J. Schulte and James E. Stine, ``Accurate Function Approximations by Symmetric Table Lookup and Addition,'' Proceedings of the 11th International Conference on Application-Specific Systems, Architectures, and Processors, Zurich, Switzerland, pp. 144-153, July, 1997. (Postscript File)

Journal Paper Abstract:

This paper presents a high-speed method for computing elementary functions using parallel table lookups and multi-operand addition. Increasing the number of tables and inputs to the multi-operand adder significantly reduces the amount of memory required. Symmetry and leading zeros in the table coefficients are used to reduce the amount of memory even further. This method has a closed-form solution for the table entries and can be applied to any differentiable function. For 24-bit operands, it requires two to three orders of magnitude less memory than conventional table lookups.

STAM Tools:

• Tarred and gzipped directory containing the SBTM code and documention
• Program which tabulate results in paper for m=2
• Program which tabulate results in paper for m=3
• Program which tabulate results in paper for m=4
• Program which tabulate results in paper for m=5
• Program which tabulate results in paper for m=6
• Header file for program to tabulate results in paper
• Sample input files for 24-bit operand for sine for m=6
• Document describing sample input file and its possible values
• The Symmetric Bypartite Table Method (SBTM)