Look-up table and breakpoints determination for piecewise linear approximation functions using evolutionary computation

Am -Piecewise linear approximalion of nonlinear funclions is a viable design approach for embedded systems withoutfloatingpoint capabilities. In this work, we propose a new procedure for determining the breakpoints posirions and minimam memory necessary for solving this approximation problem, which meets the design's specification accuracy. The LUT memory size is minimized by using a lopdown searching algorithm, which Iries to find a solution for each pair of breakpoints storing resolution and number of breakpoints. An evolutionary algorithm is employed at lhe boaom level for searching the breakpoints positions, considering relevant practical issues. The proposed procedure optimizes the solufion w.r.f the LUT size and breakpoints distribution

[1]  Leon O. Chua,et al.  Canonical piecewise-linear modeling , 1986 .

[2]  Thomas Bäck,et al.  Evolutionary computation: an overview , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[3]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

[4]  Danny Z. Chen,et al.  Efficient algorithms for orthogonal polygon approximation , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[5]  John N. Lygouras.  Memory reduction in look-up tables for fast symmetric function generators , 1999, IEEE Trans. Instrum. Meas..

[6]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[7]  Osvaldo R. Saavedra,et al.  Constraints definition and evaluation of piecewise polynomial approximation functions for embedded systems , 2002, IMTC/2002. Proceedings of the 19th IEEE Instrumentation and Measurement Technology Conference (IEEE Cat. No.00CH37276).

[8]  Daniele Marioli,et al.  Application of an optimal look-up table to sensor data processing , 1999, IEEE Trans. Instrum. Meas..

[9]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[10]  G. Manis,et al.  Optimal piecewise linear approximation of digitized curves , 1997, Proceedings of 13th International Conference on Digital Signal Processing.

[11]  Alfredo C. Desages,et al.  Canonical piecewise-linear approximation of smooth functions , 1998 .