A characterization of binary decision diagrams

Author

Chakravarty, Sreejit

Author_Institution

Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA

Volume

42

Issue

2

fYear

1993

fDate

2/1/1993 12:00:00 AM

Firstpage

129

Lastpage

137

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

Keywords

Boolean functions; logic circuits; logic design; logic testing; Boolean functions; binary decision diagrams; characterization; complexity; computational problems; repeated variables; simulation; synthesis; testing; Binary decision diagrams; Boolean functions; Circuit simulation; Circuit synthesis; Circuit testing; Communication system control; Computational modeling; Computer science; Data structures; Input variables;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.204789

Filename

204789