Hierarchical segmentation schemes for function evaluation

Abstract

This paper presents a method for evaluating functions based on piecewise polynomial approximation with a novel hierarchical segmentation scheme. The use of a novel hierarchy scheme of uniform segments and segments with size varying by powers of two enables us to approximate nonlinear regions of a function particularly well. This partitioning is automated: efficient look-up tables and their coefficients are generated for a given function, input range, order of the polynomials, desired accuracy and finite precision constraints. We describe an algorithm to find the optimum number of segments and the placement of their boundaries, which is used to analyze the properties of a function and to benchmark our approach. Our method is illustrated using three non-linear compound functions, √ − log(x), x log(x) and a high order rational function. We present results for various operand sizes between 8 and 24 bits for first and second order polynomial approximations.

DOI: 10.1109/FPT.2003.1275736

Extracted Key Phrases

11 Figures and Tables

Statistics

01020'04'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

99 Citations

Semantic Scholar estimates that this publication has 99 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Lee2003HierarchicalSS, title={Hierarchical segmentation schemes for function evaluation}, author={Dong-U Lee and Wayne Luk and John D. Villasenor and Peter Y. K. Cheung}, booktitle={FPT}, year={2003} }