Small FPGA polynomial approximations with 3-bit coefficients and low-precision estimations of the powers of x

Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors

Volumn , Issue , 2005, Pages 334-339

  Michard, Romain ^a   Tisserand, Arnaud ^a   Veyrat Charvillon, Nicolas ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

3-BIT COEFFICIENTS; LOW AVERAGE ERROR; LOW-PRECISION ESTIMATIONS;

MATHEMATICAL OPERATORS; POLYNOMIAL APPROXIMATION; SIGNAL PROCESSING;

FIELD PROGRAMMABLE GATE ARRAYS;

EID: 24944584248     PISSN: 10636862     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASAP.2005.59     Document Type: Conference Paper

References (12)

1. F. de Dinechin and A. Tisserand. Some improvements on multipartite tables methods. IEEE Transactions on Computers, 54(3):319-330, March 2005.
2. J. Detrey and F. de Dinechin. Second order function approximation using a single multiplication on FPGAs. In 14th International Conference on Field-Programmable Logic and Applications, pages 221-230. LNCS 3203, August 2004.
3. M. D. Ercegovac and T. Lang. Digital Arithmetic. Morgan Kaufmann, 2003.
4. M.D. Ercegovac, T. Lang, J.-M. Muller, and A. Tisserand. Reciprocation, square root, inverse square root, and some elementary functions using small multipliers. IEEE Transactions on Computers, 49(7):627-637, July 2000.
5. H. Hassler and N. Takagi. Function evaluation by table look-up and addition. In S. Knowles and W.H. McAllister, editors, 12th IEEE Symposium on Computer Arithmetic, pages 10-16. IEEE CS, July 1995.
6. A. A. Liddicoat and M. J. Flynn. Parallel square and cube computations. In 34th Asilomar Conference on Signals, Systems, and Computers, pages 1325-1329. IEEE, October 2000.
7. J.-M. Muller. Elementary Functions: Algorithms and Implementation. Birkhäuser, Boston, 1997.
8. J. A. Pineiro, J. D. Bruguera, and J.-M. Muller. Faithful powering computation using table look-up and a fused accumulation tree. In Proceedings of the 15th IEEE Symposium on Computer Arithmetic, pages 40-47. IEEECS, June 2001.
9. E. Remes. Sur un procédé convergent d'approximations successives pour déterminer les polynômes d'approximation. C.R. Acad. Sci. Paris, 198:2063-2065, 1934.
10. M. Schulte and J. Stine. Approximating elementary functions with symmetric bipartite tables. IEEE Transactions on Computers, 48(8):842-847, August 1999.
11. D. A. Sunderland, R. A. Strauch, S. S. Wharfield, H. T. Peterson, and C. R. Role. CMOS/SOS frequency synthesizer LSI circuit for spread spectrum communications. IEEE Journal of Solid State Circuit, 19(4):497-506, August 1984.
12. N. Takagi. Powering by a table look-up and a multiplication with operand modification. IEEE Transactions on Computers, 47(11):1216-1222, 1998.