Generalised Algorithm for Multiplying Binary Numbers Via Vedic Mathematics

Multiplication is one of the most important operations in computer arithmetic. Generally, the algorithms projected for finding product of two numbers is constructed using the concept of repeated addition. The dependence of number of times the operation – “Addition” is performed for multiplication is based on the number of operands supplied. In this article, we have presented an efficient algorithm to multiply two numbers in their binary form, where the binary form of the multiplier has a special characteristic that it will consist only of 1’s using the Vedic Mathematics technique. Equivalently, this algorithm will multiply any decimal number with a decimal number of the form 2
^m
— 1. This is the generalized algorithm of the algorithm presented in our previous work [2].