IEEE-754 compliant Algorithms for Fast Multiplication of Double Precision Floating Point Numbers

Abstract

In image and signal processing applications floating-point multiplication is major concern in calculations. Performing multiplication on floating point data is a long course of action and requires huge quantity of processing time. By improving the speed of multiplication task overall speed of the system can be enhanced. The Bottleneck in the floating point multiplication process is the multiplication of mantissas which needs 53*53 bit integer multiplier for double precision floating point numbers. By improving the speed of multiplication task the overall speed of the system can be improved. In this paper a comparison on the existing trends in mantissa multiplication is made. Vedic and Canonic Signed digit algorithms were compared on parameters like speed, complexity of routing, pipelining, resource required on FPGA. The comparison showed that Canonic Signed Digit Algorithm is better than Vedic algorithm in terms of speed and resources required on spartan3 FPGA. .