Generalization of Booth's Algorithm for Efficient Multiplication

In this paper we summarize the existing work on classical Booth's algorithm of multiplication and propose an improved version of its general form. In Booth's or modified Booth's algorithm two bits or three bits are considered at a time in the multiplier. Here we have shown an approach of using any number of bits of the multiplier. Then we find an optimal value of such bits for which the complexity of the operation will be minimal.