Abstract
In this chapter, we introduce the representation type of ordered binary decision diagrams, called OBDDs for short. Although the underlying model of decision diagrams (or synonymously branching programs) was already studied by Lee and Akers in the 1950s and 1970s, these representations have not been used in serious applications for a long time. In 1986, by adding some ingenious ordering restrictions to these models and providing a sophisticated reduction mechanism, R. Bryant substantially improved the model. Since this time, the improved representation, denoted as OBDD, has invaded nearly all areas of computer-aided VLSI design.
My power comes to full strenght in weakness. 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 fundamentals of OBDDs, i.e., the model, the reduction idea, efficient algorithms for performing Boolean operations on them, and the equivalence test, go back to Bryant [Bry86, Bry92]. The presented uniqueness theorem follows the presentation of Sieling and Wegener [SW93a, Sie94]. The linear-time reduction algorithm is also due to Sieling and Wegener [SW93b].
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). OBDDs — Ordered Binary Decision Diagrams. In: Algorithms and Data Structures in VLSI Design. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58940-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-58940-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64486-6
Online ISBN: 978-3-642-58940-9
eBook Packages: Springer Book Archive