Skip to main content

Natural and Efficient Subtraction Operation in Carry Value Transformation (CVT)-Exclusive OR (XOR) Paradigm

  • Conference paper
  • First Online:
Theory and Practice of Natural Computing (TPNC 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10071))

Included in the following conference series:

Abstract

Carry value transformation (CVT) and Exclusive OR (XOR) operations on two non-negative integers have been defined previously in several articles. In this paper, the definition of CVT and XOR operations are extended from non-negative integer to integer domain. Thereafter various cases of integer pairs towards their convergence behaviour are thoroughly discussed. Our analyses through the convergence behavior of integer pairs are easily directed to capture the natural subtraction operation in this paradigm by representing negative integer in 2’s complement form. The average time complexity of the addition/subtraction operation is seen to be highly competitive in any bulk computation in real life scenario. In other words, in the event of bulk addition/subtraction operation to be performed, the average time complexity is seen to be highly efficient.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Institutional subscriptions

References

  1. Lo, J.C.: A fast binary adder with conditional carry generation. IEEE Trans. Comput. 46(2), 248–253 (1997)

    Article  Google Scholar 

  2. Ercegovac, M., Lang, T.: Digital Arithmetic. Morgan Kaufmann, San Francisco (2004)

    Google Scholar 

  3. Cheng, F.-C., Unger, S.H., Theobald, M.: Self-timed carrylookahead adders. IEEE Trans. Comput. 49(7), 659–672 (2000)

    Article  Google Scholar 

  4. Lynch, T., Swartzlander, E.E.: A spanning tree carry lookahead adder. IEEE Trans. Comput. 41(8), 931–939 (1992)

    Article  Google Scholar 

  5. Lee, H., Sobelman, G.E.: A new low-voltage full adder circuit. In: Proceedings of IEEE Great Lakes Symposium on VLSI, pp. 88–92 (1997)

    Google Scholar 

  6. Rahman, M.Z., Kleeman, L., Habib, M.A.: Recursive approach to the design of a parallel self-timed adder. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 23(1), 213–217 (2015)

    Article  Google Scholar 

  7. Dobson, J.M., Blair, G.M.: Fast two’s complement VLSI adder design. Electron. Lett. 31(20), 1721–1722 (1995)

    Article  Google Scholar 

  8. Chawla, R., Kumar, P., Yadav, P.: Adder circuit design using advanced quantum dot cellular automata (AQCA). In: National Conference on Recent Advances in Electronics and Computer Engineering (RAECE 2015) (2015)

    Google Scholar 

  9. Naziri1, S.Z.M., Ismail1, R.C., Shakaff, A.Y.M.: Arithmetic addition and subtraction function of logarithmic number system in positive region: an investigation. In: 2015 IEEE Student Conference on Research and Development (SCOReD) (2015). 978-1-4673-9572-4/15/$31.00

    Google Scholar 

  10. Hassan, Sk.S., Pal Choudhury, P., Nayak, B.K., Ghosh, A., Banerjee, J.: Integral value transformations: a class of affine discrete dynamical systems and an application. J. Adv. Res. Appl. Math. 7(7), 62–73 (2015)

    Google Scholar 

  11. Pal Choudhury, P., Sahoo, S., Nayak, B.K.: Theory of carry value transformation and its application in fractal formation. In: IEEE International Advance Computing Conference (2009). doi:10.1109/IADCC.2009.4809146

  12. Pal, S., Sahoo, S., Nayak, B.K.: Properties of carry value transformation. Int. J. Math. Math. Sci. 2012, 10 pages (2012). doi:10.1155/2012/174372. Article ID 174372

    Google Scholar 

  13. Das, J.K., Pal Choudhury, P., Sahoo, S.: Multi-number CVT-XOR arithmetic operations in any base system and its significant properties. In: 2016 IEEE 6th International Conference on Advanced Computing (2016). doi:10.1109/IACC.2016.147

  14. Pal Choudhury, P., Sahoo, S., Chakraborty, M.: Implementation of basic arithmetic operations using cellular automata, pp. 79–80. IEEE Computer Society (2008). http://doi.ieeecomputersociety.org/10.1109/ICIT.2008.18

  15. Pal Choudhury, P., Hassan, Sk.S., Sahoo, S., Nayak, B.K.: Act of CVT and EVT in the formation of number theoretic fractals. Int. J. Comput. Cognit. 9(1), 18 (2011). http://www.ijcc.us

  16. Toffoli, T., Margolis, N.: Cellular Automata Machines. MIT Press, Cambridge. MA (1987)

    MATH  Google Scholar 

  17. Das, J.K., Pal Choudhury, P., Sahoo, S.: Carry Value Transformation (CVT) - Exclusive OR (XOR) Tree and Its Significant Properties. https://arxiv.org/pdf/1506.01544v1.pdf

Download references

Acknowledgments

Authors would like to thank Dr. Sudhakar Sahoo (Institute of Mathematics and Applications, Bhubaneswar-751029, India) for his valuable suggestion.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Jayanta Kumar Das or Pabitra Pal Choudhury .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Das, J.K., Pal Choudhury, P., Arora, A. (2016). Natural and Efficient Subtraction Operation in Carry Value Transformation (CVT)-Exclusive OR (XOR) Paradigm. In: Martín-Vide, C., Mizuki, T., Vega-Rodríguez, M. (eds) Theory and Practice of Natural Computing. TPNC 2016. Lecture Notes in Computer Science(), vol 10071. Springer, Cham. https://doi.org/10.1007/978-3-319-49001-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49001-4_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49000-7

  • Online ISBN: 978-3-319-49001-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics