10.57647/j.spre.2025.0903.16

Optimized Reversible Parity-Preserving Multiplier Circuits in Nanotechnology

  1. Department of Computer Engineering, Dez.C., Islamic Azad University, Dezful, Iran
  2. Department of Computer Engineering, MaS.C., Islamic Azad University, Masjed Soleiman, Iran
  3. Department of Computer Engineering, Dez.C., Islamic Azad University, Dezful, Iran.

Received: 2025-06-18

Revised: 2025-07-21

Accepted: 2025-08-20

Published in Issue 2025-10-27

How to Cite

Mappar, M., pouraliakbar, ehsan, MehranZadeh, A. ., & Mosleh, M. . (2025). Optimized Reversible Parity-Preserving Multiplier Circuits in Nanotechnology. Signal Processing and Renewable Energy (SPRE), 9(3 (September 2025). https://doi.org/10.57647/j.spre.2025.0903.16

PDF views: 56

Abstract

Reversible logic, as one of the new technologies, plays a significant role in designing quantum computers due to the absence of energy loss, as well as using reversible circuits in low-power CMOS circuits, quantum calculations, and DNA computing. Multipliers are among the most critical circuits in computer calculations. This study proposes an optimized unsigned and signed reversible parity-preserving multiplier circuit. In addition, this study seeks to present a reversible block, as well as reversible signed and unsigned multiplier circuits using the presented block and the proposed design. The presented circuits reduce the quantum cost and are considered parity-preserving. In order to utilize the designs presented in variable sizes, two circuits in n×n sizes are provided. Further, a number of equations are presented to calculate the quantum costs, along with the number of constant inputs and garbage outputs in the proposed circuits.

Keywords

  • Quantum computing,
  • Signed multiplier,
  • Reversible multiplier,
  • Reversible logic,
  • Parity-preserving,
  • Unsigned multiplier

References

  1. R. Landauer. “Irreversibility and heat generation in the computing process.”. IBM journal of research and development, 5(3):183-191, 1961, doi: 10.1147/rd.53.0183.
  2. C.H. Bennett. “Logical reversibility of computation,”. IBM journal of Research and Development, 17(6):525-532, 1973, doi: 10.1147/rd.176.0525.
  3. M. Perkowski, L. Jozwiak, P. Kerntopf, A. Mishchenko, A. Al-Rabadi, A. Coppola, A. Buller, X. Song, S. Yanushkevich, VP. Shmerko, and M. Chrzanowska-Jeske. “A general decomposition for reversible logic,”. In: Proc. RM, pages 119–38, 2001.
  4. W.C. Athas, and L. Svensson. “Reversible logic issues in adiabatic CMOS,”. In Proceedings Workshop on Physics and Computation. PhysComp'94, pages 111-118, 1994, doi: 10.1109/PHYCMP.1994.363692.
  5. A. Sarker, T. Ahmed, SM. Rashid, S. Anwar, L. Jaman, N. Tara, MM. Alam, and HM. Babu. “Realization of reversible logic in DNA computing,”. in: 11th International Conference on Bioinformatics and Bioengineering (BIBE), pages 261–265, 2011, doi: 10.1109/BIBE.2011.46.
  6. S. Kotiyal, H. Thapliyal, and N. Ranganathan. “Efficient reversible NOR gates and their mapping in optical computing domain,”. Microelectronics Journal, 45(6):825–834, 2014, doi: 10.1016/j.mejo.2014.03.001.
  7. T.N. Sasamal, A.K. Singh, and A. Mohan. “Efficient design of reversible alu in quantum-dot cellular automata,”. Optik-International Journal for Light and Electron Optics, 127(15):6172–6182, 2016, doi: 10.1016/j.ijleo.2016.04.086.
  8. K. Bhardwaj, and M. Deshpande. “K-Algorithm: an improved Booth’s recoding for optimal fault tolerant reversible multiplier,”. In 2013 26th International Conference on VLSI Design and 2013 12th International Conference on Embedded Systems, pages 362–367, 2013, doi: 10.1109/VLSID.2013.215.
  9. X.-D. Cai, D. Wu, Z.-E. Su, M.-C. Chen, X.-L. Wang, L. Li, N.-L. Liu, C.-Y. Lu and J.-W. Pan. “Entanglement-based machine learning on a quantum computer,”. Physical review letters, 114(11): 110504, 2015, doi: 10.1103/PhysRevLett.114.110504.
  10. M. Haghparast, M. Mohammadi, K. Navi, and M. Eshghi. “Optimized reversible multiplier circuit,”. Journal of Circuits Systems and Computers, 18(02):311-323, 2009, doi: 10.1142/S0218126609005083.
  11. A.P. Hatkar, A.A. Hatkar, and N.P. Narkhede. “ASIC design of reversible multiplier circuit,”. In: Proceedings of International Conference on Electronic Systems, Signal Processing and Computing Technologies, pages 47–52, 2014, doi: 10.1109/ICESC.2014.16.
  12. M.S. Islam, M.M. Rahman, Z. Begum, and M.Z. Hafiz. “Fault tolerant reversible logic synthesis: carry look-ahead and carry skip adders,”. In: International Conference on Advances in Computational Tools for Engineering Applications (ACTEA), pages 396–401, 2009, doi: 10.1109/ACTEA.2009.5227871.
  13. M.V. Jigalur, and M. S. Meharunnis. “Efficient reversible multiplier using column bypass technique for dsp applications,”. International Journal of Engineering Research and General Science, 3(1):91-97, 2015.
  14. S. Kotiyal, H. Thapliyal, and N. Ranganathan. “Reversible logic based multiplication computing unit using binary tree data structure,”. The Journal of Supercomputing, 71(7):2668-2693, 2015, doi: 10.1007/s11227-015-1410-3.
  15. S. Kotiyal, H. Thapliyal, and N. Ranganathan. “Circuit for reversible quantum multiplier based on binary tree optimizing Ancilla and Garbage bits,”. In 2014 27th international conference on VLSI design and 2014 13th international conference on embedded systems, pages 545–550, 2014, doi: 10.1109/VLSID.2014.101.
  16. M.Z. Moghadam, and K. Navi. “Ultra-area-efficient reversible multiplier,”. Microelectronics Journal, 43(6):377-385, 2012, doi: 10.1016/j.mejo.2012.02.004.
  17. V.G. Moshnyaga. “Design of minimum complexity reversible multiplier,”. In TENCON 2015-2015 IEEE Region 10 Conference, pages 1–4, 2015, doi: 10.1109/TENCON.2015.7373120.
  18. E. PourAliAkbar, M. Haghparast, and K. Navi. “Novel design of a fast reversible Wallace sign multiplier circuit in nanotechnology,” Microelectronics Journal, 42(8):973-981, 2011, doi: 10.1016/j.mejo.2011.05.007.
  19. E. PourAliAkbar, and M. Mosleh. “An Efficient Design for Reversible Wallace Unsigned Multiplier,”. Theoretical Computer Science, 733:43-52, 2019, doi: 10.1016/j.tcs.2018.06.007.
  20. X. Qi, F. Chen K. Zuo, L. Guo, Y. Luo, and M. Hu. “Design of fast fault tolerant reversible signed multiplier,”. International Journal of the Physical Sciences, 7(17):2506– 2514, 2012, doi: 10.5897/IJPS12.213.
  21. E. PourAliAkbar, K. Navi, M. Haghparast and M. Reshadi. “Novel optimum parity-preserving reversible multiplier circuits,”. Circuits, Systems, and Signal Processing, 39:5148-5168, 2020, doi: 10.1007/s00034-020-01406-w.
  22. H. Thapliyal, and M.B. Srinivas. “Novel Reversible multiplier Architecture Using Reversible TSG Gate,”. arXiv preprint cs/0605004, pages 100-103, 2006, doi: 10.48550/arXiv.cs/0605004.
  23. M. Valinataj. “Novel parity-preserving reversible logic array multipliers,”. The journal of supercomputing, 73(11):4843-4867, 2017, doi: 10.1007/s11227-017-2057-z.
  24. R. Zhou, Y. Shi, H. Wanga, and J. Cao. “Transistor realization of reversible “ZS” series gates and reversible array multiplier,”. Microelectronics Journal, 42(2):305–315, 2011, doi: 10.1016/j.mejo.2010.11.008.
  25. S. Babazadeh, and M. Haghparast. “Design of a nanometric fault tolerant reversible multiplier circuit,”. J Basic Appl Sci Res, 2(2):1355–1361, 2012.
  26. M. Shams, M. Haghparast, and K. Navi. “Novel reversible multiplier circuit in nanotechnology,”. World Appl. Sci. J, 3(5):806–810, 2008.
  27. M. Haghparast, S.J. Jassbi, K. Navi, and O. Hashemipour. “Design of a novel reversible multiplier circuit using HNG gate in nanotechnology,”. World Applied Science Journal, 3(6):974–978, 2008.
  28. M.S. Islam, M.M. Rahman, Z. Begum, and M.Z. Hafiz. “Low cost quantum realization of reversible multiplier circuit,”. Information Technology Journal, 8(2):208–213, 2009, doi: 10.3923/itj.2009.208.213.
  29. L. Jamal, M.M. Rahman, and H.M.H. Babu. “An optimal design of a fault tolerant reversible multiplier,”. In 2013 IEEE International SOC Conference, pages 37–42, 2013, doi: 10.1109/SOCC.2013.6749657.
  30. MA. Asadi, M. Mosleh, and M. Haghparast. “Towards designing quantum reversible ternary multipliers,”. Quantum Inf Process, 20(7):226, 2021, doi: 10.1007/s11128-021-03161-6.
  31. Z. Ariafar, and M. Mosleh. “Effective Designs of Reversible Vedic Multiplier,”. international Journal of Theoretical Physics, 58(8):2556–2574, 2019, doi:10.1007/s10773-019-04145-0.
  32. M. Rashno, M. Haghparast, and M. Mosleh. “Designing of Parity Preserving Reversible Vedic Multiplier,”. International Journal of Theoretical Physics, 60(8):3024–3040, 2021, doi: 10.1007/s10773-021-04903-z.
  33. D. Maslov, and G.W. Dueck. “Reversible cascades with minimal garbage,”. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 23(11):1497–1509, 2004, doi: 10.1109/TCAD.2004.836735.
  34. H. Thapliyal, and M.B. Srinivas. “Novel reversible TSG gate and its application for designing reversible carry look ahead adder and other adder architectures,”. Asia-Pacific conference on advances in computer systems architecture. Berlin, Heidelberg: Springer Berlin Heidelberg, pages 775-786, 2005, doi: 10.1007/11572961_66.
  35. M.A. Nielsen, I.L. Chuang. “Quantum computation and quantum information,”. Cambridge University Press, Cambridge, 2000.
  36. R. Feynman. “Quantum mechanical computers,”. In Conference on Lasers and Electro-Optics, pages 11–20, 1984, doi: 10.1515/9781400886975-036.
  37. T. Toffoli. “Reversible computing,”. In International colloquium on automata, languages, and programming, pages 632-644, 1980, doi: 10.1007/3-540-10003-2_104.
  38. A. Peres. “Reversible logic and quantum computers,”. Physical review A, 32(6):3266–3276, 1985, doi: 10.1103/PhysRevA.32.3266.
  39. B. Parhami. “Fault-tolerant reversible circuits,”. In 2006 fortieth asilomar conference on signals, systems and computers, pages 1726–1729, 2006, doi: 10.1109/ACSSC.2006.355056.
  40. M. Hagparast, and K. Navi, “A novel fault tolerant reversible gate for Nanotechnology based system,”. Am J Appl Sci, 5(5):519–523, 2008.
  41. E. Fredkin, and T. Toffoli. “Conservative logic,”. International Journal of theoretical physics, 21(3):219–253, 1982, doi: 10.1007/BF01857727.
  42. B. Parhami “Computer Arithmetic–Algorithm and Hardware Designs,”. New York, NY: Oxford University Press, 20(00), 2000.