Title :
Redundant logarithmic arithmetic
Author :
Arnold, Mark G. ; Bailey, Thomas A. ; Cowles, John R. ; Cupal, Jerry J.
Author_Institution :
Dept. of Comput. Sci., Wyoming Univ., Laramie, WY, USA
fDate :
8/1/1990 12:00:00 AM
Abstract :
A number system that offers advantages in some situations over conventional floating point and sign/logarithmic number systems is described. Redundant logarithmic arithmetic, like conventional logarithmic arithmetic, relies on table lookups to make the arithmetic unit simpler than an equivalent floating point unit. The cost of 32 bit subtraction in a redundant logarithmic number system is lower than previously published logarithmic subtraction methods. The total memory requirement for a 29-bit redundant logarithmic unit is 16 K words compared to 22 K words by the best previously published conventional sign logarithm unit, assuming similar addition techniques are employed. A redundant logarithmic number system can be implemented with online arithmetic, which would be impractical for a conventional sign logarithm number system. The disadvantages of redundant arithmetic are typical of redundant number systems. First, the redundancy doubles the storage requirements for data values. Second, the representation can become ill-conditioned, especially as a result of iterated multiplications. Third, division and square root operations are more difficult to implement in redundant logarithmic arithmetic
Keywords :
digital arithmetic; number theory; redundancy; table lookup; 29-bit redundant logarithmic unit; 32 bit subtraction; arithmetic unit; data values; division; ill-conditioned; iterated multiplications; memory requirement; online arithmetic; redundant logarithmic arithmetic; redundant logarithmic number system; square root; storage requirements; table lookups; Circuits; Computer errors; Computer science; Costs; Digital arithmetic; Floating-point arithmetic; Interpolation; Table lookup;
Journal_Title :
Computers, IEEE Transactions on