Abstract
So far, we have mainly considered structural properties of ordered binary decision diagrams. Several of these properties, like the linear-time equivalence test, already indicate the suitability of OBDDs in the context of Boolean manipulation. However, as the efficiency of all OBDD-based applications depends almost exclusively on the efficiency of the basic OBDD operations, the demands on the performance of these operations are very high. Hence, much research effort has been spent on transforming the basic OBDD concept into fast and memory-efficient implementations.
Alles, was ist, ist vernünftig. [All, that is, is reasonable.] 2. Corinthians 12,9
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
The key ideas for the efficient implementation of OBDDs mostly go back to Brace, Rudell, and Bryant [BRB90]. Complemented edges were proposed by Karplus [Kar88] and by Madre and Billon [MB88]. The three presented OBDD packages are publicly available. The OBDD package of Long originated from the work [Lon93]. The CUDD package, the latest of these three packages, can be found at the Internet address given in reference [Som96b].
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Meinel, C., Theobald, T. (1998). Efficient Implementation of OBDDs. In: Algorithms and Data Structures in VLSI Design. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58940-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-58940-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64486-6
Online ISBN: 978-3-642-58940-9
eBook Packages: Springer Book Archive