Some Improvements on Multipartite Table Methods

This paper presents an unified view of most previous table-lookup-and-addition methods: bipartite tables, SBTM, STAM and multipartite methods. 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%. Some results have been synthesised for Virtex FPGAs, and are discussed in this paper.

• Type: Conference
• Year: 2001
• Where: ARITH
• Authors: Florent de Dinechin, Arnaud Tisserand
• Keywords: Applied Computing, ARITH 2001, Exhaustive Design Space, Multipartite Methods, Virtex Fpgas