Strategies for FPGA Implementation of Non-Restoring Square Root Algorithm

This paper presents three strategies to implement non restoring square root algorithm based on FPGA. A new basic building block is called controlled subtract-multiplex (CSM) is introduced in first strategy which use gate level abstraction. The main principle of the method is similar with conventional non-restoring algorithm, but it only uses subtract operation and append 01, while add operation and append 11 is not used. Second strategy presents the first strategy in register transfer level (RTL) abstraction. In third strategy, a modification for the implementation of conventional non-restoring algorithm is presented which also use RTL abstraction. The all above strategies is implemented in VHDL programming and adopt fully pipelined architecture. The strategies have conducted to implement successfully in FPGA hardware, and each of the strategies is offer an efficient in hardware resource. In generally, the third strategy is superior. DOI: http://dx.doi.org/10.11591/ijece.v4i4.6008

[1]  Xiaojun Wang Variable Precision Floating-Point Divide and Square Root for Efficient FPGA Implementation of Image and Signal Processing Algorithms , 2007 .

[2]  A. Ejnioui,et al.  Design and implementation of double precision floating point division and square root on FPGAs , 2006, 2006 IEEE Aerospace Conference.

[3]  Yang Zhang,et al.  A New Algorithm for Designing Square Root Calculators Based on FPGA with Pipeline Technology , 2009, 2009 Ninth International Conference on Hybrid Intelligent Systems.

[4]  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).

[5]  Dooho Choi,et al.  Improved Computation of Square Roots in Specific Finite Fields , 2009, IEEE Transactions on Computers.

[6]  Marco Mezzalama,et al.  Survey of Square Rooting Algorithms , 1990 .

[7]  Xie Lingling,et al.  Hardware implementation of a high speed floating point multiplier based on FPGA , 2009, 2009 4th International Conference on Computer Science & Education.

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

[9]  Ji Xiaoliang Implementation of Square Root Arithmetic Based on FPGA , 2007 .

[10]  Stefan Lachowicz,et al.  Fast Evaluation of the Square Root and Other Nonlinear Functions in FPGA , 2008, 4th IEEE International Symposium on Electronic Design, Test and Applications (delta 2008).

[11]  Yamin Li,et al.  Parallel-array implementations of a non-restoring square root algorithm , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[12]  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).