Research on the disposal of negative partial product for booth algorithm

Booth algorithm is the classic method of partial product (PP) encoding in hardware design of multiplier, which is adopted by nearly all modern multipliers. This paper carries deep research on the disposal of negative PP based on Radix-4 Booth algorithm. Through recombining PP, it advances a skilled method avoiding the additive arithmetic of “plus 1” when computing the complement for negative PP, without increasing new PP. We prove this disposal correct and advanced in theory, and experimentalize it in multiplier design. The experiment result shows it could obviously improve the performance of multiplier. This method is of great significance for shortening the key path of multiplier and then improving its execution speed, which could be applied in all multipliers based on Radix-4 Booth encoding.