TY - GEN
T1 - Techniques for formal transformations of binary decision diagrams
AU - Kolotov, G.
AU - Levin, I.
AU - Ostrovsky, V.
N1 - Funding Information:
1 This research was supported by BSF under grant No. 2000154.
PY - 2004
Y1 - 2004
N2 - Binary Decision Diagrams (BDDs), when used for 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. This paper discusses the problem of reducing the BDDs. The paper has two main contributions: a) bounds of potential complexity of the BDD have been determined and proven; b) a formal technique is presented for simplification of Boolean operations on a set of BDDs.
AB - Binary Decision Diagrams (BDDs), when used for 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. This paper discusses the problem of reducing the BDDs. The paper has two main contributions: a) bounds of potential complexity of the BDD have been determined and proven; b) a formal technique is presented for simplification of Boolean operations on a set of BDDs.
UR - https://www.scopus.com/pages/publications/27644500998
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:27644500998
SN - 0780387155
T3 - 11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004
SP - 511
EP - 514
BT - 11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004
T2 - 11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004
Y2 - 13 December 2004 through 15 December 2004
ER -