Issue No. 03 - March (2005 vol. 54)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2005.54
Florent de Dinechin , IEEE
Arnaud Tisserand , IEEE
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/.
Computer arithmetic, elementary function evaluation, hardware operator, table lookup and addition method.
Florent de Dinechin, Arnaud Tisserand, "Multipartite Table Methods", IEEE Transactions on Computers, vol. 54, no. , pp. 319-330, March 2005, doi:10.1109/TC.2005.54