Title :
On disjoint covers and ROBDD size
Author :
Dubrova, E.V. ; Miller, D.M.
Author_Institution :
Dept. of Electron., R. Inst. of Technol., Stockholm, Sweden
Abstract :
The relation between the number of nodes in a ROBDD and the number of implicants in the disjoint cover of the function represented by that ROBDD is studied. We identify a class of functions for which there are disjoint covers such that a cover of a larger size can be represented by a ROBDD with a smaller number of nodes. This shows that the size of a ROBDD is not a monotonically increasing function of the size of the disjoint cover
Keywords :
binary decision diagrams; ROBDD; class of functions; disjoint covers; Adders; Boolean functions; Circuits; Computer science; Data structures; Electronic equipment testing; Input variables; Polynomials; System testing; Very large scale integration;
Conference_Titel :
Communications, Computers and Signal Processing, 1999 IEEE Pacific Rim Conference on
Conference_Location :
Victoria, BC
Print_ISBN :
0-7803-5582-2
DOI :
10.1109/PACRIM.1999.799502
