
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D.M. Lewis, "An Architecture for Addition and Subtraction of Long Word Length Numbers in the Logarithmic Number System," IEEE Transactions on Computers, vol. 39, no. 11, pp. 13251336, November, 1990.  
BibTex  x  
@article{ 10.1109/12.61042, author = {D.M. Lewis}, title = {An Architecture for Addition and Subtraction of Long Word Length Numbers in the Logarithmic Number System}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {11}, issn = {00189340}, year = {1990}, pages = {13251336}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.61042}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Architecture for Addition and Subtraction of Long Word Length Numbers in the Logarithmic Number System IS  11 SN  00189340 SP1325 EP1336 EPD  13251336 A1  D.M. Lewis, PY  1990 KW  computer architecture; long word length numbers; logarithmic number system; addition; subtraction; lookup tables; linear approximation; nonlinear functions; design parameters; digital arithmetic; table lookup. VL  39 JA  IEEE Transactions on Computers ER   
An architecture is described for performing addition and subtraction of numbers in the logarithmic number system using small lookup tables. Previous implementations require approximately 4*2/sup F/ words for F bits of precision in the fraction. The author shows how to reduce the size of the lookup table to fewer than (18+F)*2/sup F/2/ words. The key to this is the use of a linear approximation of the nonlinear functions stored in the lookup tables. The functions involved are highly nonlinear in some regions, so variable size regions are used for the approximation. The replacement of the F exponential dependence on the number of words by F/2 allows roughly 50% more bits of fractional precision to be obtained for a given amount of ROM. The architecture is mathematically analyzed, yielding explicit expressions for all design parameters. The approach is illustrated with an example logarithmic addition and subtraction unit using 32b words with 30b exponents containing 22 fractional bits. A factor of 118 reduction in table size compared to previous techniques is achieved for this example.
[1] M. Combet, H. Van Zonneveld, and L. Verbeek, "Computation of the base two logarithm of binary numbers,"IEEE Trans. Electron. Comput., pp. 863867, Dec. 1965.
[2] N. G. Kingsley and P. T. W. Rayner, "Digital filtering using logarithmic arithmetic,"Electron. Lett., vol. 72, pp. 5658, 1971.
[3] J. H. Lang, C. A. Zukowski, R. O. LaMaire, and C. H. An, "Integratedcircuit logarithmic units,"IEEE Trans. Comput., pp. 475483, May 1985.
[4] H.Y. Lo and Y. Aoki, "Generation of a precise binary logarithm with difference grouping programmable logic array,"IEEE Trans. Comput., vol. C34, pp. 681691, Aug. 1985.
[5] D. Marino, "New algorithm for the approximate evaluation in hardware of binary logarithms and elementary functions,"IEEE Trans. Comput., pp. 14161421, Dec. 1972.
[6] J. N. Mitchell Jr., "Computer multiplication and division using binary logarithms,"IRE Trans. Electron. Comput., pp. 512517, Aug. 1962.
[7] E. E. Swartzlander and A. G. Alexopolous, "The signed logarithm number system,"IEEE Trans. Comput., pp. 12381242, Dec. 1975.
[8] F. J. Taylor, "An extended precision logarithmic number system,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP31, pp. 231233, Feb. 1983.
[9] F. J. Taylor, R. Gill, J. Joseph, and J. Radke, "A 20 bit logarithmic number system processor,"IEEE Trans. Comput., pp. 190200, Feb. 1988.