skip to main content
research-article

An Improved Reversible Circuit Synthesis Approach using Clustering of ESOP Cubes

Authors Info & Claims
Published:18 November 2014Publication History
Skip Abstract Section

Abstract

The problem of reversible logic synthesis has drawn the attention of many researchers over the last two decades with growing emphasis on low-power design. Among the various synthesis approaches that have been reported, the ones based on compact circuit representations like Binary Decision Diagrams (BDD) and Exclusive-or Sum-Of-Products (ESOP) are interesting in the sense that they can handle large circuits with more than 100 inputs. The drawback of these approaches, however, is that the generated netlists are sub-optimal, and there is lot of scope for optimizing them. One of the best methods in this regard is an approach, where the ESOP cubes are grouped into sublists based on sharing among more than one outputs. In the work reported in this article, in contrast, an approach based on clustering the ESOP cubes based on their similarity with respect to input variables is presented, along with a technique to map each of the clusters into reversible gate netlists. This approach results in a significant reduction in quantum cost of the final netlist, but requires one additional garbage line. Experimental results on a number of reversible circuit benchmarks have been presented in support of the claim and also demonstrate that the method is very fast.

References

  1. A. Barenco, H. H. Bennett, R. Cleve, D. P. DiVinchenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter. 1995. Elementary gates for quantum computation. Phys. Rev. A: Atom. Molecular Optic. Phys. 52, 5 (1995), 3457--3467.Google ScholarGoogle ScholarCross RefCross Ref
  2. C. H. Bennett. 1973. Logical reversibility of computation. J. IBM Res. Develop. 17 (1973), 525--532. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Bèrut, A. Arakelyan, A. Petrosyan, S. Ciliberto, R. Dillenschneider, and E. Lutz. 2012. Experimental verification of Landauer's principle linking information and thermodynamics. Nature 483, 3 (2012), 187--189.Google ScholarGoogle ScholarCross RefCross Ref
  4. K. Datta, G. Rathi, I. Sengupta, and H. Rahaman. 2012. Synthesis of reversible circuits using heuristic search method. In Proceedings of the 25th International Conference on VLSI Design. 328--333. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. K. Datta, I. Sengupta, and H. Rahaman. 2013. Particle swarm optimization based reversible circuit synthesis using mixed control Toffoli gates. J. Low Power Electron. 9, 3 (2013), 363--372.Google ScholarGoogle ScholarCross RefCross Ref
  6. R. Drechsler, A. Finder, and R. Wille. 2011. Improving ESOP-based synthesis of reversible logic using evolutionary algorithms. In Proceedings of the International Conference on Applications of Evolutionary Computation (Part II). 151--161. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. K. Fazel, M. A. Thornton, and J. E. Rice. 2007. ESOP-based Toffoli gate cascade generation. In Proceedings of the IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. 206--209.Google ScholarGoogle Scholar
  8. R. Feynman. 1985. Quantum mechanical computers. Optic News 11 (1985), 11--20.Google ScholarGoogle ScholarCross RefCross Ref
  9. E. Fredkin and T. Toffoli. 1982. Conservative logic. Int. J. Theor. Phys. 21 (1982), 219--253.Google ScholarGoogle ScholarCross RefCross Ref
  10. D. Grosse, R. Wille, G. W. Dueck, and R. Drechsler. 2009. Exact multiple control Toffoli network synthesis with SAT techniques. IEEE Trans. CAD Integr. Circuits Syst. 28, 5 (May 2009), 703--715. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Gupta, A. Agrawal, and N. K. Jha. 2006. An algorithm for synthesis of reversible logic circuits. IEEE Trans. CAD Integr. Circuits Syst. 25, 11 (2006), 2317--2329. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. W. N. N. Hung, X. Song, G. Yang, J. Yang, and M. Perkowski. 2006. Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. CAD Integr. Circuits Syst. 25, 9 (2006), 1652--1663. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. R. Landauer. 1961. Irreversibility and heat generation in computing process. J. IBM Res. Develop. 5 (1961), 183--191. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Maslov and G. W. Dueck. 2006. Level compaction in quantum circuits. In Proceedings of the IEEE Congress on Evolutionary Computation. 2405--2409.Google ScholarGoogle Scholar
  15. D. M. Miller, D. Maslov, and G. W. Dueck. 2003. A transformation based algorithm for reversible logic synthesis. In Proceedings of the Design Automation Conference. 318--323. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. M. Miller and Z. Sasanian. 2012. Recent developments on mapping reversible circuits to quantum gate libraries. In Proceedings of the 3rd International Symposium on Electronic System Design (ISED). Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. D. M. Miller, R. Wille, and R. Drechsler. 2010. Reducing reversible circuit cost by adding lines. In Proceedings of the 40th International Symposium on Multi-Valued Logic. 217--222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Mishchenko and M. Perkowski. 2001. Fast heuristic minimization of exclusive-sums-of-products. In Proceedings of the 6th Reed-Muller Workshop. 242--250.Google ScholarGoogle Scholar
  19. G. E. Moore. 1965. Cramming more components onto integrated circuits. J. Electron. 38, 8 (1965), 183--191.Google ScholarGoogle Scholar
  20. N. Nayeem and J. E. Rice. 2011. A shared-cube approach to ESOP-based synthesis of reversible logic. Facta Universitatis of NiÊ, Elec. Energ. 24, 3 (2011), 385--402.Google ScholarGoogle Scholar
  21. M. Nielsen and I. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. M. Rabaey. 2009. Low Power Design Essentials. Series on Integrated Circuits and Systems, Springer, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. J. E. Rice, K. B. Fazel, M. A. Thornton, and K. B. Kent. 2009. Toffoli gate cascade generation using ESOP minimization and QMDD-based swapping. In Proceedings of the 14th Reed-Muller Workshop. 63--72.Google ScholarGoogle Scholar
  24. J. E. Rice and N. Nayeem. 2011. Ordering techniques for ESOP-based Toffoli cascade generation. In Proceedings of the IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM). 274--279.Google ScholarGoogle Scholar
  25. J. E. Rice and V. Suen. 2010. Using autocorrelation coefficient-based cost functions in ESOP-based Toffoli gate cascade generation. In Proceedings of the 23rd Canadian Conference on Electrical and Computer Engineering (CCECE). 1--6.Google ScholarGoogle Scholar
  26. K. Roy and S. C. Prasad. 2000. Low-Power CMOS VLSI Design. Wiley Interscience.Google ScholarGoogle Scholar
  27. Y. Sanaee and G. W. Dueck. 2009. Generating Toffoli networks from ESOP expressions. In Proceedings of the IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM). 715--719.Google ScholarGoogle Scholar
  28. Y. Sanaee and G. W. Dueck. 2010. ESOP-based Toffoli network generation with transformations. In Proceedings of the 40th International Symposium on Multiple-Valued Logic. 276--281. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. M. Soeken, S. Frehse, R. Wille, and R. Drechsler. 2012. RevKit: An open source toolkit for the design of reversible circuits. In Proceedings of the 3rd International Workshop on Reversible Computation. Lecture Notes in Computer Science, vol. 7185, Springer-Verlag, Berlin, 64--76. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. M. Thomson and R. Gluck. 2008. Optimized reversible binary-coded decimal adders. J. Syst. Architect. 54 (2008), 697--706. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. T. Toffoli. 1980. Reversible computing. In Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 85, Springer, Berlin, 632--644. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. R. Wille and R. Drechsler. 2009. BDD-based synthesis of reversible logic for large functions. In Proceedings of the Design Automation Conference. 270--275. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. R. Wille, D. Grosse, L. Teuber, G. W. Dueck, and R. Drechsler. 2008. RevLib: An online resource for reversible functions and reversible circuits. In Proceedings of the International Symposium on Multi-Valued Logic. 220--225. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. R. Wille, M. Soeken, N. Przigoda, and R. Drechsler. 2012. Exact synthesis of Toffoli gate circuits with negative control lines. In Proceedings of the International Symposium on Multi-Valued Logic. 69--74. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An Improved Reversible Circuit Synthesis Approach using Clustering of ESOP Cubes

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Journal on Emerging Technologies in Computing Systems
      ACM Journal on Emerging Technologies in Computing Systems  Volume 11, Issue 2
      Special Issue on Reversible Computation and Regular Papers
      November 2014
      199 pages
      ISSN:1550-4832
      EISSN:1550-4840
      DOI:10.1145/2686762
      Issue’s Table of Contents

      Copyright © 2014 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 18 November 2014
      • Accepted: 1 April 2014
      • Revised: 1 December 2013
      • Received: 1 September 2013
      Published in jetc Volume 11, Issue 2

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader