Piecewise arithmetic expressions of numeric functions and their applicatio to design of numeric function generators
Butler, Jon T.
MetadataShow full item record
In this paper, we propose a new representation of numeric functions using a piecewise arithmetic expression. To represent a numeric function compactly, we partition the domain of the function into uniform segments, and transform the sub-function in each segment into an arithmetic spectrum. From this arithmetic spectrum, we derive an arithmetic expression, and obtain a piecewise arithmetic expression for the function. By using the piecewise arithmetic expression, we can increase the number of zero arithmetic coefficients significantly, and represent a numeric function more compactly than using a conventional single arithmetic expression. We also present an application of the piecewise arithmetic expression to design of numeric function generators (NFGs). Since the piecewise arithmetic expression has many zero coefficients and repeated coefficients, by storing only distinct nonzero coefficients in a table, we can significantly reduce the table size needed to store arithmetic coefficients. Experimental results show that the table size can be reduced to only a small percent of the table size needed to store all the arithmetic coefficients.
Showing items related by title, author, creator and subject.
Nagayama, Shinobu; Sasao, Tsutomu; Butler, Jon T. (2011-05);This paper proposes new architectures for numeric function generators (NFGs) using piecewise arithmetic expressions. The proposed architectures are programmable, and they realize a wide range of numeric functions. To ...
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 ...
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 ...