Multi-level Logic Optimization By Implication Analysis
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636757,p. 6-13
- https://doi.org/10.1109/iccad.1994.629735
Abstract
This paper proposes a new approach to multi-level logic optimization based on ATPG (Automatic Test Pattern Generation). Previous ATPG-based methods for logic minimization suffered from the limitation that they were quite restricted in the set of possible circuit transformations. We show that the ATPG-based method presented here allows (in principle) the transformation of a given combinational network C into an arbitrary, structurally different but functionally equivalent combinational network C'. Furthermore, powerful heuristics are presented in order to decide what network manipulations are promising for minimizing the circuit. By identifying indirect implications between signals in the circuit, transformations can be derived which are “good” candidates for the minimization of the circuit. In particular, it is shown that Recursive Learning can derive “good” Boolean divisors justifying the effort to attempt a Boolean division. For 9 out of 10 ISCAS-85 benchmark circuits our tool HANNIBAL obtains smaller circuits than the well-known synthesis system SIS.Keywords
This publication has 20 references indexed in Scilit:
- ON THE ACCELERATION OF TEST GENERATION ALGORlTHMSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Recursive Learning: An attractive alternative to the decision tree for test generation in digital ciPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Performance enhancements in BOLD using 'implications'Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Verification of large synthesized designsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- HANNIBAL: An efficient tool for logic verification based on recursive learningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A method to calculate necessary assignments in algorithmic test pattern generationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Recursive learning: a new implication technique for efficient solutions to CAD problems-test, verification, and optimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- Einführung in die InformatikPublished by Springer Nature ,1990
- The transduction method-design of logic networks based on permissible functionsIEEE Transactions on Computers, 1989
- Redundancy and Don't Cares in Logic SynthesisIEEE Transactions on Computers, 1983