Professional Documents
Culture Documents
Low Power Baugh Wooley Multipliers With Bypassing Logic: March 2013
Low Power Baugh Wooley Multipliers With Bypassing Logic: March 2013
net/publication/284601467
CITATION READS
1 1,469
1 author:
Anitha Ravi
VIT University
12 PUBLICATIONS 48 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by Anitha Ravi on 25 November 2015.
In order to design a low power Column A Row and Column Bypassing multiplier for low power can
Bypassing multiplier, there is a need to bypass the be obtained based on the simplification of full adders. If the
addition operations in the (i+1)-th column, if the ai bit of product aibj is 1 and ci,j-1 is 0, then the (i+1,j)-th full adder
the multiplicand is zero since all the partial products aibj performs A+1 addition. If aibj is 1 and ci,j-1 is 1, then the (i+1,j)-
th full adder performs A+2 addition. The carry bit is replaced
Fig.3. 4*4 Column Bypassing BW multiplier with the AND operation between aibj and ci,j-1. So the (i+1,j)-th
full adder is replaced with A+B+1 adder. The architecture of The architecture of a 4x4 Low cost low power bypassing
4x4 Row and Column Bypassing multiplier is shown in Fig.: 5. based Baugh Wooley multiplier is shown in Fig.: 6.
A low cost low power bypassing based Baugh Wooley III.DELAY REDUCTION IN BAUGH WOOLEY
multiplier is based on replacing of adder cells with an MULTIPLIERS
incremental adder A+1. The addition in (i+1,j)-th full adder
will be bypassed when aibj and ci,j-1 are equal else the The delay of the Baugh Wooley multiplier depends
addition will execute. up on the delay of the full adders and also on the final
adder in the last stage of the multiplier. The final adder
in the last stage of the Baugh Wooley multiplier is the
Ripple Carry Adder (RCA). In the Ripple Carry Adder,
the carries are propagated from one stage to the other and
the present full adder should wait until the full adder has
completed its operation and generated the sum and carry
outputs. So the delay is more for a Ripple Carry Adder.
This is the major disadvantage of using a RCA. The
delay of the multipliers can be reduced by replacing the
RCA in the last stage with fast adders like Carry Look
Ahead adder (CLA) and Kogge Stone Adder (KSA). The
delay of the CLA and KSA are less when compared to a
RCA. However, area occupied and power increases by
the use of fast adders.
TABLE: 1. MAXIMUM COMBINATIONAL PATH DELAY (IN NS) FOR BW MULTIPLIERS WITH RCA, CLA AND KSA IN THE LAST STAGE
FOR 4X4, 8X8, 16X16 AND 32X32 BITS
Virtex-6 Lower Power FPGA is showing the From the cell area report, we can conclude that the area
least maximum combinational path delay compared to occupied by the bypassing based BW multipliers is more
other FPGA families. compared to the conventional BW multiplier. Also, the area
occupied by the multipliers with CLA and KSA in the last
The cell area occupied by different multipliers stage is more compared to the multipliers with RCA in the last
for 4x4, 8x8, 16x16 and 32x32 bits is calculated using stage.
RTL Compiler from Cadence in 90nm technology and the
results are shown in Table: 2.
The dynamic power (in nW) obtained for 4x4, Kogge Stone Adder have more dynamic power compared
8x8, 16x16 and 32x32 BW multipliers with bypassing and to the multipliers with CLA and RCA.
also replacing RCA with CLA and KSA are shown in
Table: 3.
From the dynamic power reports, it can be observed that V. CONCLUSION
the dynamic power gets reduced for the bypassing based
multipliers. In case of 4x4 multipliers, Row Bypassing The dynamic power of the Baugh Wooley multipliers has
and Two dimensional bypassing based multipliers are been reduced by applying the bypassing techniques to
showing more power because of the fact that extra them. The delay of the Baugh Wooley multipliers has
bypassing logic is used to get the correct multiplication been reduced by replacing RCA in the last stage of the
result and also that we cannot bypass all the adder cells in multipliers with CLA and KSA. By using CLA in the last
Baugh Wooley multipliers because of the presence of stage we can get less delay with a little increase in
NAND gates. As the number of bits increases, the dynamic power. Since, in BW multiplier, NAND gates
dynamic power reduction is more which we can notice are used to generate partial products, the power reduction
from Table: 3. Also, by using CLA and KSA instead of is less compared to Braun multipliers in which only AND
RCA, the dynamic power increases. Multipliers with gates are used. The power reduction is less in BW
multipliers because we cannot bypass all the adder cells
because of the presence of NAND gates. Low cost [11] Kiat-Seng Yeo and Kaushik Roy, “Low Voltage, low Power VLSI
Subsystems”, Tata McGraw Hill.
Bypassing based BW multiplier has less area compared
with other bypassing based multipliers.
REFERENCES
[1] M. C. Wen, S. J. Wang and Y. M. Lin, “Low power parallel
multiplier with column bypassing,” IEEE International
Symposium on Circuits and Systems, 2005.
[2] J. Ohban, V. G. Moshnyaga, K. Inoue, “Multiplier energy
reduction through Bypassing of partial products”, IEEE Asia-
Pacific Conference on Circuits and Systems, 2002.
[3] G.N.Sung, Y.J.Ciou, C.C.Wang, “A power aware 2-dimensional
bypassing multiplier using cell – based design flow”, IEEE
International Symposium on Circuits and Systems, 2008.
[4] J. T. Yan, Z. W. Chen, “Low-power multiplier design with row and
column bypassing,” IEEE International SOC Conference, 2009.
[5] Muhammad H. Rais, “Hardware Implementation of Truncated
Multipliers Using Spartan-3AN, Virtex-4 and Virtex-5 FPGA
Devices”, Am. J. Engg. and Applied Sci., 2010.
[7] David H. K. Hoe, Chris Martinez and Sri Jyosthna Vundavelli,
“Design and Characterization of Parallel Prefix adders using FPGAs”,
IEEE 2011.
[8] Neil H.E.Weste, David Harris, Ayan Banerjee, “CMOS VLSI Design,
A circuits and system perspective”, Pearson education.
[9] www.xilinx.com
[10] Anitha R. and Bagyaveereswaran V.,” Comparative study of Braun’s
Multiplier Using FPGA Devices “, IJEST volume 3 No 6 June 2011,
p-no 4785 – 4793.