Logarithmic number system

From Infogalactic: the planetary knowledge core
Jump to: navigation, search
File:Gaussian logarithm.svg
The s_b(z) and d_b(z) functions.

A logarithmic number system (LNS) is an arithmetic system used for representing real numbers in computer and digital hardware, especially for digital signal processing.

Theory

In LNS, a number, X, is represented by the logarithm, x, of its absolute value as follows:

X\rightarrow\{s,x=\log_b(|X|)\},

where s is a bit denoting the sign of X (s=0 if X>0 and s=1 if X<0).

The number x is represented by a binary word which usually is in the two's complement format. LNS can be considered as a floating-point number with the significand being always equal to 1. This formulation simplifies the operations of multiplication, division, powers and roots, since they are reduced down to addition, subtraction, multiplication and division, respectively.

Gaussian logarithms

On the other hand, the operations of addition and subtraction are more complicated and they are calculated by the formula:

\log_b(|X|+|Y|)=x+s_b(z)
 \log_b(||X|-|Y||)=x+d_b(z),

where z=y-x is the difference between the logarithms of the operands, the "sum" function is s_b(z)=\log_b(1+b^z), and the "difference" function is d_b(z)=\log_b(|1-b^z|). These functions s_b(z) and d_b(z), depicted in the figures to the right, are also known as Gaussian logarithms. The simplification of multiplication, division, roots, and powers is counterbalanced by the cost of evaluating these functions for addition and subtraction. This added cost of evaluation may not be critical when using LNS primarily for increasing the precision of floating-point math operations.

History

Logarithmic number systems have been independently invented and published at least three times, as an alternative to fixed-point and floating-point number systems.[1]

Kingsbury and Rayner introduced "logarithmic arithmetic" for digital signal processing in 1971.[2]

A similar LNS was described in 1975 by Swartzlander and Alexopoulos; rather than use two's complement notation for the logarithms, they offset them (scale the numbers being represented) to avoid negative logs.[3]

Lee and Edgar described a similar system, which they called the "focus" number system, in 1977.[4]

The mathematical foundations for addition and subtraction in an LNS trace back to Carl Friedrich Gauss and Z. Leonelli.[5][6]

Applications

LNS has been used in the Gravity Pipe (GRAPE) special-purpose supercomputer[7] that won the Gordon Bell Prize in 1999.

A substantial effort to explore the applicability of LNS as a viable alternative to floating point for general-purpose processing of single-precision real numbers is described in the context of the European Logarithmic Microprocessor (ELM).[8] A fabricated prototype of the processor, which has a 32-bit cotransformation-based LNS arithmetic logic unit (ALU), demonstrated LNS as a "more accurate alternative to floating-point," with improved speed. Further improvement of the LNS design based on the ELM architecture has again shown its capability to offer significantly better in speed and more accurate than the floating-point.[9]

LNS is sometimes used in FPGA-based applications where most arithmetic operations are multiplication or division.[10]

See also

References

  1. Lua error in package.lua at line 80: module 'strict' not found.
  2. Lua error in package.lua at line 80: module 'strict' not found.
  3. Lua error in package.lua at line 80: module 'strict' not found.
  4. Lua error in package.lua at line 80: module 'strict' not found.
  5. Lua error in package.lua at line 80: module 'strict' not found.
  6. Lua error in package.lua at line 80: module 'strict' not found.
  7. Lua error in package.lua at line 80: module 'strict' not found.
  8. Lua error in package.lua at line 80: module 'strict' not found.
  9. Lua error in package.lua at line 80: module 'strict' not found.
  10. Lua error in package.lua at line 80: module 'strict' not found.

External links