Optimized Floating Point Square-root

Abstract

In present digital world, fast and resource optimized execution of basic mathematical operations such as multiplication, division, square-root etc. play an important role. There are enormous algorithm where it is necessary to calculate square-root. After addition, subtraction, multiplication and division, square-root is most important mathematical operation. Therefore, this paper presents fast, resource optimized, and floating point square-root algorithm. Three different algorithms such as 1) non-restoring algorithm 2) IEEE 754 floating point square-root algorithm and 3) Logarithmic square-root algorithm, are implemented on Xilinxs Spartan 3E and compared for resource utilization and execution clocks. Comparison shows that IEEE 754 floating point square-root algorithm outperforms with the throughput as 50MSPS consuming 60% less resources than logarithmic square-root algorithm.