Division Algorithms and Implementations
IEEE Transactions on Computers
CMOS floating-point unit for the S/390 parallel enterprise server G4
IBM Journal of Research and Development - Special issue: IBM S/390 G3 and G4
A Decimal Floating-Point Divider Using Newton---Raphson Iteration
Journal of VLSI Signal Processing Systems
The S/390 G5 floating-point unit
IBM Journal of Research and Development
Parametric architecture for function calculation improvement
ARCS'07 Proceedings of the 20th international conference on Architecture of computing systems
Simplifying the rounding for Newton-Raphson algorithm with parallel remainder
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
A goldschmidt division method with faster than quadratic convergence
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
Exactly rounded results are necessary for many architectures such as IEEE 754 standard. For division and square root, rounding is easy to perform if a remainder is available. But for quadratically converging algorithms, the remainder is not typically calculated. Past implementations have required the additional delay to calculate the remainder, or calculate the approximate solution to twice the accuracy, or have resulted in a close but not exact solution. This paper shows how the additional delay of calculating the remainder can be reduced if extra precision is available.