Design and implementation of goldschmidts algorithm for floating point division and square root

Digital signal processing algorithms are implemented using fixed point arithmetic due to expected area and power savings. However, the recent research shows that floating point arithmetic can be used by using the reduced precision format instead of standard IEEE floating point format which will avoid the algorithm design and implementation difficulties occurs in fixed point arithmetic. In this paper, the simplified single precision floating point arithmetic is used to perform division and square root operations. Goldschmidt's algorithm is iterative algorithm and has speed advantage over other iterative algorithms. Here FMA based Goldschmidt's algorithm is used for performing division and square root.

[1]  Yamin Li,et al.  Implementation of single precision floating point square root on FPGAs , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).

[2]  Rob A. Rutenbar,et al.  Reducing power by optimizing the necessary precision/range of floating-point arithmetic , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[3]  Gerard J. M. Smit,et al.  Sabrewing: A lightweight architecture for combined floating-point and integer arithmetic , 2012, TACO.

[4]  Markku J. Juntti,et al.  Fixed- versus floating-point implementation of MIMO-OFDM detector , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[5]  Sandeep Kakde,et al.  HDL implementation of 128- bit Fused Multiply Add unit for multi mode SoC , 2014, 2014 International Conference on Communication and Signal Processing.

[6]  Peter W. Markstein,et al.  Software Division and Square Root Using Goldschmidt's Algorithms , 2004 .

[7]  Jarmo Takala,et al.  Simplified floating-point division and square root , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.