## Boolean Expression Diagrams (1997)

Citations: | 46 - 5 self |

### BibTeX

@MISC{Andersen97booleanexpression,

author = {Henrik Reif Andersen and Henrik Hulgaard},

title = {Boolean Expression Diagrams},

year = {1997}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) which can represent any Boolean circuit in linear space and still maintain many of the desirable properties of BDDs. Two algorithms are described for transforming a BED into a reduced ordered BDD. One is a generalized version of the BDD apply-operator while the other can exploit the structural information of the Boolean expression. This ability is demonstrated by verifying that two di erent circuit implementations of a 16-bit multiplier implement the same Boolean function. Using BEDs, this veri cation problem is solved in less than a second, while using standard BDD techniques this problem is infeasible. Generally, BEDs are useful in applications, for example tautology checking, where the end-result as a reduced ordered BDD is small.