Abstract

One category of table-based arithmetic function evaluators is to partition the input interval into uniform segments of equal width where each segment is approximated by a polynomial. This paper presents a non-uniform segmentation method in order to reduce table size that usually increases rapidly with respect to precision. Our approach employs a bottom-up approach that merges neighbouring uniform segments obtained in conventional piecewise polynomial interpolation. The proposed non-uniform segmentation scheme is applied to computing some elementary functions under different bit accuracies. Analytical comparison and experiential results show that the proposed method leads to smaller table size compared with other previous methods due to the efficient segmentation algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.