A Novel Square Root Algorithm and its FPGA Simulation

As a basic operation in elementary mathematics, square root operation is widely used in numerical calculation and digital signal processing. The square root operation is a nonlinear operation and cannot be solved directly on FPGA. Many previous square root algorithms have been proposed. This paper i...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of physics. Conference series Ročník 1314; číslo 1; s. 12008 - 12014
Hlavní autori: Zhou, Zhongcheng, Hu, Jingchun
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Bristol IOP Publishing 01.10.2019
Predmet:
ISSN:1742-6588, 1742-6596
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:As a basic operation in elementary mathematics, square root operation is widely used in numerical calculation and digital signal processing. The square root operation is a nonlinear operation and cannot be solved directly on FPGA. Many previous square root algorithms have been proposed. This paper introduces several previous square root algorithms, then presents a novel square root algorithm which uses 16-bit integer input and 16-bit integer output. Using the idea of normalization, the square number is mapped to the range of 0-1, and the square root is approximated by the sum of numerical sequence. We discuss the proposed square root algorithm, error analysis. The proposed algorithm was programmed by the Verilog in Xilinx's Vivado 17.2 software environment, and the simulation was verified on the Virtex-7 series chip. Compared with other square root algorithms, the algorithm only uses shifter, adders and sub-tractor. It does not involve complex operations, consumes less resources, and it's suitable for implementation on FPGA.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1314/1/012008