Hardware architecture design and mapping of 'Fast Inverse Square Root' algorithm

The Fast Inverse Square Root algorithm has been used in 3D games of past for lighting and reflection calculations, because it offers up to four times performance gains. This paper presents a hardware implementation of the algorithm on an FPGA board by designing the complete architecture and successf...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2014 International Conference on Advances in Electrical Engineering (ICAEE) s. 1 - 4
Hlavní autori: Zafar, Saad, Adapa, Raviteja
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.01.2014
Predmet:
0x5f3759df
Algorithm design and analysis
Clocks
Computer architecture
digital design
Field programmable gate arrays
fpga
Hardware
reciprocal root
reconfigurable
Software
Software algorithms
verilog
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The Fast Inverse Square Root algorithm has been used in 3D games of past for lighting and reflection calculations, because it offers up to four times performance gains. This paper presents a hardware implementation of the algorithm on an FPGA board by designing the complete architecture and successfully mapping it on Xilinx Spartan 3E after thorough functional verification. The results show that this implementation provides a very efficient single-precision floating point inverse square root calculator with practically accurate results being made available after just 12 short clock cycles. This performance measure is far superior to the software counterpart of the algorithm, and is not processor dependent like rsqrtss of x86 SSE instruction set. Results of this work can aid FPGA based vector processors or graphic processing units with 3D rendering. The hardware design can also form part of a larger floating point arithmetic unit for dedicated reciprocal square root calculations.
DOI:10.1109/ICAEE.2014.6838433