High Performance Multiple Constant Multiplier Using Modified Booth Algorithm

Abstract

Over the many years, various techniques have been developed for the efficient realization of constant multiplications by a network of add/subtract-shift operations. Radix-2^r arithmetic is applied to the multiple constant multiplication (MCM) as nonnegative constants which are denoted by M with a bit length N. Multiple constant Multiplication can detect the analytic formulas for the maximum number of additions, and the maximum number of cascaded additions, the average number of additions forming the critical path. A high performance 32*32 bit modified booth multiplier has been designed in the proposed system. Therefore, modified booth encoding(MBE) permits carry-free addition and adaptability. It has been used in 32*32 bit high-performance modified booth multiplier design for summation of partial product terms. The modified Booth multiplier also reduces redundant partial product accumulation stage when eliminating the error correcting word(ECW) which improves the complexity and the critical path delay.