Second order function approximation using a single multiplication on FPGAs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3203, Issue , 2004, Pages 221-230

  Detrey, Jérémie ^a   De Dinechin, Florent ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHEBYSHEV APPROXIMATION; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); TABLE LOOKUP;

CRITICAL PATHS; ELEMENTARY FUNCTION; FIRST ORDER; FUNCTION APPROXIMATION; HARDWARE EVALUATIONS; MINIMAX APPROXIMATION; SECOND ORDERS; TABLE SIZE;

FUNCTION EVALUATION;

EID: 35048871053     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30117-2_24     Document Type: Article

References (15)

1. J. Cao, B.W.Y. Wei, and J. Cheng. High-performance architectures for elementary function generation. In Neil Burgess and Luigi Ciminiera, editors, 15th IEEE Symposium on Computer Arithmetic, Vail, Colorado, June 2001.
2. D. Das Sarma and D.W. Matula. Faithful bipartite ROM reciprocal tables. In S. Knowles and W.H. McAllister, editors, 12th IEEE Symposium on Computer Arithmetic, pages 17-28, Bath, UK, 1995. IEEE Computer Society Press.
3. F. de Dinechin and A. Tisserand. Some improvements on multipartite table methods. In Neil Burgess and Luigi Ciminiera, editors, 15th IEEE Symposium on Computer Arithmetic, pages 128-135, Vail, Colorado, June 2001. Updated version of LIP research report 2000-38.
4. D. Defour, F. de Dinechin, and J.M. Muller. A new scheme for table-based evaluation of functions. In 36th Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, California, November 2002.
5. J. Detrey and F. de Dinechin. A VHDL library of LNS operators. In 37th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, USA, October 2003.
6. 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, Bath, UK, 1995. IEEE Computer Society Press.
7. D-U Lee, W. Luk, J. Villasenor, and P. Cheung. Hierarchical segmentation schemes for function evaluation. In IEEE Conference on Field-Programmable Technology, Tokyo, dec 2003.
8. D.M. Lewis. Interleaved memory function interpolators with application to an accurate LNS arithmetic unit. IEEE Transactions on Computers, 43(8):974-982, August 1994.
9. A.A. Liddicoat. High-performance arithmetic for division and the elementary functions. PhD thesis, Stanford University, 2002.
10. O. Mencer, N. Boullis, W. Luk, and II. Styles. Parametrized function evaluation on fpgas. In Field-Programmable Logic and Applications, Belfast, September 2001.
11. J.M. Muller. Elementary Functions, Algorithms and Implementation. Birkhauser, Boston, 1997.
12. J.M. Muller. A few results on table-based methods. Reliable Computing, 5(3):279-288, 1999.
13. J. A. Piñeiro, J. D. Bruguera, and J.-M. Muller. Faithful powering computation using table look-up and a fused accumulation tree. In Neil Burgess and Luigi Ciminiera, editors, 15th IEEE Symposium on Computer Arithmetic, pages 40-47, Vail, Colorado, June 2001.
14. J.E. Stine and M.J. Schulte. The symmetric table addition method for accurate function approximation. Journal of VLSI Signal Processing, 21(2):167-177, 1999.
15. S. Vassiliadis, M. Zhang, and J. G. Delgado-Frias. Elementary function generators for neural-network emulators. IEEE transactions on neural networks, 11(6):1438-1449, nov 2000.