A unified view of most previous table-lookup-and-addition methods (bipartite tables, SBTM,
STAM, and multipartite methods) is presented. This unified view allows a more accurate …

A table-based method for high-speed function approximation in single-precision floating-
point format is presented in this paper. Our focus is the approximation of reciprocal, square …

A new method for the high-speed computation of double-precision floating-point reciprocal,
division, square root, and inverse square root operations is presented in this paper. This …

An architecture for the computation of logarithm, exponential, and powering operations is
presented in this paper, based on a high-radix composite algorithm for the computation of …

Hardware simulation offers the potential of improving code evaluation speed by orders of
magnitude over workstation or PC-based simulation. We describe a hardware-based …

Many general table-based methods for the evaluation in hardware of elementary functions
have been published. The bipartite and multipartite methods implement a first-order …

Proves that the reliable computation of any Boolean function with sensitivity s requires/spl
Omega/(s log s) gates if the gates fail independently with a fixed positive probability. This …

This paper presents a technique for designing linear and quadratic interpolators for function
approximation using truncated multipliers and squarers. Initial coefficient values are found …

Polynomial approximations are almost always used when implementing functions on a
computing system. In most cases, the polynomial that best approximates (for a given …

Graphics processors require strong arithmetic support to perform computational kernels over
data streams. Because of the current implementation using the basic arithmetic operations …