On Binary Multiplication Using the Quarter Square Algorithm

This correspondence suggests a new method of perporming binary multiplication using the quarter square technique. As compared to the previous methods [1],[2] the proposed scheme is more general in that it can be readily applied to numbers of any word length. Moreover, it has been shown that for the eight-bit case the present method is faster, more systematic, and economical than the earlier schemes.