Techniques for formal transformations of binary decision diagrams

G. Kolotov, I. Levin, V. Ostrovsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publication11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004
Pages511-514
Number of pages4
StatePublished - 2004
Event11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004 - Tel Aviv, Israel
Duration: 13 Dec 200415 Dec 2004

Publication series

Name11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004

Conference

Conference11th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2004
Country/TerritoryIsrael
CityTel Aviv
Period13/12/0415/12/04

Fingerprint

Dive into the research topics of 'Techniques for formal transformations of binary decision diagrams'. Together they form a unique fingerprint.

Cite this