CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Automatic Synthesis of Reversible Circuits

by Swanti Satsangi, C. Patvardhan, P.K. Kalra
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 140 - Number 11
Year of Publication: 2016
Authors: Swanti Satsangi, C. Patvardhan, P.K. Kalra
10.5120/ijca2016909518

Swanti Satsangi, C. Patvardhan, P.K. Kalra . Automatic Synthesis of Reversible Circuits. International Journal of Computer Applications. 140, 11 ( April 2016), 31-36. DOI=10.5120/ijca2016909518

@article{ 10.5120/ijca2016909518,
author = { Swanti Satsangi, C. Patvardhan, P.K. Kalra },
title = { Automatic Synthesis of Reversible Circuits },
journal = { International Journal of Computer Applications },
issue_date = { April 2016 },
volume = { 140 },
number = { 11 },
month = { April },
year = { 2016 },
issn = { 0975-8887 },
pages = { 31-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume140/number11/24641-2016909518/ },
doi = { 10.5120/ijca2016909518 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:42:02.118703+05:30
%A Swanti Satsangi
%A C. Patvardhan
%A P.K. Kalra
%T Automatic Synthesis of Reversible Circuits
%J International Journal of Computer Applications
%@ 0975-8887
%V 140
%N 11
%P 31-36
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The design of reversible systems significantly differs from their conventional counterparts therefore Evolutionary algorithms have been explored in the past for the purpose. In this work, the Enhanced Quantum inspired Evolutionary algorithm is employed for synthesis of various digital and benchmark circuits and its comparative performance analysis with other evolutionary algorithms as well as existing search and optimization techniques is presented. It is shown that the proposed enhanced Quantum inspired Evolutionary algorithm not only possesses a better exploration capacity but also performs faster than other techniques.

References
  1. Aoki T., Homma N., and Higuchi T., 2003, Evolutionary Synthesis of Arithmetic Circuit Structures, Artificial Intelligence Review, Vol. 20, pp. 199–232.
  2. Bruce J. W., Thornton M. A., Shivakumaraiah L., Kokate P. S., and Li X., 2002, Efficient adder circuits based on a conservative reversible logic gate, Proceedings of IEEE Symposium on VLSI, pp. 83–88.
  3. Cheng K. W. and Tseng C. C. , 2002, Quantum full adder and sub-tractor, Electronics Letters, Vol. 38, No. 22, pp. 1343– 1344.
  4. Datta K., Sengupta I., 2012, and Rahaman H., Reversible circuit synthesis using evolutionary algorithm. In 5th International Conference on Computers and Devices for Communication (CODEC), pp 1–4.
  5. Ding S., Jin Z. and Yang Q. ,2008, Evolving quantum circuits at the gate level with a hybrid quantum-inspired evolutionary algorithm, Journal of Soft Computing.
  6. Dubey V., Singh O. P., Mishra G.R., 2012, Design and Implementation of a Two-Bit Binary Comparator using Reversible Logic, International Journal of Scientific and Research Publications, Vol. 2, No 7.
  7. Eftakhar S. M. A, Habib S. K. M. and Hashem M. M. A., 2013, Evolutionary Design of Digital Circuits Using Genetic Programming.
  8. Gandhi M. and Devishree J., 2013., Design of Reversible Code Converters for Quantum Computer based Systems, International Journal of Computer Applications, No. 3.
  9. Gupta N. J. P. and Agrawal A., 2006, An algorithm for synthesis of reversible logic circuits,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 25, pp. 2317–2330.
  10. Haghparast M., Jassbi S., Navi K., and Hashemipour O., 2008, “Design of a novel reversible multiplier circuit using HNG gate in nanotechnology, World Applied Science Journal, Vol. 3, No. 6, pp. 974–978.
  11. Haghparast M., Hajizadeh M., Hajizadeh R. and Bashiri R., 2011, On the Synthesis of Different Nanometric Reversible Converters, Middle-East Journal of Scientific Research, Vol. 7, No. 5, pp. 715-720.
  12. K. H. Han and J. H. Kim, 2002, Quantum-Inspired Evolutionary Algorithm for a Class of Combinatorial Optimization, IEEE Transactions On Evolutionary Computation, Vol. 6, No. 6.
  13. Khan M., 2002, Design of full-adder with reversible gates, Proc. International Conference on Computer and Information Technology, pp. 515–519.
  14. Li M, Zheng Y., Hsiao M. S, Huang C., 2010, Reversible logic synthesis through ant colony optimization. Design Automation Test in Europe, pp. 208–212.
  15. Lukac, M., Perkowski, M., 2002, Evolving quantum circuits using genetic algorithm. Proceedings of the NASA/DOD Conference on Evolvable Hardware.
  16. Lukac M., Perkowski M. and Kameyama M., 2011, Evolutionary Quantum Logic Synthesis of Boolean Reversible Logic Circuits Embedded in Ternary Quantum Space using Heuristics, arxiv: 1107.3383v1, [quant-ph].
  17. Miller J. F, Thompson P. and Fogarty T. C., 1997, Designing electronic circuits using Evolutionary Algorithms. Arithmetic Circuits: A case study, Recent Advancements and Industrial Applications, John Wiley & Sons.
  18. Nielson M. A. and Chuang I. L. 2000, Quantum Computing and Quantum Information. Cambridge University Press.
  19. Plenio M. B. and Vitelli V., 2001, The physics of forgetting: Landauer’s erasure principle and information theory, Contemporary Physics, Vol. 42, No. 1, pps 25-60.
  20. Rentergem V. and Vos, A., 2005, Optimal design of a reversible full adder. International Journal of Unconventional Computing, Vol. 1, No. 4, pp. 339.
  21. Online resource for reversible benchmark: http://www.revlib.org/
  22. Saeedi M. S. Z. M. and Sedighi M., 2008, Moving forward: A non-search based synthesis method toward efficient cnot-based quantum circuit synthesis algorithms. ASPDAC, pp. 83–88.
  23. Saravanan M., Suresh K. and Uma S., 2013, Novel Reversible Code Converters Using Reversible Logic Gates, International Journal of Electrical and Electronics, Engineering Research, Vol. 3, No. 3, pp. 161-166.
  24. Sarkar, M., Ghosal, P., and Mohanty, S. P., 2013, Reversible circuit synthesis using aco and sa based quine-mccluskey method. In International Midwest Symposium on Circuits and Systems, pp. 416-419.
  25. Sasamala T. N., Singh A. K. and Mohan A., 2015, Reversible Logic Circuit Synthesis and Optimization using Adaptive Genetic Algorithm, 4thInternational Conference on Eco-friendly Computing and Communication Systems, Procedia Computer Science, Vol. 70, pp. 407 – 413.
  26. Satsangi S., Gulati A., Kalra P. K, and Patvardhan C., 2012, Application of Genetic Algorithms for Evolution of Quantum Equivalents of Boolean Circuits, International Journal of Electrical, Computer, Electronics and Communication Engineering, Vol. 6, No. 3, 275 - 279.
  27. Satsangi S. and Patvardhan C., 2015, Design of Reversible Quantum Equivalents of Classical Circuits Using Hybrid Quantum Inspired Evolutionary Algorithm, Advanced Computing Conference, pp. 258-262.
  28. Satsangi S. and Patvardhan C., 2016, Enhanced Quantum Inspired Evolutionary Algorithm For Automatic synthesis of Reversible Circuits, International Journal of Engineering Technology Science and Research, Volume 3, Issue 1, pp. 34 - 45.
Index Terms

Computer Science
Information Sciences

Keywords

Evolutionary Algorithms Quantum Inspired Evolutionary Algorithm Reversible Circuit Synthesis Quantum Circuits Binary to Gray Code Converters.

Powered by PhDFocusTM