Observability don't care sets and Boolean relations
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
An algorithm is presented that computes exact or approximate observability don't care (ODC) sets for a multiple-level combinatorial network. The proposed algorithms are efficient because they use only local information. A method for deriving the equivalence classes of a Boolean relation from the ODC sets is then proposed. Experimental results on computing ODC sets are reported.Keywords
This publication has 4 references indexed in Scilit:
- The transduction method-design of logic networks based on permissible functionsIEEE Transactions on Computers, 1989
- MIS: A Multiple-Level Logic Optimization SystemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Logic Testing and Design for TestabilityPublished by MIT Press ,1985
- Path Sensitization, Partial Boolean Difference, and Automated Fault DiagnosisIEEE Transactions on Computers, 1972