Results 1 - 10 of 4,436

The Interval Logarithmic Number System

by Mark G. Arnold, Jesus Garcia, Michael J. Schulte - Proceedings of the 9th IEEE Symposium on Computer Arithmetic , 1989
"... 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 Poi ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
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

The Denormal Logarithmic Number System

by Mark G. Arnold, Sylvain Collange , 2013
"... Abstract—Economical hardware often uses a FiXed-point Number System (FXNS), whose constant absolute precision is acceptable for many signal-processing algorithms. The almostconstant relative precision of the more expensive Floating-Point (FP) number system simplifies design, for example, by eliminat ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
, 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

Geometric-Mean Interpolation for Logarithmic Number Systems

by Mark Arnold - In Proc. of the International Symposium on Circuits and Systems , 2004
"... 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). ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
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).

GEOMETRIC-MEAN INTERPOLATION FOR LOGARITHMIC NUMBER SYSTEMS

by unknown authors
"... 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. ..."
Abstract - Add to MetaCart
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.

A Serial Logarithmic Number System ALU

by Mark G. Arnold
"... 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 that c ..."
Abstract - Add to MetaCart
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

Bipartite Implementation of the Residue Logarithmic Number System

by Mark G. Arnold , Jie Ruan
"... 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-carry bina ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
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

Digital Filtering Using the Multidimensional Logarithmic Number System

by V. S. Dimitrov, G. A. Jullien, K. Walus
"... 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 and ..."
Abstract - Add to MetaCart
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

A GPU Implementation of the Complex Logarithmic Number System

by Panagiotis Vouzis, Mark Arnold
"... 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 diffe ..."
Abstract - Add to MetaCart
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

Algorithms for Quantum Computation: Discrete Logarithms and Factoring

by Peter W. Shor , 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in com-putation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken into consider ..."
Abstract - Cited by 1111 (5 self) - Add to MetaCart
into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their compu-tational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number

An algorithm for finding best matches in logarithmic expected time

by Jerome H. Friedman, Jon Louis Bentley, Raphael Ari Finkel - ACM Transactions on Mathematical Software , 1977
"... 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 of recor ..."
Abstract - Cited by 764 (2 self) - Add to MetaCart
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
Results 1 - 10 of 4,436