Techniques for formal transformations of binary decision diagrams

Binary decision diagrams (BDDs), when used for the representation of discrete functions, permit the direct technology mapping into multi-level logic networks. Complexity of a network derived from a BDD is expressed by its number of non-terminal nodes. The paper discusses the problem of reducing the BDDs. It makes two main contributions: (a) the bounds of the potential complexity of the BDD are determined and proven; (b) a formal technique is presented for simplification of Boolean operations on a set of BDDs.