8485 articles  [version française]

inria-00072577, version 1

Some Improvements on Multipartite Table Methods

Florent De Dinechin () 1, Arnaud Tisserand () a, 1

N° RR-4059 (2000)

Abstract: This paper presents an unified view of most previous table-lookup-and-addition methods: bipartite tables, SBTM, STAM and multipartite method. This new definition allows a more accurate computation of the error entailed by these methods. Being more general, it also allows an exhaustive design space exploration which has been implemented, and leads to tables smaller than previously published ones by up to 50%. These tables have also been synthesised for Virtex FPGAs, and the paper discusses some results of this synthesis.

  • a –  INRIA
  • 1:  ARENAIRE (Inria Grenoble Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme)
  • INRIA – CNRS : UMR5668 – Université Claude Bernard - Lyon I – École Normale Supérieure - Lyon
  • Domain : Computer Science/Other
  • Keywords : BIPARTITE TABLES – TABLE-LOOKUP-AND-ADDITION METHODS – SBTM – STAM – MULTIPARTITE – FPGA
  • Internal note : RR-4059
 
  • inria-00072577, version 1
  • http://hal.inria.fr/inria-00072577
  • oai:hal.inria.fr:inria-00072577
  • From: Rapport De Recherche Inria <>
  • Submitted on: Wednesday, 24 May 2006 10:19:21
  • Updated on: Wednesday, 5 January 2011 16:18:30