Computation of spectral information from logic netlists

Spectral information can be used for many CAD system tasks including synthesis, verification and test vector generation. We analyze the problem of extracting spectral information from Boolean and multi-valued logic netlists. It is shown that spectral information may be calculated directly from output probabilities and a method for extracting output probabilities from general graphs is described. As a special case, we consider AND/OR graphs which are a data structure recently proposed as an alternative to decision diagrams. Experimental results are given to demonstrate the efficiency of our approach.