|
Abstract : |
A new algorithm is presented that computes exact or approximate observability don't care (ODC) sets for multiple-level combinational 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 observability don't care sets is then proposed. Experimental results on computing ODC sets are reported. 1 Introduction. Over the past few years, the problem of computing efficiently and correctly observability don't care (ODC) sets has emerged as a central one in the synthesis of combinational networks [1], [2], [3]. The knowledge, |
