Look-up table and breakpoints determination for piecewise linear approximation functions using evolutionary computation
Sebastian Yuri Cavalcanti Catunda, Osvaldo Ronald Saavedra, J.V. FonsecaNeto, Marcos R. Morais · 2004
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