Loading [a11y]/accessibility-menu.js
A characterization of binary decision diagrams | IEEE Journals & Magazine | IEEE Xplore

A characterization of binary decision diagrams


Abstract:

Binary decision diagrams (BDDs) are a representation of Boolean functions. Its use in the synthesis, simulation, and testing of Boolean circuits has been proposed by vari...Show More

Abstract:

Binary decision diagrams (BDDs) are a representation of Boolean functions. Its use in the synthesis, simulation, and testing of Boolean circuits has been proposed by various researchers. In all these applications of BDDs solutions to some fundamental computational problems are needed. A characterization of BDDs in terms of the complexity of these computational problems is presented. A tighter bound on the size of an ordered BDD that can be computed from a given Boolean circuit is presented. On the basis of the results, a case is made for exploring the use of repeated BDDs, with a small number of repeated variables, and free BDDs for some applications for which only ordered BDDs have been used so far.<>
Published in: IEEE Transactions on Computers ( Volume: 42, Issue: 2, February 1993)
Page(s): 129 - 137
Date of Publication: 06 August 2002

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.