This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Bit-Width Optimization Methodology for Polynomial-Based Function Evaluation
April 2007 (vol. 56 no. 4)
pp. 567-571
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.
Index Terms:
Computer arithmetic, elementary function approximation, field programmable gate arrays, finite wordlength effects, minimax approximation and algorithms.
Citation:
Dong-U Lee, John D. Villasenor, "A Bit-Width Optimization Methodology for Polynomial-Based Function Evaluation," IEEE Transactions on Computers, vol. 56, no. 4, pp. 567-571, April 2007, doi:10.1109/TC.2007.1013
Usage of this product signifies your acceptance of the Terms of Use.