PROJECT TITLE:

A Modified Partial Product Generator for Redundant Binary Multipliers - 2016

ABSTRACT:

Because of its high modularity and carry-free addition, a redundant binary (RB) representation will be used when planning high performance multipliers. The standard RB multiplier requires a further RB partial product (RBPP) row, as a result of a blunder-correcting word (ECW) is generated by both the radix-4 Modified Booth encoding (MBE) and also the RB encoding. This incurs in an extra RBPP accumulation stage for the MBE multiplier. In this project, a replacement RB changed partial product generator (RBMPPG) is proposed; it removes the additional ECW and hence, it saves one RBPP accumulation stage. Thus, the proposed RBMPPG generates fewer partial product rows than a typical RB MBE multiplier. Simulation results show that the proposed RBMPPG based designs considerably improve the realm and power consumption when the word length of every operand within the multiplier is at least 32 bits; these reductions over previous NB multiplier styles incur in a very modest delay increase (approximately five p.c). The power-delay product will be reduced by up to 59 % using the proposed RB multipliers in comparison with existing RB multipliers.