Title :
Observability don´t care sets and Boolean relations
Author :
Damiani, M. ; De Micheli, G.
Author_Institution :
Center for Integrated Syst., Stanford Univ., CA, USA
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 :
Boolean algebra; combinatorial circuits; equivalence classes; Boolean relations; combinatorial network; equivalence classes; observability don´t care; Circuit simulation; Combinational circuits; Computational modeling; Computer networks; Explosions; Logic gates; Minimization; Network synthesis; Observability; Testing;
Conference_Titel :
Computer-Aided Design, 1990. ICCAD-90. Digest of Technical Papers., 1990 IEEE International Conference on
Conference_Location :
Santa Clara, CA, USA
Print_ISBN :
0-8186-2055-2
DOI :
10.1109/ICCAD.1990.129965
