Piecewise polynomial approximation with reducedtable bit-width and guaranteed accuracy

Authors

  • Sergey Salishev

Keywords:

piecewise polynomial approximation, interpolation, Lebesgue numbers, RTL synthesis

Abstract

An improvement to the piecewise polynomial approximation in hardware is proposed. A new error bound is given for the low-order polynomial interpolation with pointwise constraints ona uniform grid. A method of table size reduction and near optimal quantization of coefficients using intersegment constraints and mixed integer programmingwith guaranteed accuracy is proposed.A case study shows up to 60% table size reduction compared to unconstrained polynomials. Gate level RTL synthesis shows that table reduction has noticeable impact on the design area.

Downloads

Published

2012-10-31

Issue

Section

Hardware Platform Development

How to Cite

[1]
“Piecewise polynomial approximation with reducedtable bit-width and guaranteed accuracy”, Comput. Tools Educ., no. 5, Oct. 2012, Accessed: Oct. 24, 2026. Available: http://cte.eltech.ru/ojs/index.php/kio/article/view/1318

Most read articles by the same author(s)