Skip to Main content Skip to Navigation
Journal articles

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
Document type :
Journal articles
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Florent de Dinechin Connect in order to contact the contributor
Submitted on : Wednesday, December 1, 2010 - 11:16:29 PM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM
Long-term archiving on: : Wednesday, March 2, 2011 - 3:22:40 AM


Publisher files allowed on an open archive


  • HAL Id : ensl-00542210, version 1



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⟩



Record views


Files downloads