Variants and Extensions of OBDDs
To further improve the efficiency of the data structure of OBDDs, several variants and extensions have been proposed. For the requirements in specific application fields, these refined models are better suited than the “classic” OBDDs. We would like to present some particularly interesting and important developments in this area, although the relevant research efforts have not been completed yet. The search for more compact representations of switching functions, which preserve the valuable properties of OBDDs, is still ongoing.
KeywordsBinary Operation Edge Weight Variable Order Switching Function Binary Number
Unable to display preview. Download preview PDF.
- The model of FBDDs was introduced as a data structure for Boolean manipulation by Gergov and Meinel [GM94a], and independently by Sieling and Wegener [SW95b]. The heuristic ideas for constructing complete types were presented in [BGMS94].Google Scholar
- OFDDs were proposed by Kebschull, Schubert, and Rosenstiel [KSR92]; the combination of different decomposition types is due to Drechsler, Sarabi, Theobald, et al. [DST+94]. Applications of OFDDs in minimizing Reed-Muller expressions are investigated in [DTB96]. Recently, an alternative approach for constructing decision diagrams based on the EX-OR operation has been proposed in [MS98].Google Scholar
- The variant of zero-suppressed BDDs goes back to Minato [Min93, Min96]. The theorem relating the sizes of OBDDs and ZDDs to each other was proven by Schröer and Wegener [SW95a]. Successful applications of ZDDs in the area of logic synthesis are presented in the survey [Cou94].Google Scholar
- In the two papers [CMZ+93, BFG+93], the model of multi-terminal BDDs was introduced. The model of edge-valued BDDs was proposed in the paper [LPV94]. Finally, the moment decomposition, BMDs, and *BMDs were introduced and studied by Bryant and Chen [BC95].Google Scholar