This Article 
 Bibliographic References 
 Add to: 
On the OBDD-Representation of General Boolean Functions
June 1992 (vol. 41 no. 6)
pp. 661-664

The behavior of ordered binary decision diagrams (OBDD) for general Boolean functions is studied. A tight upper bound of (2/sup n//n)(2+ epsilon ) for the worst case OBDD size is derived. Although the size of an OBDD is dependent on the ordering of decision variables, it is shown that almost all functions are not sensitive to variable ordering.

[1] R. E. Bryant, "Graph-based algorithms for Boolean function manipulation,"IEEE Trans. Comput., vol. C-35, no. 8, pp. 677-691, Aug. 1986.
[2] M. Fujita, H. Fujisawa, and N. Kawato, "Evaluations and improvements of a Boolean comparison program based on binary decision diagrams," inProc. Int. Conf. Comput.-Aided Design, 1988, pp. 2-5.
[3] S. Malik, A. Wang, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Logic verification using binary decision diagrams in a logic synthesis environment," inProc. Int. Conf. Comput.-Aided Design, 1988, pp. 6-9.
[4] C. L. Berman, "Ordered binary decision diagrams and circuit structure," inProc. ICCD, 1989, pp. 392-395.
[5] H. T. Liaw and C. S. Lin, "On the OBDD-representation of general boolean functions," NSC Rep., NSC79-0404-E002-35, July 1990.
[6] D. E. Muller, "Complexity in electronic switching circuits,"IRE Trans. Electron. Comput., vol. EC-5, pp. 15-19, Mar. 1956.
[7] C. E. Shannon, "The synthesis of two-terminal switching circuits,"AT&T Bell Syst. Tech. J., vol. 28, Jan. 1949.
[8] M. A. Harrison,Introduction to Switching and Automata Theory. New York: McGraw-Hill, 1965, ch. 7.

Index Terms:
general Boolean functions; ordered binary decision diagrams; tight upper bound; Boolean functions; computational complexity.
Heh-Tyan Liaw, Chen-Shang Lin, "On the OBDD-Representation of General Boolean Functions," IEEE Transactions on Computers, vol. 41, no. 6, pp. 661-664, June 1992, doi:10.1109/12.144618
Usage of this product signifies your acceptance of the Terms of Use.