Some Improvements on Multipartite Table Methods

Authors:
Florent de Dinechin;Arnaud Tisserand
Affiliations:
-;-
Venue:
ARITH '01 Proceedings of the 15th IEEE Symposium on Computer Arithmetic
Year:
2001

Citing 0
Cited 9

Multipartite Tables in JBits for the Evaluation of Functions on FPGAs

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
An Exponentiation Unit for an OpenGL Lighting Engine

IEEE Transactions on Computers
LNS architectures for embedded model predictive control processors

Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
Multipartite Table Methods

IEEE Transactions on Computers
Complex Square Root with Operand Prescaling

Journal of VLSI Signal Processing Systems
A Tool for Unbiased Comparison between Logarithmic and Floating-point Arithmetic

Journal of VLSI Signal Processing Systems
Low-Power FPGA-Implementation of atan(Y/X) Using Look-Up Table Methods for Communication Applications

Journal of Signal Processing Systems
Low precision table based complex reciprocal approximation

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
FPGA-implementation of atan(Y/X) based on logarithmic transformation and LUT-based techniques

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.