Skip to Main Content
Binary decision diagrams (BDDs), when used for representation of discrete functions, permit direct technology mapping into multi-level logic networks. The complexity of a network derived from a BDD is expressed by its number of non-terminal nodes. We discuss a class of methods for reducing the size of a BDD. We also introduce a package of software tools used in the representation and analysis of Boolean functions with BDDs. The software is designed with two goals in mind: human engineering and efficiency of calculations. It is easy to use, comprehensive and easily extended to new modules or algorithms.