loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th IEEE Symposium on Computer Arithmetic (ARITH-15 '01)
Some Improvements on Multipartite Table Methods
Vail, Colorado
June 11-June 13
ISBN: 0-7695-1150-3
Florent de Dinechin, Ecole Normale Superieure de Lyon-INRIA
Arnaud Tisserand, Ecole Normale Superieure de Lyon-INRIA
Abstract: 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.
Citation:
Florent de Dinechin, Arnaud Tisserand, "Some Improvements on Multipartite Table Methods," arith, pp.0128, 15th IEEE Symposium on Computer Arithmetic (ARITH-15 '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.