VLSI Implementation of High Speed & Low Power Multiplier in FPGA

Abstract

We known that different multipliers consume most of the power in DSP computations, FIR filters. Hence, it is very important factor for modern DSP systems to built low-power multipliers to minimize the power dissipation. In this paper, we presents high speed & low power Row Column bypass multiplier design methodology that inserts more number of zeros in the multiplicand thereby bypass the number of zero in row & Column as well as reduce power consumption. The bypassing of zero activity of the component used in the process of multiplication, depends on the input bit data. This means if the input bit data is zero, corresponding row and column of adders need not be addition & transfer bit in next row and column adder circuit. If multiplicand having more zeros, higher power reduction can be achieved. At last stage of Row & column bypass multiplier having ripple carry adder which are increase time to generate carry bit to transfer next adder circuit. To reduce this problem by using Carry bypass adder in place of ripple carry adder, then new modification of Row &column multiplier having high speed in comparison to simple row & column bypass multiplier, , the experimental results show that our proposed multiplier reduces power dissipation & High speed overhead on the average for 4x4, 8x8 and 16x16 multiplier.

Comparative study of single precision floating point division using different computational algorithms

“…Comparative study of single precision floating point division using … (Naginder Singh) 337 described and Urdhva-Tiryagbhyam-sutra used to achieve high speed [11]. In designing of processor, arithmetic-logic unit (ALU) unit arithmetic operations are done by addition, subtraction, and multiplication Vedic algorithm plays an important role [12]. Nikhilam-sutra based multiplier is designed to get high speed as the computational speed gained by Vedic mathematics described [13].…”