Binaiy Decision Diagrams (BDDs), when used for representation of discrete functions, permit 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. In this paper we discuss a class of methods for reducing the size of a BDD. We also introduce a package of software tools used in 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 the new modules or algorithms.
|Number of pages||4|
|State||Published - 2004|
|Event||2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings - Tel-Aviv, Israel|
Duration: 6 Sep 2004 → 7 Sep 2004
|Conference||2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings|
|Period||6/09/04 → 7/09/04|