The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1990 vol.39)
pp: 1325-1336
ABSTRACT
<p>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 32-b words with 30-b exponents containing 22 fractional bits. A factor of 118 reduction in table size compared to previous techniques is achieved for this example.</p>
INDEX TERMS
computer architecture; long word length numbers; logarithmic number system; addition; subtraction; lookup tables; linear approximation; nonlinear functions; design parameters; digital arithmetic; table lookup.
CITATION
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. 1325-1336, November 1990, doi:10.1109/12.61042
429 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool