IEEE Transactions on Computers · 2005 · 188 citations · 16 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureField-programmable Gate ArraysReconfigurable ComputingAccelerator ArchitectureField-programmable Gate Array ArchitectureFpga ArchitectureHardware AccelerationLookup TablesParallel ArchitecturesFinite-precision Arithmetic CircuitsLookup Table DesignLut ArchitectureLut Size OptimizationMultiplier Design
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 http://www.ens-lyon.fr/LIP/Arenaire/.
16
Elementary functions: algorithms and implementation
Choice Reviews Online · 1998 · 542 citations
Faithful bipartite ROM reciprocal tables
Debjit Das Sarma, David W. Matula · 2002 · 172 citations
Arithmetic on the European logarithmic microprocessor
J.N. Coleman, Ed Chester, C.I. Softley et al. · IEEE Transactions on Computers · 2000 · 134 citations