Multiplication by complements

An innovative multiplication method is proposed which solves the problem of finding the product of two unsigned binary numbers by forming successively smaller one´s complements of the operands. The foundation of the algorithm lies in an ancient Vedic algorithm for multiplication. The Vedic multiplication algorithm is adapted to operate on binary numbers. The correctness of the method is demonstrated formally and translated into hardware. The resulting n-bit multiplier architecture consists of n-stages, each stage reducing the size of the operands by 1-bit.