Symmetric level-index arithmetic

Template:Short description Template:Use dmy dates The level-index (LI) representation of numbers, and its algorithms for arithmetic operations, were introduced by Charles Clenshaw and Frank Olver in 1984.

The symmetric form of the LI system and its arithmetic operations were presented by Clenshaw and Peter Turner in 1987.

Michael Anuta, Daniel Lozier, Nicolas Schabanel and Turner developed the algorithm for symmetric level-index (SLI) arithmetic, and a parallel implementation of it. There has been extensive work on developing the SLI arithmetic algorithms and extending them to complex and vector arithmetic operations.

Definition

The idea of the level-index system is to represent a non-negative real number Template:Mvar as

$X=e^{e^{e^{{\cdots }^{e^f}}}},$

where $0\le f<1$, and the process of exponentiation is performed Template:Mvar times, with $\ell \ge 0$. Template:Mvar and Template:Mvar are the level and index of Template:Mvar respectively. Template:Math is the LI image of Template:Mvar. For example,

$X=1234567=e^{e^{e^{0.9711308}}},$

so its LI image is

$x=\ell +f=3+0.9711308=3.9711308.$

The symmetric form is used to allow negative exponents, if the magnitude of Template:Mvar is less than 1. One takes Template:Math or Template:Math and stores it (after substituting +1 for 0 for the reciprocal sign; since for Template:Math the LI image is Template:Math and uniquely defines Template:Math, we can do away without a third state and use only one bit for the two states −1 and +1Template:Clarify) as the reciprocal sign Template:Mvar. Mathematically, this is equivalent to taking the reciprocal (multiplicative inverse) of a small-magnitude number, and then finding the SLI image for the reciprocal. Using one bit for the reciprocal sign enables the representation of extremely small numbers.

A sign bit may also be used to allow negative numbers. One takes sgn(X) and stores it (after substituting +1 for 0 for the sign; since for Template:Math the LI image is Template:Math and uniquely defines Template:Math, we can do away without a third state and use only one bit for the two states −1 and +1Template:Clarify) as the sign Template:Mvar. Mathematically, this is equivalent to taking the inverse (additive inverse) of a negative number, and then finding the SLI image for the inverse. Using one bit for the sign enables the representation of negative numbers.

The mapping function is called the generalized logarithm function. It is defined as

$\psi (X)=\{\begin{array}{cc}X& \text{if }0\le X<1,\\ 1+\psi (\ln X)& \text{if }X\ge 1,\end{array}$

and it maps $[0,\mathrm{\infty })$ onto itself monotonically, thus being invertible on this interval. The inverse, the generalized exponential function, is defined by

$\phi (x)=\{\begin{array}{cc}x& \text{if }0\le x<1,\\ e^{\phi (x-1)}& \text{if }x\ge 1.\end{array}$

The density of values Template:Mvar represented by Template:Mvar has no discontinuities as we go from level Template:Mvar to Template:Math (a very desirable property) since

${\frac{d\phi (x)}{dx}|}_{x=1}={\frac{d\phi (e^x)}{dx}|}_{x=0}.$

The generalized logarithm function is closely related to the iterated logarithm used in computer science analysis of algorithms.

Formally, we can define the SLI representation for an arbitrary real Template:Mvar (not 0 or 1) as

$X=s_X\phi (x{)}^{r_X},$

where Template:Mvar is the sign (additive inversion or not) of Template:Mvar, and Template:Mvar is the reciprocal sign (multiplicative inversion or not) as in the following equations:

$s_X=\mathrm{sgn}(X),r_X=\mathrm{sgn}(|X|-|X{|}^{-1}),x=\psi (\max (|X|,|X{|}^{-1}\left)\right)=\psi (|X{|}^{r_X}),$

whereas for Template:Mvar = 0 or 1, we have

$s_0=+1,r_0=+1,x=0.0,$

$s_1=+1,r_1=+1,x=1.0.$

For example,

$X=-\frac{1}{1234567}=-e^{-e^{e^{0.9711308}}},$

and its SLI representation is

$x=-\phi (3.9711308{)}^{-1}.$

See also

• Tetration
• Floating point (FP)
• Tapered floating point (TFP)
• Logarithmic number system (LNS)
• Level (logarithmic quantity)

Further reading

• Template:Cite journal
• Template:Cite journal
• Template:Cite web [1]
• Template:Cite journal [2]. Also reprinted in: Template:Cite book

External links

• sli-c-library (hosted by Google Code), "C++ Implementation of Symmetric Level-Index Arithmetic".