The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1999 vol.48)
pp: 842-847
ABSTRACT
<p><b>Abstract</b>—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.</p>
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, August 1999, doi:10.1109/12.795125
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool