Design of High Speed Vedic Multiplier using Vedic Mathematics Techniques

This paper proposed the design of high speed Vedic Multiplier using the techniques of Ancient Indian Vedic Mathematics that have been modified to improve performance. Vedic Mathematics is the ancient system of mathematics which has a unique technique of calculations based on 16 Sutras. The work has proved the efficiency of Urdhva Triyagbhyam- Vedic method for multiplication which strikes a difference in the actual process of multiplication itself. It enables parallel generation of intermediate products, eliminates unwanted multiplication steps with zeros and scaled to higher bit levels using Karatsuba algorithm with the compatibility to different data types. Urdhva tiryakbhyam Sutra is most efficient Sutra (Algorithm), giving minimum delay for multiplication of all types of numbers, either small or large. Further, the Verilog HDL coding of Urdhva tiryakbhyam Sutra for 32x32 bits multiplication and their FPGA implementation by Xilinx Synthesis Tool on Spartan 3E kit have been done and output has been displayed on LCD of Spartan 3E kit. The synthesis results show that the computation time for calculating the product of 32x32 bits is 31.526 ns.

[1]  M.C. Hanumantharaju,et al.  A High Speed Block Convolution Using Ancient Indian Vedic Mathematics , 2007, International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007).

[2]  S. Kumaravel,et al.  VLSI Implementation of High Performance RSA Algorithm Using Vedic Mathematics , 2007, International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007).

[3]  M. B. Srinivas,et al.  High Speed Efficient N X N Bit Parallel Hierarchical Overlay Multiplier Architecture Based On Ancient Indian Vedic Mathematics , 2004 .

[4]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[5]  Dan Zuras On squaring and multiplying large integers , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[6]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[7]  Richard Conway,et al.  Lifting scheme discrete Wavelet Transform using Vertical and Crosswise multipliers , 2008 .

[8]  David Harris,et al.  CMOS VLSI Design: A Circuits and Systems Perspective , 2004 .

[9]  Harpreet S. Dhillon,et al.  A Reduced-Bit Multiplication Algorithm for Digital Arithmetic , 2008 .