Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Least Upper Bounds on OBDD Sizes
IEEE Transactions on Computers
| Hi-index | 14.98 |
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.