• Mar 27, 2019 News!Vol.11, No.2 has been published with online version.   [Click]
  • Aug 06, 2018 News!Vol.9, No.1-Vol.9, No.4 have been indexed by EI (Inspec).   [Click]
  • Mar 27, 2019 News!Vol.9, No.1-Vol. 10, No. 6 have been indexed by Crossref.
General Information
Prof. Wael Badawy
Department of Computing and Information Systems Umm Al Qura University, Canada
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.
IJCTE 2011 Vol.3(1): 46-51 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2011.V3.281

An Efficient Implementation of the Non Restoring Square Root Algorithm in Gate Level

Tole Sutikno
Abstract—This paper proposes an efficient strategy to implement modified non restoring algorithm based on FPGA in gate level abstraction of VHDL, which adopt fully pipelined architecture. A new basic building block is called controlled subtract-multiplex (CSM) is introduced. 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, and it is offer an efficient in hardware resource.

Index Terms—FPGA, non-restoring, Gate Level, square root

Tole Sutikno is with the Department of Electrical Engineering, Universitas Ahmad Dahlan (UAD), Yogyakarta, Indonesia, e-mail: thsutikno@ieee.org, tole@ee.uad.ac.id.


Cite: Tole Sutikno, "An Efficient Implementation of the Non Restoring Square Root Algorithm in Gate Level," International Journal of Computer Theory and Engineering vol. 3, no. 1, pp. 46-51, 2011.
Copyright © 2008-2019. International Journal of Computer Theory and Engineering. All rights reserved.
E-mail: ijcte@iacsitp.com