An efficient floating point multiplier design for high speed applications using Karatsuba algorithm and Urdhva-Tiryagbhyam algorithm
Authors:
- 1 March 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 303-308
Abstract
Floating point multiplication is a crucial operation in high power computing applications such as image processing, signal processing etc. And also multiplication is the most time and power consuming operation. This paper proposes an efficient method for IEEE 754 floating point multiplication which gives a better implementation in terms of delay and power. A combination of Karatsuba algorithm and Urdhva-Tiryagbhyam algorithm (Vedic Mathematics) is used to implement unsigned binary multiplier for mantissa multiplication. The multiplier is implemented using Verilog HDL, targeted on Spartan-3E and Virtex-4 FPGA.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Implementation of single precision floating point multiplier using Karatsuba algorithm2013
- Low Power High Speed 16x16 bit Multiplier using Vedic MathematicsInternational Journal of Computer Applications, 2012
- FPGA design of a fast 32-bit floating point multiplier unit2012
- Hardware implementation of variable precision multiplication on FPGA2009