Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

FPGA-VHDL implementation of Pipelined Square root Circuit for VLSI Signal Processing Applications

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2016
Arpita Jena, Siba Ku. Panda

Arpita Jena and Siba Ku. Panda. FPGA-VHDL implementation of Pipelined Square root Circuit for VLSI Signal Processing Applications. International Journal of Computer Applications 142(5):20-24, May 2016. BibTeX

	author = {Arpita Jena and Siba Ku. Panda},
	title = {FPGA-VHDL implementation of Pipelined Square root Circuit for VLSI Signal Processing Applications},
	journal = {International Journal of Computer Applications},
	issue_date = {May 2016},
	volume = {142},
	number = {5},
	month = {May},
	year = {2016},
	issn = {0975-8887},
	pages = {20-24},
	numpages = {5},
	url = {},
	doi = {10.5120/ijca2016909792},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


An efficient mathematical operation plays an imperative role in achieving the preferred presentation in most of the real time Signal processing applications. In all types of mathematical operations, Square root is an important operation which can be used in VLSI signal processing applications. This paper presents a proficient policy to implement non restoring algorithm based on FPGA in gate level build of VHDL, which uses abundant pipelined architecture. An original basic building block called as controlled- subtract-multiplex (CSM) is introduced here. The pipelined square root circuit is designed using an ever known algorithm called non-restoring algorithm that does not require any floating-point hardware .The designed circuit is simulated and debugged using XILINX ISE 14.1. The architecture is implemented onto SPARTAN 3E family and debugged on Spartan 3 XC3S100E. The main principle of the proposed 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. The proposed strategy has conducted to implement FPGA successfully.


  1. B.C.Senthilpari,, S. Kavitha “Proposed low power ,high speed,adder-based,65 nm square root circuit” journal of Microelectronics elsevier Science 2011 .
  2. Yamin Li and wanming Chu “A new non-restoring squareroot algorithm and its VLSI implementation”IEEE International Conference 1996.
  3. S.Samavi, A.Sadrabadi, A.Fanian.2008. “Modular array structure of non-restoring square root circuit”Journal of system architecture-Elsevier Science 2008.
  4. Yamin Li and Wanming Chu “Implementation of single precision floating point square root on FPGAs” 5th annual IEEE symposium 1997.
  5. John O’Leary “Non-restoring integer square root-A case study in design by principled optimization”1994.
  6. Tole Sutikno etal. “An efficient implementation of non-restoring square root algorithm in gate level” International association of computer science and information technology 2011
  7. I. Sajid, M.M.Ahmed “Pipelined implementation of fixed point square root in FPGA using modified non-restoring algorithm”2nd internal conference IEEE 2011
  8. Liang-Kai-Wang and M. J. Schulte “Decimal floating point square root using Newton-Raphson iteration”16th international conference IEEE 2005
  9. Yamin Li and Wanming Chu. “Parallel array implementations of non-restoring square root algorithm” 2005
  10. S.k panda and Arati sahu “ A Novel Vedic Divider Architecture with Reduced Delay for VLSI Applications ” IJCA,vol 120-No.17, june-2015


Square root, VLSI signal processing, VHDL, CSM, FPGA, Non-restoring algorithm, Pipelining.