Table-based polynomials for fast hardware function evaluation

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

Volumn , Issue , 2005, Pages 328-333

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

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADDERS; APPROXIMATION THEORY; COMPUTER HARDWARE; FIELD PROGRAMMABLE GATE ARRAYS; MATHEMATICAL MODELS; POLYNOMIALS;

BIPARTITE METHODS; HARDWARE FUNCTIONS; MULTIPARTITE METHODS; TABLE-BASED POLYNOMIALS;

TABLE LOOKUP;

EID: 24944528460     PISSN: 10636862     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. J. Cao, B. Wei, and J. Cheng. High-performance architectures for elementary function generation. In N. Burgess and L. Ciminiera, editors, 15th IEEE Symposium on Computer Arithmetic, Vail, Colorado, June 2001.
2. D. Das Sarma and D. Matula. Faithful bipartite ROM reciprocal tables. In S. Knowles and W. McAllister, editors, 12th IEEE Symposium on Computer Arithmetic, pages 1728, Bath, UK, 1995. IEEE Computer Society Press.
3. D. Das Sarma and D. Matula. Faithful interpolation in reciprocal tables. In 13th IEEE Symposium on Computer Arithmetic, pages 82-91, Asilomar, California, July 1997.
4. F. de Dinechin and A. Tisserand. Some improvements on multipartite table methods. In N. Burgess and L. Ciminiera, editors, 15th IEEE Symposium on Computer Arithmetic, pages 128-135, Vail, Colorado, June 2001. Updated version of LIP research report 2000-38.
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, Oct. 2003.
6. J. Detrey and F. de Dinechin. Second order function approximation using a single multiplication on FPGAs. In 14th Intl Conference on Field-Programmable Logic and Applications, pages 221-230, Antwerp, Belgium, Aug. 2004. LNCS 3203.
7. P. M. Farmwald. High bandwidth evaluation of elementary functions. In K. S. Trivedi and D. E. Atkins, editors, Proceedings of the 5th IEEE Symposium on Computer Arithmetic. IEEE Computer Society Press, Los Alamitos, CA, 1981.
8. V. Jain and L. Lin. High-speed double precision computation of nonlinear functions. In 12th IEEE Symposium on Computer Arithmetic, pages 107-114, Bath, England, UK, July 1995.
9. 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.
10. J.-M. Muller. Elementary Functions, Algorithms and Implementation. Birkhauser, Boston, 1997.
11. J.-M. Muller. A few results on table-based methods. Reliable Computing, 5(3):279-288, 1999.
12. J. Piñeiro and J. Bruguera. High-speed double-precision computation of reciprocal, division, square root, and inverse square root. IEEE Transactions on Computers, 51(12):1377-1388, Dec. 2002.
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 N. Burgess and L. Ciminiera, editors, 15th IEEE Symposium on Computer Arithmetic, pages 40-47, Vail, Colorado, June 2001.
14. J. Stine and M. Schulte. The symmetric table addition method for accurate function approximation. Journal of VLSI Signal Processing, 21(2): 167-177, 1999.
15. N. Takagi. Powering by a table look-up and a multiplication with operand modification. IEEE Transactions on Computers, 47(11): 1216-1222, Nov. 1998.