Semi-Logarithmic Number Systems

Authors:
Jean-Michel Muller;Alexandre Scherbyna;Arnaud Tisserand
Affiliations:
CNRS, Lyon, France;State Technical Univ., Kiev, Ukraine;CNRS, Lyon, France
Venue:
IEEE Transactions on Computers
Year:
1998

Citing 7
Cited 2

On roundoff error distributions in floating point and logarithmic arithmetic

Computing
Floating-Point to Logarithmic Encoder Error Analysis

IEEE Transactions on Computers
What every computer scientist should know about floating-point arithmetic

ACM Computing Surveys (CSUR)
Overflow/Underflow-Free Floating-Point Number Representations with Self-Delimiting Variable-Length Exponent Field

IEEE Transactions on Computers - Special issue on computer arithmetic
Applying Aeatures of IEEE 754 to Sign/Logarithm Arithmetic

IEEE Transactions on Computers - Special issue on computer arithmetic
Computer Arithmetic I (Tutorial)

Computer Arithmetic I (Tutorial)
A 20 Bit Logarithmic Number System Processor

IEEE Transactions on Computers

Pipelined Computation of Very Large Word-Length LNS Addition/Subtraction with Polynomial Hardware Cost

IEEE Transactions on Computers - Special issue on computer arithmetic
Computer arithmetic and hardware: "off the shelf" microprocessors versus "custom hardware"

Theoretical Computer Science

Quantified Score

Hi-index	14.98

Visualization

Abstract

We present a new class of number systems, called Semi-Logarithmic Number Systems, that constitute a family of various compromises between floating-point and logarithmic number systems. This allows trade between the speed of the arithmetic operations and the size of the required tables. We give arithmetic algorithms (addition/subtraction, multiplication, division) for the Semi-Logarithmic Number Systems, and we compare these number systems to the classical floating-point or logarithmic number systems.