A Variable Latency Goldschmidt's Floating Point Number Square Root Computation
Sung-Gi Kim, Hong-Bok Song, Gyeong-Yeon Cho · The Journal of the Korean Institute of Information and Communication Engineering · 2005
The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: with the initial value is . The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than . The value of p is 28 for the single precision floating point, and 58 for the doubel precision floating point. Let , there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1} is approximate to . Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal square root tables () with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.