Approximating functions for embedded and ASIC applications

Often embedded programmers and application specific integrated circuit (ASIC) designers are frustrated by the inability to realize near floating-point accuracy. in a fixed-point application. The problem is not limited to function approximation but also impacts FIR filter design. In this paper we examine the problem of approximating a known function on a closed interval and show that a genetic algorithm (GA) may be used to obtain results superior to those obtained by implementing floating-point algorithms, such as Taylor series and Chebyshev polynomials, in fixed-point directly.

[1]  L. A. G. Dresel,et al.  Elementary Numerical Analysis , 1966 .

[2]  Jarno M. A. Tanskanen,et al.  Round-off error free fixed-point design of polynomial FIR predictors , 1999, Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020).

[3]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  James William Hauser,et al.  Approximation of Nonlinear Functions for Fixed-Point and ASIC Applications Using a Genetic Algorithm , 2001 .

[6]  J. W. Hauser,et al.  Sensor data processing using genetic algorithms , 2000, Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems (Cat.No.CH37144).

[7]  Samuel D. Conte,et al.  Elementary Numerical Analysis , 1980 .

[8]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .