📞 +91-7667918914 | ✉️ ijarcce@gmail.com
International Journal of Advanced Research in Computer and Communication Engineering
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 2, ISSUE 3, MARCH 2013

High Performance Dadda Multiplier Implementation Using High Speed Carry Select Adder

ANJU S, M SARAVANAN PG Scholar, SNS College of Tech, Coimbatore Assistant Professor, SNS College of Tech, Coimbatore  

👁 41 views📥 1 download
Share: 𝕏 f in
Abstract: Two well known fast multipliers are those presented by Dadda and Wallace. Both multipliers use full adders and half adders in their reduction phase. The half adder does not reduce the number of partial product bits. Therefore minimizing the number of half adders in the multiplier will reduce the complexity. In the modified Wallace tree number of half adders is reduced to 80 percent. In Wallace multiplier the partial products are reduced as soon as possible. Therefore more number of half adders and full adders is required. But in Dadda multiplier reduction is performed whenever necessary. In the final carry propagation path carry select adder is used. A Carry Select Adder using BEC is introduced but it offers some speed penalty. This paper proposes an efficient carry select adder using D Latch.

Keywords: BEC, Dadda, Wallace, Modified Wallace, CSA

How to Cite:

[1] ANJU S, M SARAVANAN PG Scholar, SNS College of Tech, Coimbatore Assistant Professor, SNS College of Tech, Coimbatore  , “High Performance Dadda Multiplier Implementation Using High Speed Carry Select Adder,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License.