This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Interleaved Memory Function Interpolators with Application to an Accurate LNS Arithmetic Unit
August 1994 (vol. 43 no. 8)
pp. 974-982

This paper describes a new method for polynomial interpolation in hardware, with advantages demonstrated by its application to an accurate logarithmic number system (LNS) arithmetic unit. The use of an interleaved memory reduces storage requirements by allowing each stored function value to be used in interpolation across several segments. This strategy can be shown to always use fewer words of memory than an optimized polynomial with stored polynomial coefficients. Interleaved memory function interpolators are then applied to the specific goal of an accurate logarithmic number system arithmetic unit. Many accuracy requirements for the LNS arithmetic unit are possible. Although a round to nearest would be desirable, it cannot be easily achieved. The goal suggested is to insure that the worst case LNS relative error is smaller than the worst case floating point (FP) relative error. Using the interleaved memory interpolator, the detailed design of an LNS arithmetic unit is performed using a second order polynomial interpolator including approximately 91K bits of ROM. This arithmetic unit has better accuracy and less complexity than previous LNS units.

[1] M. G. Arnold, T. A. Bailey, J. R. Cowles, and M. D. Winkel, "Applying features of IEEE 754 to sign logarithm arithmetic,"IEEE Trans. Comput., vol. 41, pp. 1040-1050, Aug. 1992.
[2] F. J. Taylor, R. Gill, J. Joseph, and J. Radke, "A 20 bit logarithmic number system processor,"IEEE Trans. Comput., vol. 37, pp. 190-200, Feb. 1988.
[3] M. Combet, H. Van Zonneveld, and L. Verbeek, "Computation of the base two logarithm of binary numbers,"IEEE Trans. Electron. Comput., pp. 863-867, Dec. 1965.
[4] H.-Y. Lo and Y. Aoki, "Generation of a precise binary logarithm with difference grouping programmable logic array,"IEEE Trans. Comput., vol. C-34, pp. 681-691, Aug. 1985.
[5] F.-S. Lai and C.-F. E. Wu, "A hybrid number system processor with geometric and complex arithmetic capabilities," inIEEE Trans. Comput., vol. 40, pp. 952-662, Aug. 1991.
[6] A. S. Noetzel, "An interpolating memory unit for function evaluation: analysis and design,"IEEE Trans. Comput., vol. 38, pp. 377-384, Mar. 1989.
[7] L. Fox and I. Parker,Chebyshev Polynomials in Numerical Analysis. Oxford, UK: Oxford Univ. Press, 1968.
[8] E. W. Cheney,Introduction to Approximation Theory. New York: McGraw-Hill, 1966.
[9] M. G. Arnold, T. A. Bailey, J. R. Cowles, and J. J. Cupal, "Redundant logarithmic arithmetic,"IEEE Trans. Comput., vol. 39, pp. 1077-1086, Aug. 1990.
[10] D. M. Lewis, "An architecture for addition and subtraction of long word length numbers in the logarithmic number system,"IEEE Trans. Comput., vol. 39, pp. 1326-1336, Nov. 1990.
[11] D. Lewis and L. Yu, "Algorithm design for a 30-bit integrated logarithmic processor," inProc. 9th Symp. Comput. Arithmetic, 1989, pp. 192-199.
[12] IEEE Standard for Binary Floating Point Arithmetic, ANSI/IEEE Std. 754, 1985.
[13] M. J. Schulte and E. E. Swartzlander, "Exact rounding of certain elementary functions,"Proc. 11th Symp. Comput. Arithmetic, 1993, pp. 138-145.
[14] J. Buchanan and P. Turner,Numerical Methods and Analysis. New York: McGraw-Hill, 1992.

Index Terms:
interpolation; approximation theory; polynomials; digital arithmetic; error analysis; read-only storage; interleaved memory function interpolators; accurate LNS arithmetic unit; polynomial interpolation; storage requirements; accuracy requirements; round to nearest; floating point; ROM; 32 bit; 91 kbit.
Citation:
D.M. Lewis, "Interleaved Memory Function Interpolators with Application to an Accurate LNS Arithmetic Unit," IEEE Transactions on Computers, vol. 43, no. 8, pp. 974-982, Aug. 1994, doi:10.1109/12.295859
Usage of this product signifies your acceptance of the Terms of Use.