Software tools for BDD optimizing by using autocorrelation functions

G. Kolotov*, I. Levin, V. Ostrovsky, M. Karpovsky

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
Pages129-132
Number of pages4
StatePublished - 2004
Event2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings - Tel-Aviv, Israel
Duration: 6 Sep 20047 Sep 2004

Conference

Conference2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings
Country/TerritoryIsrael
CityTel-Aviv
Period6/09/047/09/04

Fingerprint

Dive into the research topics of 'Software tools for BDD optimizing by using autocorrelation functions'. Together they form a unique fingerprint.

Cite this