System (ILNS), in which the Logarithmic Number System (LNS) is used as the underlying number system for interval arithmetic. The basic operations in ILNS are introduced and an efficient method for performing ILNS addition and subtraction is presented. The paper compares ILNS to Interval Floating

, by eliminating worries about FXNS overflow because the range of FP is much larger than FXNS for the same wordsize; however, primitive FP introduces another problem: underflow. The conventional Signed Logarithmic Number System (SLNS) offers similar range and precision as FP with much better performance (in terms

A new hardware implementation of linear-Lagrange interpolation is proposed where the interpolation line is approximated as the geometric mean of the slopes at the endpoints of the interpolation interval. The geometric mean is easy to compute using the Logarithmic Number System (LNS).

A new hardware implementation of linear-Lagrange interpolation is proposed where the interpolation line is approximated as the geometric mean of the slopes at the endpoints of the interpolation interval. The geometric mean is easy to compute using the Logarithmic Number System (LNS). 1.

Serial arithmetic uses less hardware than parallel arithmetic. Serial floating point (FP) is slower than parallel FP. The Logarithmic Number System (LNS) simplifies operations, but a fast serial implementation of LNS has never been proposed previously. This paper presents a fast bitserial LNS

The Logarithmic Number System (LNS) has area and power advantages over fixed-point and floating-point number systems in some applications that tolerate moderate precision. LNS multiplication/division require only addition/subtraction of logarithms. Normally, LNS is implemented with ripple

We introduce the use of multidimensional logarithmic number system (MDLNS) as a generalization of the classical 1-D logarithmic number system (LNS) and analyze its use in DSP applications. The major drawback of the LNS is the requirement to use very large ROM arrays in implementing the additions

Abstract — In this paper we present a technique to implement the Complex Logarithmic Number System (CLNS) on a Graphics Processing Unit (GPU). Although CLNS multiplication is a simple FP addition, CLNS addition involves evaluations of transcendental functions, which can be carried out in a few

into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their computational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number

An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record. The computation required to organize the file is proportional to kNlogN. The expected number