Applications of circuit probability computation using decision diagrams

Digital circuit output probabilities provide meaningful information regarding the behavior of combinational logic circuits. The computation of the probability values can be computationally expensive when Boolean equations or netlists are used. When the circuits are represented by compact decision diagrams (DD), efficient algorithms exist for determining the probability values. The use of the probabilities based on decision diagram representations are examined in the paper. Specifically, research results of investigations into spectra computation, synthesis, symmetry detection and DD reordering are surveyed