Skip to main content

Estimating the Maximum Propagation Delay of 4-bit Ripple Carry Adder Using Reduced Input Transitions

  • Conference paper
  • First Online:
VLSI Design and Test (VDAT 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 711))

Included in the following conference series:

Abstract

Adders are invariably present in arithmetic units, and they are needed for implementing the operations: addition/subtraction, multiplication, division, etc. Due to the crucial role of adder in arithmetic unit, it is necessary to satisfactorily characterize the maximum propagation delay of the adder. To characterize 4-bit Ripple Carry Adder (RCA), ideally 261,632 input transitions are required [1], which is a humongous number. In this paper, we have proposed a method to estimate maximum propagation delay of 4-bit RCA, using only 44 input transitions (applied as primary-secondary and subsequently as secondary- primary). We applied our proposed method on 4-bit RCAs designed using seven different Full Adder (FA) circuits and simulated them in LTspice. The results from our proposed method (reduced input transitions) are compared with the results obtained by applying 261,632 input transitions (all possible transitions) to the 4-bit RCA. The simulation results prove that the maximum delay estimated by our proposed method is very close to the exact maximum delay of 4-bit RCA (found by applying ideal 261,632 input transitions), and has maximum 5.99% deviation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Mewada, M., Zaveri, M.: An input test pattern for characterization of a full-adder and n-bit ripple carry adder. In: 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI), pp. 250–255. IEEE (2016)

    Google Scholar 

  2. Shams, A.M., Bayoumi, M.A.: A framework for fair performance evaluation of 1-bit full adder cells. In: 42nd Midwest Symposium on Circuits and Systems, 1999, vol. 1, pp. 6–9. IEEE (1999)

    Google Scholar 

  3. Mewada, M., Zaveri, M.: An improved input test pattern for characterization of full adder circuits. Int. J. Res. Sci. Innov.-IJRSI 3(1), 222–226 (2015)

    Google Scholar 

  4. Bushnell, M., Agrawal, V.: Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI Circuits, vol. 17. Springer Science & Business Media, New York (2004) https://doi.org/10.1007/b117406

  5. Zimmermann, R., Fichtner, W.: Low-power logic styles: CMOS versus pass-transistor logic. IEEE J. Solid-State Circuits 32(7), 1079–1090 (1997)

    Article  Google Scholar 

  6. Chang, C.H.: A review of 0.18-um full adder performances for tree structured arithmetic circuits. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 13(6), 686–695 (2005)

    Article  Google Scholar 

  7. Aguirre-Hernandez, M., Linares-Aranda, M.: CMOS full-adders for energy-efficient arithmetic applications. IEEE Trans. Very Large Scale Integr. VLSI Syst. 19(4), 718–721 (2011)

    Article  Google Scholar 

  8. Konijeti, N.R., Ravindra, J.V.R., Yagateela, P.: Power aware and delay efficient hybrid CMOS full-adder for ultra deep submicron technology. In: 2013 European Modelling Symposium (EMS), pp. 697–700. IEEE (2013)

    Google Scholar 

  9. Bhattacharyya, P., Kundu, B., Ghosh, S., Kumar, V., Dandapat, A.: Performance analysis of a low-power high-speed hybrid 1-bit full adder circuit. IEEE Trans. Very Large Scale Integr. VLSI Syst. 23(10), 2001–2008 (2015)

    Article  Google Scholar 

  10. Shams, A.M., Darwish, T.K., Bayoumi, M.A.: Performance analysis of low-power 1-bit CMOS full adder cells. IEEE Trans. Very Large Scale Integr. VLSI Syst. 10(1), 20–29 (2002)

    Article  Google Scholar 

  11. Goel, S., Kumar, A., Bayoumi, M.A.: Design of robust, energy-efficient full adders for deep-submicrometer design using hybrid-CMOS logic style. IEEE Trans. Very Large Scale Integr. VLSI Syst. 14(12), 1309–1321 (2006)

    Article  Google Scholar 

  12. Zhang, M., Gu, J., Chang, C.H.: A novel hybrid pass logic with static CMOS output drive full-adder cell. In: Proceedings of the 2003 International Symposium on Circuits and Systems, ISCAS 2003, vol. 5, p. V. IEEE (2003)

    Google Scholar 

  13. Aranda, M.L., Báez, R., Diaz, O.G.: Hybrid adders for high-speed arithmetic circuits: a comparison. In: 2010 7th International Conference on Electrical Engineering Computing Science and Automatic Control (CCE), pp. 546–549. IEEE (2010)

    Google Scholar 

  14. Yeo, K.S., Roy, K.: Low Voltage, Low Power VLSI Subsystems. McGraw-Hill, Inc., New York (2009)

    Google Scholar 

  15. Shubin, V.V.: New high-speed CMOS full adder cell of mirror design style. In: 2010 International Conference and Seminar on Micro/Nanotechnologies and Electron Devices (EDM), pp. 128–131. IEEE (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Manan Mewada .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mewada, M., Zaveri, M., Lakhlani, A. (2017). Estimating the Maximum Propagation Delay of 4-bit Ripple Carry Adder Using Reduced Input Transitions. In: Kaushik, B., Dasgupta, S., Singh, V. (eds) VLSI Design and Test. VDAT 2017. Communications in Computer and Information Science, vol 711. Springer, Singapore. https://doi.org/10.1007/978-981-10-7470-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-7470-7_2

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-7469-1

  • Online ISBN: 978-981-10-7470-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics