By Topic

Software tools for BDD optimizing by using autocorrelation functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
G. Kolotov ; Tel Aviv Univ., Ramat-Aviv, Israel ; I. Levin ; V. Ostrovsky ; M. Karpovsky

Binary decision diagrams (BDDs), when used for representation of discrete functions, permit direct technology mapping into multi-level logic networks. The complexity of a network derived from a BDD is expressed by its number of non-terminal nodes. We discuss a class of methods for reducing the size of a BDD. We also introduce a package of software tools used in the 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 new modules or algorithms.

Published in:

Electrical and Electronics Engineers in Israel, 2004. Proceedings. 2004 23rd IEEE Convention of

Date of Conference:

6-7 Sept. 2004