Multipartite table methods - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Computers Year : 2005

Multipartite table methods

(1) , (1)
1
Florent de Dinechin
Arnaud Tisserand

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/.
Fichier principal
Vignette du fichier
2005-TC-Multipartite.pdf (1.14 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

ensl-00542210 , version 1 (01-12-2010)

Identifiers

  • HAL Id : ensl-00542210 , version 1

Cite

Florent de Dinechin, Arnaud Tisserand. Multipartite table methods. IEEE Transactions on Computers, 2005, 54 (3), pp.319-330. ⟨ensl-00542210⟩
98 View
941 Download

Share

Gmail Facebook Twitter LinkedIn More