A bit-width optimization methodology for polynomial-based function evaluation

25Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an automated bit-width optimization methodology for polynomial-based hardware function evaluation. Due to the analytical nature of the approach, overflow protection and precision accurate to one unit in the last place (ulp) can be guaranteed. A range analysis technique based on computing the root of the derivative of a signal is utilized to determine the minimal number of integer bits. Fractional bit requirements are established using an analytical error expression derived from the functions that occur along the data path. Global fractional bit optimization across multiple computation stages is performed using simulated annealing and circuit area estimation functions. © 2007 IEEE.

Cite

CITATION STYLE

APA

Lee, D. U., & Villasenor, J. D. (2007). A bit-width optimization methodology for polynomial-based function evaluation. IEEE Transactions on Computers, 56(4), 567–571. https://doi.org/10.1109/TC.2007.1013

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free