Reduction of Look Up Tables for Computation of Reciprocal of Square Roots

Among many existing algorithms, convergence methods are the most popular means of computing square root and the reciprocal of square root of numbers. An initial approximation is required in these methods. Look up tables (LUT) are employed to produce the initial approximation. In this paper a number of methods are suggested to reduce the size of the look up tables. The precision of the initial approximation plays an important role in the quality of the final result. There are constraints for the use of a LUT in terms of its size and its access time. Therefore, the optimization of the LUTs must be done in a way to minimize hardware while offering acceptable convergence speed and exactitude.

[1]  Tariq S. Durrani,et al.  The Square Root In Signal Processing , 1989, Optics & Photonics.

[2]  Yamin Li,et al.  Cost/performance tradeoff of n-select square root implementations , 2000, Proceedings 5th Australasian Computer Architecture Conference. ACAC 2000 (Cat. No.PR00512).

[3]  Vijay K. Jain,et al.  Novel reciprocal and square-root VLSI cell: architecture and application to signal processing , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[4]  Earl E. Swartzlander,et al.  Cascaded implementation of an iterative inverse-square-root algorithm, with overflow lookahead , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[5]  Miriam Leeser,et al.  An area/performance comparison of subtractive and multiplicative divide/square root implementations , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[6]  Peter Kornerup.  Digit selection for SRT division and square root , 2005, IEEE Transactions on Computers.

[7]  Naofumi Takagi.  A hardware algorithm for computing reciprocal square root , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[8]  S. Samavi,et al.  Modular array structure for non-restoring square root circuit , 2008, J. Syst. Archit..

[9]  Tania Vassileva,et al.  A FPGA based square-root coprocessor , 1996, Proceedings of EUROMICRO 96. 22nd Euromicro Conference. Beyond 2000: Hardware and Software Design Strategies.

[10]  Naofumi Takagi.  Generating a power of an operand by a table look-up and a multiplication , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

[11]  A. S. Ginzburg.  The square root , 2011 .

[12]  Matti Tommiska.  Area-efficient implementation of a fast square root algorithm , 2000, Proceedings of the 2000 Third IEEE International Caracas Conference on Devices, Circuits and Systems (Cat. No.00TH8474).

[13]  Ken Turkowski.  Computing the Inverse Square Root , 1995 .