15-02-2016, 12:14 PM
students from engineering college ece department
we are doing a project on this topic we want how to solve redundant binary booth multiplier problem and vhdl code.
A Modified Partial Product
Generator for Redundant Binary
Multipliers
Xiaoping Cui, Weiqiang Liu, Senior Member, IEEE,
Xin Chen, Earl E. Swartzlander, Jr., Life Fellow, IEEE
and Fabrizio Lombardi, Fellow, IEEE
Abstract—Due to its high modularity and carry-free addition, a
redundant binary (RB) representation can be used when designing
high performance multipliers. The conventional RB multiplier requires
an additional RB partial product (RBPP) row, because an
error-correcting word (ECW) is generated by both the radix-4 Modified
Booth encoding (MBE) and the RB encoding. This incurs in an
additional RBPP accumulation stage for the MBE multiplier. In this
paper, a new RB modified partial product generator (RBMPPG) is
proposed; it removes the extra ECW and hence, it saves one RBPP
accumulation stage. Therefore, the proposed RBMPPG generates
fewer partial product rows than a conventional RB MBE multiplier.
Simulation results show that the proposed RBMPPG based designs
significantly improve the area and power consumption when the
word length of each operand in the multiplier is at least 32 bits;
these reductions over previous NB multiplier designs incur in a
modest delay increase (approximately 5%). The power-delay product
can be reduced by up to 59% using the proposed RB multipliers
when compared with existing RB multipliers.
Index Terms—Redundant binary, modified Booth encoding, RB
partial product generator, RB multiplier