Newton-Raphson algorithms for floating-point division using an FMA

Since the introduction of the Fused Multiply and Add (FMA) in the IEEE-754-2008 standard [6] for floatingpoint arithmetic, division based on Newton-Raphson´s iterations becomes a viable alternative to SRT-based divisions. The Newton-Raphson iterations were already used in some architecture prior to the revision of the IEEE-754 norm. For example, Itanium architecture already used this kind of iterations [8]. Unfortunately, the proofs of the correctness of binary algorithms do not extend to the case of decimal floating-point arithmetic. In this paper, we present general methods to prove the correct rounding of division algorithms using Newton-Raphson´s iterations in software, for radix 2 and radix 10 floating-point arithmetic.