Home            Contact us            FAQs
    
      Journal Home      |      Aim & Scope     |     Author(s) Information      |      Editorial Board      |      MSP Download Statistics

     Research Journal of Applied Sciences, Engineering and Technology


Low Power and Efficient Dadda Multiplier

S. Ravi, Govind Shaji Nair, Rajeev Narayan and Harish M. Kittur
School of Electronics Engineering, VIT University, Vellore, Tamilnadu 632014, India
Research Journal of Applied Sciences, Engineering and Technology  2015  1:53-57
http://dx.doi.org/10.19026/rjaset.9.1376  |  © The Author(s) 2015
Received: November ‎13, ‎2014  |  Accepted: November ‎13, ‎2014  |  Published: January 05, 2015

Abstract

In this study an area optimized Dadda multiplier with a data aware Brent Kung adder in the final addition stage of the Dadda algorithm for improved efficiency has been described in 45 nm technology. Currently the trend is to shift towards low area designs due to the increasing cost of scaled CMOS. An area reduced full adder is the key component in our design. It uses lesser number of gates than conventional design and hence lesser area and delay. The data aware Brent Kung adder in the final addition stage helps in reducing dynamic power as it reduces switching activity depending on the inputs. We have compared the results to the existing benchmark designs and our experimental results show that we have been capable of reducing the area by 13.011% and total power by 26.1% with only a slight increase in the delay.

Keywords:

Brent Kung adder, dadda multiplier, data aware, low area,


References

  1. Arunachalam, T. and S. Kirubaveni, 2013. Analysis of high speed multipliers. Proceeding of International Conference on Communications and Signal Processing (ICCSP, 2013), pp: 211-214.
    CrossRef    
  2. Bickerstaff, K.C., E.E. Swartzlander and M.J. Schulte, 2001. Analysis of column compression multipliers. Proceeding of 15th IEEE Symposium on Computer Arithmetic, pp: 33-39.
    CrossRef    
  3. Dadda, L., 1965. Some schemes for parallel multipliers. Alta Freq., 34: 349-356.
  4. Parhami, B., 2000. Computer Arithmetic. Oxford University Press, New York.
  5. Pudi, V. and K. Sridharan, 2012. Low complexity design of ripple carry and Brent-kung adders in QCA. IEEE T. Nanotechnol., 11(1): 105-119.
    CrossRef    
  6. Ramkumar, B., V. Sreedeep and H.M. Kittur, 2011. A Design Technique for Faster Dadda Multiplier. Retrieved form: http://arxiv.org/ftp/arxiv/papers/ 1110/1110.3281.pdf.
  7. Rani, T.E., M.A. Rani and R. Rao, 2011. Area optimized low power arithmetic and logic unit. Proceeding of 3rd International Conference on Electronics Computer Technology (ICECT, 2011), pp: 224-228.
    CrossRef    
  8. Swartzlander Jr., E. and G. Goto, 2002. Computer Arithmetic. In: Oklobdzija, V.G. (ed.), the Computer Engineering Handbook. CRC Press, Boca Raton, FL.
    PMid:11909356    
  9. Townsend, W.J., E.E. Swartzlander and J.A. Abraham, 2003. A comparison of Dadda and Wallace multiplier delays. Proceeding of SPIE Advanced Signal Processing Algorithms, Architectures and Implementations XIII, 5205: 552-560.
    CrossRef    
  10. Zhou, Y. and H. Guo, 2008. Application specific low power ALU design. Proceeding of IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC’08), pp: 214-220.
    CrossRef    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.

ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Information
   Sales & Services
Home   |  Contact us   |  About us   |  Privacy Policy
Copyright © 2024. MAXWELL Scientific Publication Corp., All rights reserved