Multiplication is one of the most important operations in arithmetic computation. Many integer operations such as quadrature, division and reciprocal computing require the same order of time as multiplication, while other operations such as GCD computation and residue operation require at most a log n time factor rather than multiplication. The iterative algorithmic approach for binary multiplication based on the old Nikhilam Sutra is described. Nikhilam sutra, one of the Vedic math multiplication sutras is efficient in multiplying large decimal numbers, since it reduces the multiplication of two large decimal numbers to two smaller numbers. The proposed iterative algorithm is taken from Nikhilam Sutra and further optimized by using the least significant zeros fall of binary numbers and execution bit shifting to take advantage of bit reduction in multiplication.
DIGITAL multipliers are the central components of all digital signal processors (DSP) and DSP speed is largely determined by the speed of their multipliers. They are indispensable in the implementation of computer systems that perform many important functions such as fast Fourier transform (FFTs) and multiple accumulations (MAC). Two most common multiplication algorithms followed in digital hardware are the array multiplication algorithm and the Booth multiplication algorithm. The calculation time taken by the matrix multiplier is comparatively smaller because the partial products are calculated independently in parallel. The delay associated with the array multiplier is the time the signals take to propagate through the gates that make up the multiplication matrix. Multiplication of the booth is another important multiplication algorithm. High-speed multiplication and exponential operations require large cabine arrays which in turn require large partial and partial load registers