This Article 
 Bibliographic References 
 Add to: 
Suggestion for a New Representation for Binary Function
December 1996 (vol. 45 no. 12)
pp. 1445-1449

Abstract—The widely used method for Boolean function representation, called Binary Decision Diagram (BDD), and its variation, the Ordered Binary Decision Diagram (OBDD), occasionally become time and space consuming for efficient manipulations with increase of number of its input variables. It would appear intuitively that a more efficient approach can be derived by viewing the function from the perspective of its output values.

In this paper, such an approach based on the concept of input implicit/output explicit representation is developed. These output value array graphs (OVAGs) are derived for some sample circuits to illustrate their compact size. These are, however, preliminary results and additional research is needed to fully demonstrate the usefulness of OVAGs.

[1] R.E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, Vol. C-35, No. 8, Aug. 1986, pp. 667-690.
[2] M. Fujita, H. Fujisawa, and N. Kawato, "Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams," Proc. ICCAD, IEEE CS Press, 1988, pp. 2-5.
[3] M.A. Heap and M.R. Mercer, "Least Upper Bounds on OBDD Sizes," IEEE Trans. Computers, vol. 43, no. 6, June 1994.
[4] S. Malik, A.R. Wang, R.K. Brayton, and A. Sangiovanni-Vincentelli, Logic Verification Using Binary Decision Diagrams in a Logic Synthesis Environment Proc. IEEE Int'l Conf. Computer-Aided Design (ICCAD-88), pp. 6-9, 1988.

Index Terms:
Implicit and explicit representation for Boolean function, ordered binary decision diagram, parallel operation.
Honghai Jiang, Jay C. Majithia, "Suggestion for a New Representation for Binary Function," IEEE Transactions on Computers, vol. 45, no. 12, pp. 1445-1449, Dec. 1996, doi:10.1109/12.545975
Usage of this product signifies your acceptance of the Terms of Use.