Abstract
Ordered Decision Diagrams (ODDs) as a means for the representation of Boolean functions are used in many applications in CAD. Depending on the decomposition type, various classes of ODDs have been defined, the most important being the Ordered Binary Decision Diagrams (OBDDs), the Ordered Functional Decision Diagrams (OFDDs) and the Ordered Kronecker Functional Decision Diagrams (OKFDDs). In this paper we clarify the computational power of OKFDDs versus OBDDs and OFDDs from a (more) theoretical point of view. We prove several exponential gaps between specific types of ODDs. Combining these results it follows that a restriction of the OKFDD concept to subclasses, such as OBDDs and OFDDs as well, results in families of functions which lose their efficient representation.
The first and second author were supported by DFG grant Be 1176/4-2.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, L. Babai, P. Hajnal, J. Komlos, P. Pudlak, V. Rödl, E. Szemeredi, and G. Turan. Two lower bounds for branching programs. In Symp. on Theory of Computing, pages 30–38, 1986.
B. Becker and R. Drechsler. How many decomposition types do we need? In European Design & Test Conf., pages 438–443, 1995.
B. Becker, R. Drechsler, and R. Werchner. On the relation between BDDs and FDDs. In LATIN95, LNCS, 1995.
Ph.W. Besslich and E.A. Trachtenberg. A three-valued quasi-linear transformation for logic synthesis. In C. Moraga and R. Creutzburg, editors, Spectral Techniques: Theory and Applications. Elsevier, North Holland, 1992.
R.E. Bryant. Graph — based algorithms for Boolean function manipulation. IEEE Trans, on Comp., 8:677–691, 1986.
R.E. Bryant. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans, ton Comp., 40:205–213, 1991.
R.E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. ACM, Comp. Surveys, 24:293–318, 1992.
J.R. Burch. Using BDDs to verify multipliers. In Design Automation Conf., pages 408–412, 1991.
R. Drechsler, A. Sarabi, M. Theobald, B. Becker, and M.A. Perkowski. Efficient representation and manipulation of switching functions based on ordered kronecker functional decision diagrams. In Design Automation Conf., pages 415–419, 1994.
R. Drechsler, M. Theobald, and B. Becker. Fast OFDD based minimization of fixed polarity reed-muller expressions. In European Design Automation Conf., pages 2–7, 1994.
S. J. Friedman. Efficient Data Structures for Boolean Function Representation. PhD thesis, Dept. of Comput. Sciences, Princeton University, 1990.
J. Jain, M. Abadir, J. Bitner, D. Fussell, and J. Abraham. IBDDs: An efficient functional representation for digital circuits. In European Conf. on Design Automation, pages 441–446, 1992.
S.-W. Jeong, B. Plessier, G. Hachtel, and F. Somenzi. Extended BDD's: Trading of canonicity for structure in verification algorithms. In Int'l Conf. on CAD, pages 464–467, 1991.
U. Kebschull. Die Äquivalenz-Expansion Boolescher Funktionen. Technical report, WSI-93-15, UniversitÄt Tübingen, 1993.
U. Kebschull, E. Schubert, and W. Rosenstiel. Multilevel logic synthesis based on functional decision diagrams. In European Conf. on Design Automation, pages 43–47, 1992.
M.S. Paterson. On Razborov's result for bounded depth circuits over +,∧. Technical report, University Warwick, 1986.
Richard Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42–47, 1993.
I. Wegener. The Complexity of Boolean Functions. John Wiley & Sons Ltd., and B.G. Teubner, Stuttgart, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Becker, B., Drechsler, R., Theobald, M. (1995). OKFDDs versus OBDDs and OFDDs. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_98
Download citation
DOI: https://doi.org/10.1007/3-540-60084-1_98
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60084-8
Online ISBN: 978-3-540-49425-6
eBook Packages: Springer Book Archive