Skip to main content

Efficient Reversible Logic Design of BCD Subtractors

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((TCOMPUTATSCIE,volume 5300))

Abstract

Reversible logic is emerging as a promising computing paradigm, having its applications in low-power CMOS, quantum computing, nanotech-nology and optical computing. Firstly, we showed a modified design of conventional BCD subtractors and also proposed designs of carry look-ahead and carry skip BCD subtractors. The proposed designs of carry look-ahead and carry skip BCD subtractors are based on the novel designs of carry look-ahead and carry skip BCD adders, respectively. Then, we introduced the reversible logic implementation of the modified conventional, as well as the proposed, carry look-ahead and carry skip BCD subtractors efficient in terms of the number of reversible gates used and garbage output produced. To the best of our knowledge, the carry look-ahead and carry skip BCD subtractors and their reversible logic design are explored for the first time ever in literature.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cowlishaw, M.F.: Decimal Floating-Point: Algorithm for Computers. In: Proc. 16th IEEE Symposium on Computer Arithmetic, pp. 104–111 (2003)

    Google Scholar 

  2. Landauer, R.: Irreversibility and Heat Generation in the Computational Process. IBM Journal of Research and Development 5, 183–191 (1961)

    Article  MATH  Google Scholar 

  3. Bennett, C.H.: Logical Reversibility of Computation. IBM J. Research and Development, 525–532 (1973)

    Google Scholar 

  4. Perkowski, M., et al.: Regular Realization of Symmetric Functions using Reversible Logic. In: Proc. Euro-Micro., pp. 245–252 (2001)

    Google Scholar 

  5. Maslov, D.: Reversible Logic Synthesis. PhD. Thesis, University of New Brunswick, Canada (2003)

    Google Scholar 

  6. Gupta, P., Agarwal, A., Jha, N.K.: An Algorithm for Synthesis of Reversible Logic Circuits. IEEE Trans. Computer-Aided Design 25(11), 2317–2330 (2006)

    Article  Google Scholar 

  7. Patel, K., Markov, I., Hayes, J.: Optimal Synthesis of Linear Reversible Circuits. Quantum Information and Computation 8(3-4), 282–294 (2008)

    MathSciNet  MATH  Google Scholar 

  8. Jain, R.P.: Modern Digital Electronics, pp. 206–207. Tata McGraw Hill, New York (2003)

    Google Scholar 

  9. Schmookler, M.S., Weinberger, A.W.: High Speed Decimal Addition. IEEE Trans. Computers C-20, 862–867 (1971)

    Article  MATH  Google Scholar 

  10. Erle, M.A., Schulte, M.J.: Decimal Multiplication Via Carry-Save Addition. In: Proc. of the Application-Specific Systems, Architectures, and Processors (ASAP 2003), pp. 348–359 (2003)

    Google Scholar 

  11. Pai, Y.T., Chen, Y.K.: The Fastest Carry Look ahead Adder. In: Proc. of the Second IEEE International Workshop on Electronic Design, Test and Applications (DELTA 2004), pp. 434–436 (2004)

    Google Scholar 

  12. Fredkin, E., Toffoli, T.: Conservative Logic. Int. J. Theor. Phys. 21(3–4), 219–253 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  13. Toffoli, T.: Reversible Computing. Tech memo MIT/LCS/TM-151, MIT Lab for Computer Science (1980)

    Google Scholar 

  14. Khan, M.M.H.A.: Design of Full adder with Reversible Gates. In: Proc. of International Conf. on Computer and Information Technology, pp. 515–519 (2002)

    Google Scholar 

  15. Peres, A.: Reversible Logic and Quantum Computers. Physical Review A 32, 3266–3276 (1985)

    Article  MathSciNet  Google Scholar 

  16. Thapliyal, H., Srinivas, M.B.: A Novel Reversible TSG Gate and Its Application for Designing Reversible Carry Look Ahead Adder and Other Adder Architectures. In: Srikanthan, T., Xue, J., Chang, C.-H. (eds.) ACSAC 2005. LNCS, vol. 3740, pp. 805–817. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Thapliyal, H., Srinivas, M.B.: Novel Design and Reversible Logic Synthesis of Multiplexer Based Full Adder and Multipliers. In: Proc. 48th IEEE MIDWEST Symposium on Circuits and Systems (MWSCAS 2005), pp. 1593–1596 (2005)

    Google Scholar 

  18. Babu, H.M.H., Chowdhury, A.R.: Design of a compact reversible binary coded decimal adder circuit. Journal of Systems Architecture 52(5), 257–314 (2006)

    Article  Google Scholar 

  19. Thapliyal, H., Vinod, A.P.: Design of reversible sequential elements with feasibility of transistor implementation. In: Proc. ISCAS 2007, pp. 625–628 (2007)

    Google Scholar 

  20. ISE WebPACK Software, http://www.xilinx.com/ise/logic_design_prod/webpack.htm

  21. Desoete, B., De Vos, A.: A reversible carry-look-ahead adder using control gates. Integration: the V.L.S.I. Journal 33, 89–104 (2002)

    MATH  Google Scholar 

  22. Van Rentergem, Y., De Vos, A.: Optimal design of a reversible full adder. Journal of Unconventional Computing 1, 339–355 (2005)

    Google Scholar 

  23. HSPICE, http://www.synopsys.com/products/mixedsignal/hspice/hspice.html

  24. Active HDL, http://www.aldec.com/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Thapliyal, H., Arabnia, H.R., Srinivas, M.B. (2009). Efficient Reversible Logic Design of BCD Subtractors. In: Gavrilova, M.L., Tan, C.J.K. (eds) Transactions on Computational Science III. Lecture Notes in Computer Science, vol 5300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00212-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00212-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00211-3

  • Online ISBN: 978-3-642-00212-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics