FPGA implementation of fast square root algorithm with tunable accuracy
by Shyamali Mitra; Arunasish Datta; Souradeep Sikdar; Mrinal Kanti Naskar
International Journal of Embedded Systems (IJES), Vol. 15, No. 1, 2022

Abstract: In the present work, a fast square root algorithm with tunable accuracy has been developed to minimise the number of clock pulses to compute an accurate square root value with a low hardware complexity. The proposed method uses a binomial expansion series guided initial guess to converge faster and thus reduces the number of iterations required to get to the square root value. It also allows the user to modulate the amount of accuracy required by changing the number of iterations and balance the accuracy with the time required to compute the square root value. The proposed architecture is synthesised on a Xilinx xC6vlx75t-2ff1784 family of FPGA and the device utilisation summary is analysed and compared to that of the other recently introduced algorithms. The simulation results are obtained on ModelSim 10.5c (Quartus Prime Pro 17.0) using Verilog programming Language.

Online publication date: Fri, 08-Apr-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com