Hardwired polynomial evaluation
Journal of Parallel and Distributed Computing - Parallelism in Computer Arithmetic
The Mathematics of the Pentium Division Bug
SIAM Review
Approximating Elementary Functions with Symmetric Bipartite Tables
IEEE Transactions on Computers
IEEE Transactions on Computers - Special issue on computer arithmetic
A VLSI Algorithm for Computing the Euclidean Norm of a 3D Vector
IEEE Transactions on Computers
Advanced Computer Arithmetic Design
Advanced Computer Arithmetic Design
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
The Symmetric Table Addition Method for Accurate Function Approximation
Journal of VLSI Signal Processing Systems
Fast Evaluation of the Elementary Functions in Single Precision
IEEE Transactions on Computers
Function Evaluation by Table Look-up and Addition
ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
A Hardware Algorithm for Computing Reciprocal Square Root
ARITH '01 Proceedings of the 15th IEEE Symposium on Computer Arithmetic
Faithful Powering Computation Using Table Look-Up and a Fused Accumulation Tree
ARITH '01 Proceedings of the 15th IEEE Symposium on Computer Arithmetic
Automatic Evaluation of the Accuracy of Fixed-Point Algorithms
Proceedings of the conference on Design, automation and test in Europe
IEEE Transactions on Computers
Some Optimizations of Hardware Multiplication by Constant Matrices
IEEE Transactions on Computers
Table-based polynomials for fast hardware function evaluation
ASAP '05 Proceedings of the 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors
Computing machine-efficient polynomial approximations
ACM Transactions on Mathematical Software (TOMS)
Elementary Functions: Algorithms and Implementation
Elementary Functions: Algorithms and Implementation
A unified algorithm for elementary functions
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
On the number of segments needed in a piecewise linear approximation
Journal of Computational and Applied Mathematics
Function approximation based on estimated arithmetic operators
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Square-rich fixed point polynomial evaluation on FPGAs
Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arrays
| Hi-index | 0.00 |
This paper presents some recent works on hardware evaluation of functions. A method for the automatic generation of high-performance arithmetic operators based on polynomial approximations is described. It deals with the bit-level representation of the polynomial coefficients, the intermediate computations width, the approximation and the rounding errors. The generated operators are small, fast and numerically validated at design time. Some examples have been implemented on Field Programmable Gate Arrays (FPGAs).