This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multipartite Table Methods
March 2005 (vol. 54 no. 3)
pp. 319-330
A unified view of most previous table-lookup-and-addition methods (bipartite tables, SBTM, STAM, and multipartite methods) is presented. This unified view allows a more accurate computation of the error entailed by these methods, which enables a wider design space exploration, leading to tables smaller than the best previously published ones by up to 50 percent. The synthesis of these multipartite architectures on Virtex FPGAs is also discussed. Compared to other methods involving multipliers, the multipartite approach offers the best speed/area tradeoff for precisions up to 16 bits. A reference implementation is available at www.ens-lyon.fr/LIP/Arenaire/.

[1] D. Das Sarma and D. Matula, “Faithful Bipartite ROM Reciprocal Tables,” Proc. 12th IEEE Symp. Computer Arithmetic, S. Knowles and W. McAllister, eds., pp. 17-28, 1995.
[2] H. Hassler and N. Takagi, “Function Evaluation by Table Look-Up and Addition,” Proc. 12th IEEE Symp. Computer Arithmetic, S. Knowles and W. McAllister, eds., pp. 10-16, 1995.
[3] M. Schulte and J. Stine, “Approximating Elementary Functions with Symmetric Bipartite Tables,” IEEE Trans. Computers, vol. 48, no. 8, pp. 842-847, Aug. 1999.
[4] J. Stine and M. Schulte, “The Symmetric Table Addition Method for Accurate Function Approximation,” J. VLSI Signal Processing, vol. 21, no. 2, pp. 167-177, 1999.
[5] J.-M. Muller, “A Few Results on Table-Based Methods,” Reliable Computing, vol. 5, no. 3, pp. 279-288, 1999.
[6] J.-M. Muller, Elementary Functions, Algorithms and Implementation. Boston: Birkhauser, 1997.
[7] C. Iordache and D.W. Matula, “Analysis of Reciprocal and Square Root Reciprocal Instructions in the AMD K6-2 Implementation of 3DNow!” Electronic Notes in Theoretical Computer Science, vol. 24, 1999.
[8] J. Detrey and F. de Dinechin, “A VHDL Library of LNS Operators,” Proc. 37th Asilomar Conf. Signals, Systems, and Computers, Oct. 2003.
[9] F. de Dinechin and A. Tisserand, “Some Improvements on Multipartite Table Methods,” Proc. 15th IEEE Symp. Computer Arithmetic, N. Burgess and L. Ciminiera, eds., pp. 128-135, June 2001.
[10] D. Matula, “Improved Table Lookup Algorithms for Postscaled Division,” Proc. 15th IEEE Symp. Computer Arithmetic, N. Burgess and L. Ciminiera, eds., pp. 101-108, June 2001.
[11] F.J. Taylor, R. Gill, J. Joseph, and J. Radke, “A 20 Bit Logarithmic Number System Processor,” IEEE Trans. Computers, vol. 37, no. 2, Feb. 1988.
[12] D.M. Lewis, “An Architecture for Addition and Subtraction of Long Word Length Numbers in the Logarithmic Number System,” IEEE Trans. Computers, vol. 39, no. 11, Nov. 1990.
[13] J.N. Coleman and E.I. Chester, “Arithmetic on the European Logarithmic Microprocessor,” IEEE Trans. Computers, vol. 49, no. 7, pp. 702-715, July 2000.
[14] B. Lee and N. Burgess, “A Dual-Path Logarithmic Number System Addition/Subtraction Scheme for FPGA,” Proc. Field-Programmable Logic and Applications, Sept. 2003.
[15] W. Wong and E. Goto, “Fast Evaluation of the Elementary Functions in Single Precision,” IEEE Trans. Computers, vol. 44, no. 3, pp. 453-457, Mar. 1995.
[16] D. Defour, F. de Dinechin, and J.-M. Muller, “A New Scheme for Table-Based Evaluation of Functions,” Proc. 36th Asilomar Conf. Signals, Systems, and Computers, Nov. 2002.
[17] J.A. Piñeiro, J.D. Bruguera, and J.-M. Muller, “Faithful Powering Computation Using Table Look-Up and a Fused Accumulation Tree,” Proc. 15th IEEE Symp. Computer Arithmetic, N. Burgess and L. Ciminiera, eds., pp. 40-47, June 2001.
[18] Sine/Cosine Lookup Table V4.2, Xilinx Corp., Nov. 2002, www. xilinx.comipcenter/.
[19] F. de Dinechin and J. Detrey, “Multipartite Tables in Jbits for the Evaluation of Functions on FPGAs,” Proc. IEEE Reconfigurable Architecture Workshop, Int'l Parallel and Distributed Symp., Apr. 2002.

Index Terms:
Computer arithmetic, elementary function evaluation, hardware operator, table lookup and addition method.
Citation:
Florent de Dinechin, Arnaud Tisserand, "Multipartite Table Methods," IEEE Transactions on Computers, vol. 54, no. 3, pp. 319-330, March 2005, doi:10.1109/TC.2005.54
Usage of this product signifies your acceptance of the Terms of Use.