Techniques for formal transformations of binary decision diagrams

G. Kolotov; I. Levin; V. Ostrovsky

Techniques for formal transformations of binary decision diagrams

G. Kolotov, I. Levin, V. Ostrovsky

School of Education

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004
Pages	511-514
Number of pages	4
State	Published - 2004
Event	11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004 - Tel Aviv, Israel Duration: 13 Dec 2004 → 15 Dec 2004

Publication series

Name	11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004

Conference

Conference	11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004
Country/Territory	Israel
City	Tel Aviv
Period	13/12/04 → 15/12/04

Cite this

@inproceedings{45a676ffc7b54ed8bdd9d9d469c66522,

title = "Techniques for formal transformations of binary decision diagrams",

abstract = "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.",

author = "G. Kolotov and I. Levin and V. Ostrovsky",

note = "Funding Information: 1 This research was supported by BSF under grant No. 2000154.; null ; Conference date: 13-12-2004 Through 15-12-2004",

year = "2004",

language = "אנגלית",

isbn = "0780387155",

series = "11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004",

pages = "511--514",

booktitle = "11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004",

}

Kolotov, G, Levin, I & Ostrovsky, V 2004, Techniques for formal transformations of binary decision diagrams. in 11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004., WA3.1, 11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004, pp. 511-514, 11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004, Tel Aviv, Israel, 13/12/04.

Techniques for formal transformations of binary decision diagrams. / Kolotov, G.; Levin, I.; Ostrovsky, V.

11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004. 2004. p. 511-514 WA3.1 (11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - http://www.scopus.com/inward/record.url?scp=27644500998&partnerID=8YFLogxK

M3 - פרסום בספר כנס

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

Y2 - 13 December 2004 through 15 December 2004

ER -

Techniques for formal transformations of binary decision diagrams

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this