Functional Comparison of Logic Designs for VLSI Circuits
Determining whether or not two circuits are functionally equivalent is of fundamental importance in many phases of the design of computer logic. We describe a new method for circuit equivalence which proceeds by reducing the question of whether two circuits are equivalent to a number of more easily answered questions concerning the equivalence of smaller, related circuits. This method can be used to extend the power of any given equivalence-checking algorithm. We report the results of experiments evaluating our technique.
Unable to display preview. Download preview PDF.
- C. Leonard Berman, “On Logic Comparison”,Proc. 18th DAC, Nashville, TN, 1981.Google Scholar
- C. Leonard Berman, “Ordered Binary Decision Diagrams and Circuit Structure”, Proc. of the ICCD,Cambridge, MA, Oct 214, 1989.Google Scholar
- Steven A. Cook, “The complexity of theorem proving procedures”,Proc 3rd ACM SIGACT, pp. 151–158, 1971.Google Scholar
- W.E. Donath and H. Ofek, “Automatic Identification of Equivalence Points for Boolean Logic Verification”, IBM Tech. Discolsure Bulletin, vol. 18, pp.2700–2703,1976Google Scholar
- M. Fujita,H. Fujiwara and N. Kawato,“Evaluation and Improvements of Boolean Comparison Method based on Binary Decision Diagrams”,Proceeding of ICCAD, Nov 1988.Google Scholar
- Sharad Malik, Albert R. Wang, Robert K. Brayton and Alberto Sangiovanni-Vincentelli, “Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment”, Proceedings of ICCAD, Nov 1988.Google Scholar