Variable Latency Rounding for Golschmidt Algorithm with Parallel Remainder Estimation
Authors:
- Daniel Piso FernandezDFDaniel Piso Fernandez
- Javier Diaz BrugueraJBJavier Diaz Bruguera
- 1 August 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 293-300
Abstract
This paper presents a rounding method for functional iteration algorithms. The new method is made up of a new rounding algorithm and the calculation of a remainder estimation. The rounding method uses the result directly obtained from the algorithm without any transformation. The remainder estimation is calculated in parallel with the algorithm execution. This allow us to avoid the conventional remainder calculation after obtaining result, most of the times. In this way, the final implementation has a variable latency. By using adequate configurations the remainder calculation is only necessary in 9% of the total cases.Keywords
This publication has 3 references indexed in Scilit:
- A New Rounding Algorithm for Variable Latency Division and Square Root Implementations2008
- Design issues in division and other floating-point operationsIEEE Transactions on Computers, 1997
- Computation of elementary functions on the IBM RISC System/6000 processorIBM Journal of Research and Development, 1990