Some Improvements on Multipartite Table Methods

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

1 ARENAIRE - Computer arithmetic

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.

Mots clés: BIPARTITE TABLES; TABLE-LOOKUP-AND-ADDITION METHODS; SBTM; STAM; MULTIPARTITE; FPGA

Domaines: Autre [cs.OH]

Florent de Dinechin, Arnaud Tisserand. Some Improvements on Multipartite Table Methods. [Research Report] RR-4059, INRIA. 2000. ⟨inria-00072577⟩