Logarithmic number system

Overview

A number, $X$ , is represented in an LNS by two components: the logarithm ( $x$ ) of its absolute value (as a binary word usually in two's complement), and its sign bit ( $s$ ):

X \to {\begin{cases} x = \log_{b} | X |, \\ s = {\begin{cases} 0 if X > 0, \\ 1 if X < 0. \end{cases} \end{cases}

An LNS can be considered as a floating-point number with the significand being always equal to 1 and a non-integer exponent. This formulation simplifies the operations of multiplication, division, powers and roots, since they are reduced down to addition, subtraction, multiplication, and division, respectively.

On the other hand, the operations of addition and subtraction are more complicated and are calculated by the formulae

\log_{b} (| X | + | Y |) = x + s_{b} (y - x),

\log_{b} | | X | - | Y | | = x + d_{b} (y - x),

where the "sum" function is defined by $s_{b} (z) = \log_{b} (1 + b^{z})$ , and the "difference" function by $d_{b} (z) = \log_{b} | 1 - b^{z} |$ . These functions $s_{b} (z)$ and $d_{b} (z)$ 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 an LNS primarily for increasing the precision of floating-point math operations.

2 more chapters are free with a Lably account.

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.

Nicholas Kingsbury and Peter Rayner introduced "logarithmic arithmetic" for digital signal processing (DSP) in 1971.

A similar LNS named "signed logarithmic number system" (SLNS) was described in 1975 by Earl Swartzlander and Aristides Alexopoulos; rather than use two's complement notation for the logarithms, they offset them (scale the numbers being represented) to avoid negative logs.

Samuel Lee and Albert Edgar described a similar system, which they called the "Focus" number system, in 1977.

The mathematical foundations for addition and subtraction in an LNS trace back to Zecchini Leonelli and Carl Friedrich Gauss in the early 1800s.

Applications

In the 1890s, the Spanish engineer Leonardo Torres Quevedo conceived a series of analogue calculating mechanical machines and developed one that could solve algebraic equations with eight terms, finding the roots, including the complex ones. One part of this machine called an "endless spindle" allowed the mechanical expression of the relation $y = \log (1 + 10^{x})$ , with the aim of extracting the logarithm of a sum as a sum of logarithms.

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

A substantial effort to explore the applicability of LNSs 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). A fabricated prototype of the processor, which has a 32-bit cotransformation-based LNS arithmetic logic unit (ALU), demonstrated LNSs as a "more accurate alternative to floating-point", with improved speed. Further improvement of the LNS design based on the ELM architecture has shown its capability to offer significantly higher speed and accuracy than floating-point as well.

LNSs are sometimes used in FPGA-based applications where most arithmetic operations are multiplication or division.

Overview

History

Applications

More in Computing and communication