Modified booth multipliers with a regular partial product array

  • Authors:
  • Shiann-Rong Kuang;Jiun-Ping Wang;Cang-Yuan Guo

  • Affiliations:
  • Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan

  • Venue:
  • IEEE Transactions on Circuits and Systems II: Express Briefs
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The conventional modified Booth encoding (MBE) generates an irregular partial product array because of the extra partial product bit at the least significant bit position of each partial product row. In this brief, a simple approach is proposed to generate a regular partial product array with fewer partial product rows and negligible overhead, thereby lowering the complexity of partial product reduction and reducing the area, delay, and power of MBE multipliers. The proposed approach can also be utilized to regularize the partial product array of posttruncated MBE multipliers. Implementation results demonstrate that the proposed MBE multipliers with a regular partial product array really achieve significant improvement in area, delay, and power consumption when compared with conventional MBE multipliers.