Abstract

Background: For higher-order multiplications, a huge number of adders or compressors are used to perform the addition of the partial products.

Objective: Hence, the area and the propagation delay will increase. Researchers are trying to reduce the number of additions of partial products.

Methods: In this paper, different modified compressors have been proposed and based on these compressors, 16x16-bit binary multiplier has been discussed.

Results: The proposed design provides better area, power consumption, critical path delay and less number of transistor counts when compared to other designs using the conventional compressors. Here, the proposed method has been used in the Wallace tree multiplier or Dadda tree multiplier. The compressor used here has been implemented using Microwind DSCH 3.8 lite.

Conclusion: The modified compressor makes the multiplier faster and reduces the number of addition of partial products.

Keywords: Compressor, dadda tree multiplier, partial product, wallace tree multiplier, higher-order multiplication, transistor counts.

Graphical Abstract