"Partially rounded" small-order approximations for accurate, hardware-oriented, table-based methods
- 22 March 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose order-1 coef.cients are small in size (a few bits only) can be computed. We compare the obtained results with similar work in the recent literature.Keywords
This publication has 12 references indexed in Scilit:
- Accurate function approximations by symmetric table lookup and additionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Symmetric bipartite tables for accurate function approximationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Faithful bipartite ROM reciprocal tablesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Some improvements on multipartite table methodsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Faithful powering computation using table look-up and a fused accumulation treePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The Birth of CordicJournal of Signal Processing Systems, 2000
- The Symmetric Table Addition Method for Accurate Function ApproximationJournal of Signal Processing Systems, 1999
- Approximating elementary functions with symmetric bipartite tablesIEEE Transactions on Computers, 1999
- A Few Results on Table-Based MethodsReliable Computing, 1999
- The CORDIC Trigonometric Computing TechniqueIRE Transactions on Electronic Computers, 1959