A new scheme for table-based evaluation of functions

This paper presents a new scheme for the hardware evaluation of functions in fixed-point format, for precisions up to 30 bits. This scheme yields an architecture made of four look-up tables, a multi-operand adder, and two small multipliers. This new method is evaluated and compared with other published methods.

[1]  Weng-Fai Wong,et al.  Fast Evaluation of the Elementary Functions in Single Precision , 1995, IEEE Trans. Computers.

[2]  Jean-Michel Muller,et al.  Elementary Functions: Algorithms and Implementation , 1997 .

[3]  Arnaud Tisserand,et al.  Some improvements on multipartite table methods , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[4]  Michael J. Schulte,et al.  The Symmetric Table Addition Method for Accurate Function Approximation , 1999, J. VLSI Signal Process..

[5]  Florent de Dinechin,et al.  Multipartite tables in jbits for the evaluation of functions on FPGAs , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[6]  Michael J. Flynn,et al.  High-performance floating point divide , 2001, Proceedings Euromicro Symposium on Digital Systems Design.

[7]  Debjit Das Sarma,et al.  Faithful bipartite ROM reciprocal tables , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[8]  Javier D. Bruguera,et al.  Faithful powering computation using table look-up and a fused accumulation tree , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[9]  Jean-Michel Muller.  A Few Results on Table-Based Methods , 1998, SCAN.

[10]  Naofumi Takagi,et al.  Function evaluation by table look-up and addition , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.