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

Authors:
David Y. Feinstein;Mitchell A. Thornton;D. Michael Miller
Affiliations:
Southern Methodist University, Dallas, TX;Southern Methodist University, Dallas, TX;University of Victoria, Victoria, BC, Canada
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
2008

Citing 8
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Verifying the correctness of FPGA logic synthesis algorithms

FPGA '03 Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays
A transformation based algorithm for reversible logic synthesis

Proceedings of the 40th annual Design Automation Conference
Static Property Checking Using ATPG v.s. BDD Techniques

ITC '00 Proceedings of the 2000 IEEE International Test Conference
QMDD: A Decision Diagram Structure for Reversible and Quantum Circuits

ISMVL '06 Proceedings of the 36th International Symposium on Multiple-Valued Logic
An Information Theoretic Approach to Digital Fault Testing

IEEE Transactions on Computers
Advances in Quantum Computing Fault Tolerance and Testing

HASE '07 Proceedings of the 10th IEEE High Assurance Systems Engineering Symposium
Fault testing for reversible circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

BDD-based synthesis of reversible logic for large functions

Proceedings of the 46th Annual Design Automation Conference
Debugging of Toffoli networks

Proceedings of the Conference on Design, Automation and Test in Europe
Debugging reversible circuits

Integration, the VLSI Journal
BDD-Based Synthesis of Reversible Logic

International Journal of Applied Metaheuristic Computing

Quantified Score

Hi-index	0.00

Visualization

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.