IEEE Transactions on Computers · 2000 · 120 citations · 15 references
Natural SciencesComputer ScienceMathematicsAlgebraAlgorithmsTheory Of ComputationAlgorithm AnalysisArithmetic FunctionsLookup TablesNumerical AnalysisTiming AnalysisArithmetic Circuit EvaluationExpansionFloating-point ArithmeticMultiplier DesignMultipliersMultiply-accumulate UnitsRational Function Computation
This paper deals with the computation of reciprocals, square roots, inverse square roots, and some elementary functions using small tables, small multipliers, and, for some functions, a final "large" (almost full-length) multiplication. We propose a method, based on argument reduction and series expansion, that allows fast evaluation of these functions in high precision. The strength of this method is that the same scheme allows the computation of all these functions. We estimate the delay, the size/number of tables, and the size/number of multipliers and compare with other related methods.
15
Elementary functions: algorithms and implementation
Choice Reviews Online · 1998 · 542 citations
Division algorithms and implementations
Stuart Obermann, Michael Flynn · IEEE Transactions on Computers · 1997 · 321 citations
Faithful bipartite ROM reciprocal tables
Debjit Das Sarma, David W. Matula · 2002 · 172 citations
Function evaluation by table look-up and addition
H. Hassler, Naofumi Takagi · 2002 · 92 citations