Optimisation d'opérateurs arithmétiques matériels à base d'approximations polynomiales

This article presents a method for the optimisation of hardware arithmetic operators dedicated to function evaluation using polynomial approximations. Using recent tools, the method reduces the size of the polynomial coefficients and the intermediate values while keeping the total error bounded (approximation and evaluation). It leads to small and fast operators with a good numerical quality. The method is illustrated on several examples implemented on FPGA circuits.

[1]  J. Muller Elementary Functions, Algorithms and Implementation, 2nd Edition , 2006 .

[2]  Daniel Ménard,et al.  Automatic evaluation of the accuracy of fixed-point algorithms , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[3]  N. Brisebarre,et al.  Sparse-coefficient polynomial approximations for hardware implementations , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[4]  Milos D. Ercegovac,et al.  Digital Arithmetic , 2003, Wiley Encyclopedia of Computer Science and Engineering.

[5]  L. Cordesses,et al.  Direct digital synthesis: a tool for periodic wave generation (part 1) , 2004, IEEE Signal Processing Magazine.

[6]  Arnaud Tisserand,et al.  Computing machine-efficient polynomial approximations , 2006, TOMS.

[7]  Jean-Michel Muller,et al.  Elementary Functions: Algorithms and Implementation , 1997 .