skip to main content
10.1145/1403375.1403707acmconferencesArticle/Chapter ViewAbstractPublication PagesdateConference Proceedingsconference-collections
research-article

Partially redundant logic detection using symbolic equivalence checking in reversible and irreversible logic circuits

Published:10 March 2008Publication History

ABSTRACT

This paper investigates partially redundant logic detection and gate modification coverage in both reversible and irreversible (classical) logic circuits. Our methodology is to repeatedly compare a benchmark circuit with a modified copy of itself using an equivalence checker. We have found many instances in the irreversible logic ISCAS85 benchmarks where single gate replacements were not detected, indicating no change in functionality after gate replacement. In contrast, we demonstrate that the Maslov reversible and quantum logic benchmarks exhibit very high gate modification fault coverage, in line with the expectation that reversible circuits, which implement bijective functions, have maximal information content.

References

  1. V. D. Agrawal, "An information theoretic approach to digital fault testing,", In IEEE Trans. Comp,. Vol. 30, pp. 582--587, 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. E. Bryant. "Graph-Based Algorithms for Boolean Function Manipulation". In IEEE Trans. Comp, C-35(8):677--691, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Y. Feinstein, V. S. S. Nair, and M. A. Thornton, "Advances in Quantum Computing Fault Tolerance and Testing", In Proc of High Assurance System Engineering Symposium,. pp. 369--370, Nov. 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C-Y. Huang, B. Yang, H-C Tsai and K-T Cheng, "Static Property Checking Using ATPG v.s. BDD Techniques", 2000 Proceeding of International Test Conference, pages 309--316. 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Maslov. Reversible logic synthesis benchmarks page. Online: http://www.cs.uvic.ca/~dmaslov/, Nov. 15, 2005.Google ScholarGoogle Scholar
  6. D. M. Miller, D. Maslov, and G. W. Dueck. "A transformation based algorithm for reversible logic synthesis". In DAC'03, pp. 318--323, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. M. Miller and M. A. Thornton, "QMDD: A Decision Diagram Structure for Reversible and Quantum Circuits", In ISMVL'06, on CD, May 17--20, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. D. M. Miller, D. Y. Feinstein, and M. A. Thornton, "QMDD Minimization using Sifting for Variable Reordering", In Journal of Multiple-valued Logic and Soft Computing. pp. 537--552., 2007.Google ScholarGoogle Scholar
  9. K. N. Patel, J. P. Hayes, and I. L. Markov, "Fault testing for reversible logic", In IEEE Trans. on CAD of IC and Systems, Vol. 23, No. 8, pp. 1220--1230, August 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. Ratchev, M. Hutton, G. Baeckler and B. van Antwerpen, "Logic synthesis and mapping: Verifying the correctness of FPGA logic synthesis algorithms", In Proc ACM/SIGDA 11th international symposium on Field programmable gate arrays, Feb. 2003 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. F. Somenzi, "The CUDD Package", University of Colorado at Boulder, Version 3.2.1 available at: http://vlsi.colorado.edu/~fabio/.Google ScholarGoogle Scholar

Index Terms

  1. Partially redundant logic detection using symbolic equivalence checking in reversible and irreversible logic circuits

      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
      • Published in

        cover image ACM Conferences
        DATE '08: Proceedings of the conference on Design, automation and test in Europe
        March 2008
        1575 pages
        ISBN:9783981080131
        DOI:10.1145/1403375

        Copyright © 2008 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: 10 March 2008

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate518of1,794submissions,29%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader