A Time-Area-Power Efficient Multiplier and Square Architecture Based on Ancient Indian Vedic Mathematics

In this paper new multiplier and square architecture is proposed based on algorithm of ancient Indian Vedic Mathematics, for low power and high speed applications. It is based on generating all partial products and their sums in one step. The design implementation is described in both at gate level and high level RTL code (behavioural level) using Verilog Hardware Description Language. The design code is tested using Veriwell Simulator. The code is synthesized in Synopys FPGA Express using: Xilinx, Family: Spartan Svq300, Speed Grade: -6. The present paper relates to the field of math coprocessors in computers and more specifically to improvement in speed and power over multiplication and square algorithm implemented in coprocessors. In FPGA implementation it has been found that the proposed Vedic multiplier and square are faster than array multiplier and Booth multiplier.

[1]  Homayoon Sam,et al.  A Generalized Multibit Recoding of Two's Complement Binary Numbers and Its Proof with Application in Multiplier Implementations , 1990, IEEE Trans. Computers.

[2]  Keshab K. Parhi.  A systematic approach for design of digit-serial signal processing architectures , 1991 .

[3]  Renato De Mori,et al.  A recursive algorithm for binary multiplication and its implementation , 1985, TOCS.

[4]  Peter F. Corbett,et al.  Digit-serial processing techniques , 1990 .

[5]  Luigi Ciminiera,et al.  ARITHMETIC ARRAY FOR FAST INNER PRODUCT EVALUATION , 1981 .

[6]  Mary Jane Irwin,et al.  Design issues in digit serial signal processors , 1989, IEEE International Symposium on Circuits and Systems,.

[7]  Himanshu Thapliyal,et al.  A High Speed Efficient N x N Bit Multiplier Based on Ancient Indian Vedic Mathematics , 2003, VLSI.

[8]  Barrie Hayes-Gill,et al.  Novel pipelined serial/parallel multiplier , 1990 .

[9]  M. Morris Mano,et al.  Computer system architecture , 1982 .

[10]  M. Ibrahim Sezan,et al.  Digital video standards conversion in the presence of accelerated motion , 1994 .

[11]  Tomás Lang,et al.  Fast Multiplication Without Carry-Propagate Addition , 1990, IEEE Trans. Computers.

[12]  Shaler G. Smith,et al.  Radix-4 modules for high-performance bit-serial computation , 1987 .

[13]  Milos D. Ercegovac,et al.  On-Line Arithmetic: An Overview , 1984, Optics & Photonics.

[14]  L. Ciminiera,et al.  Low cost serial multipliers for high-speed specialised processors , 1988 .

[15]  Mary Jane Irwin,et al.  Digit-Pipelined Arnthmetic as Illustrated by the Paste-Up System: A Tutorial , 1987, Computer.

[16]  T.-Y. Chang,et al.  Design and analysis of VLSI-based parallel multipliers , 1990 .

[17]  I-Ngo Chen,et al.  An 0(n) Parallel Multiplier with Bit-Sequential Input and Output , 1979, IEEE Transactions on Computers.

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

[19]  J. L. Meador,et al.  A nonredundant-radix-4 serial multiplier , 1989 .

[20]  Mark Horowitz,et al.  SPIM: a pipelined 64*64-bit iterative multiplier , 1989 .

[21]  R. Gnanasekaran,et al.  A Fast Serial-Parallel Binary Multiplier , 1985, IEEE Transactions on Computers.