Multipartite table methods

Florent de Dinechin 1 Arnaud Tisserand 1
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : 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/.
Document type :
Journal articles
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00542210
Contributor : Florent de Dinechin <>
Submitted on : Wednesday, December 1, 2010 - 11:16:29 PM
Last modification on : Thursday, February 7, 2019 - 2:25:11 PM
Long-term archiving on : Wednesday, March 2, 2011 - 3:22:40 AM

File

2005-TC-Multipartite.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : ensl-00542210, version 1

Collections

Citation

Florent de Dinechin, Arnaud Tisserand. Multipartite table methods. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2005, 54 (3), pp.319-330. ⟨ensl-00542210⟩

Share

Metrics

Record views

221

Files downloads

697