Affiliation: | Department of Electrical and Computer EngineeringUniversity of Nevada, Las Vegas Las Vegas, NV 89154, U.S.A. Department of Computer Science Erik Jonsson School of Engineering and Computer Science Box 830688, MS EC 31, University of Texas at Dallas Richardson, TX 75083-0688, U.S.A. Department of Electrical and Computer EngineeringPortland State University P.O. Box 751, Portland, OR 97207-0751, U.S.A. Dép. de Génie Électrique et Génie Informatique Ecole Polytechnique P.O. Box 6079, Station Centre-ville Montreal, Quebec, Canada H3C 3A7 |
Abstract: | In l] and 2], two algorithms have been proposed to calculate the output probability of Boolean functions represented by OBDDs, assuming that the input variables are equiprobable and each variable is statistically independent from others. In this paper, we point out that under these assumptions, the output probability calculation is equivalent to counting the number of minterms of the corresponding Boolean functions. An algorithm is proposed to compute the output probability using simple integer arithmetic as opposed to floating point arithmetic involved in 1,2]. To compute output probability of Boolean functions represented by shared OBDI)s and OBDDs with edge negation, we further propose a generalized algorithm. |