Name
Abstract | ||
|---|---|---|
Since the introduction of the Fused Multiply and Add (FMA) in the IEEE-754-2008 standard (6) for floating- point arithmetic, division based on Newton-Raphson's iter- ations 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 algo- rithms using Newton-Raphson's iterations in software, for radix 2 and radix 10 floating-point arithmetic. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ASAP.2010.5540948 | ASAP |
Keywords | Field | DocType |
Newton-Raphson iterations,decimal floating-point arithmetic,division algorithm,floating-point arithmetic | Division algorithm,Floating point,Computer science,Parallel computing,Algorithm,Itanium,Radix,Rounding,Decimal,Newton's method,Binary number | Conference |
ISSN | Citations | PageRank |
2160-0511 | 1 | 0.38 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Louvet | 1 | 37 | 6.61 |
| Jean-Michel Muller | 2 | 466 | 66.61 |
| Adrien Panhaleux | 3 | 6 | 1.80 |