Constant and power-of-2 segmentation algorithms for a high speed numerical function generator
Valenzuela, Zaldy M.
Butler, Jon T.
Pace Phillip E.
MetadataShow full item record
The realization of high-speed numeric computation is a sought-after commodity for real world applications, including high-speed scientific computation, digital signal processing, and embedded computers. An example of this is the generation of elementary functions, such as sin( ) x , x e and log( ) x . Sasao, Butler and Reidel [Ref. 1] developed a high speed numeric function generator using a look-up table (LUT) cascade. Their method used a piecewise linear segmentation algorithm to generate the functions [Ref. 1]. In this thesis, two alternative segmentation algorithms are proposed and compared to the results of Sasao, Butler and Reidel [Ref.1]. The first algorithm is the Constant Approximation. This algorithm uses lines of slope zero to approximate a curve. The second algorithm is the power-of-2-approximation. This method uses 2i x to approximate a curve. The constant approximation eliminates the need for a multiplier and adder, while the power-of-2-approximations eliminates the need for multiplier, thus improving the computation speed. Tradeoffs between the three methods are examined. Specifically, the implementation of the piecewise linear algorithm requires the most amount of hardware and is slower than the other two. The advantage that it has is that it yields the least amount of segments to generate a function. The constant approximation requires the most amount of hardware to realize a function, but is the fastest implementation. The power-of-2 approximation is an intermediate choice that balances speed and hardware requirements.
Showing items related by title, author, creator and subject.
Mack, Thomas J. (Monterey California. Naval Postgraduate School, 2007-03);Certain methods of realizing numeric functions, such as sin(x) or x , in hardware involve a Taylor Series expansion or the CORDIC algorithm. These methods, while precise, are iterative and slow and may take on the order ...
Knudstrup, Timothy A. (Monterey, California. Naval Postgraduate School, 2007-12);Numeric Function Generators (NFGs) have allowed computation of difficult mathematical functions in less time and with less hardware than commonly employed methods. They compute piecewise linear (or quadratic) approximations ...
E. Polak; Royset, J.O. (2008);We consider a class of stochastic nonlinear programs for which an approximation to a locally optimal solution is speci_ed in terms of a fractional reduction of the initial cost error. We show that such an approximate ...