Abstract
Data structures for Boolean functions build an essential component of design automation tools, especially in the area of logic synthesis. The state of the art data structure is the ordered binary decision diagram (OBDD), which results from general binary decision diagrams (BDDs), also called branching programs, by ordering restrictions. In the context of EXOR-based logic synthesis another type of decision diagram (DD), called (ordered) functional decision diagram ((O)FDD) becomes increasingly important.
We study the relation between (ordered, free) BDDs and FDDs. Both, BDDs and FDDs, result from DDs by defining the represented function in different ways. If the underlying DD is complete, the relation between both types of interpretation can be described by a Boolean transformation τ. This allows us to relate the FDD-size of f and the BDD-size of τ(f) also in the case that the corresponding DDs are free or ordered, but not (necessarily) complete. We use this property to derive several results on the computational power of OFDDs and OBDDs. Symmetric functions are shown to have efficient representations as OBDDs and OFDDs as well. Classes of functions are given that have exponentially more concise OFDDs than OBDDs, and vice versa. Finally, we determine the complexity of some standard operations if OFDDs are used for the representation of Boolean functions.
The authors were supported by DFG grant Be 1176/4-2 and the International Computer Science Institute (ICSI), Berkeley. Current address of the third author is ICSI, Berkeley, CA 94704.
This is a preview of subscription content, log in via an institution to check access.
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.
S.B. Akers. Binary decision diagrams. IEEE Trans. on Comp., C-27:509–516, 1978.
B. Becker and R. Drechsler. Testability of circuits derived from functional decision diagrams. In European Conf. on Design Automation, page 667, 1994.
B. Becker, R. Drechsler, and M. Theobald. On the implementation of a package for efficient representation and manipulation of functional decision diagrams. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, Hamburg, pages 162–169, 1993.
E.R. Berlekamp. Algebraic Coding Theory. McGraw-Hill Book Company, 1968.
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. on Comp., 40:205–213, 1991.
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. Drechsler and B. Becker. Rapid prototyping of fully testable multi-level AND/EXOR networks. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, Hamburg, pages 126–133, 1993.
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.
J. Gergov and C. Meinel. Efficient analysis and manipulation of OBDDs can be extended to read-once-only branching programs. to be published in IEEE Trans. on Comp., 1994.
U. Kebschull and W. Rosenstiel. Efficient graph-based computation and manipulation of functional decision diagrams. In European Conf. on Design Automation, pages 278–282, 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.
C.Y. Lee. Representation of switching circuits by binary decision diagrams. Bell System Technical Jour., 38:985–999, 1959.
Y.-T. Lai and S. Sastry. Edge-valued binary decision diagrams for multi-level hierarchical verification. In Design Automation Conf., pages 608–613, 1992.
C. Meinel. Modified Branching Programs and their Computational Power, volume 370 of LNCS. Springer Verlag, 1989.
M.S. Paterson. On Razborov's result for bounded depth circuits over ⊕, ∧. Technical report, University Warwick, 1986.
A.A. Razborov. Lower bounds on the size of bounded depth networks over the basis {⊕, ∧}. Technical report, Moscow State University, Moscow, 1986.
S.M. Reddy. Easily testable realizations for logic functions. In IEEE Trans. on Comp., volume C-21, pages 1183–1188, 1972.
U. Rollwage. The complexity of mod-2 sum PLA's for symmetric functions. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, Hamburg, pages 6–12, 1993.
Richard Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42–47, 1993.
T. Sasao. Logic Synthesis and Optimization. Kluwer Academic Publisher, 1993.
J. Saul. Logic synthesis for arithmetic circuits using the reed-muller representation. In European Conf. on Design Automation, pages 109–113, 1992.
T. Sasao and Ph. Besslich. On the complexity of mod-2 sum PLAs. IEEE Trans. on Comp., 39:262–266, 1990.
A. Sarabi and M.A. Perkowski. Design for testability properties of and/xor networks. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, Hamburg, pages 147–153, 1993.
K.K. Saluja and S.M. Reddy. Fault detection test sets for reed-muller canonical networks. In IEEE Trans. on Comp., volume C-24, pages 995–998, 1975.
D. Sieling and I. Wegener. Graph driven BDDs-a new data structure for Boolean functions. Technical report, Universität Dortmund, 1992.
D. Sieling and I. Wegener. Reduction of BDDs in linear time. Information Processing Letters, 48(3):139–144, 11 1993.
D. Sieling and I. Wegener. Graph driven BDDs-a new data structure for Boolean functions. to be published in Theoretical Computer Science, 1994.
C.C. Tsai and M. Marek-Sadowska. Efficient minimization algorithms for fixed polarity and/xor canonical networks. In Great Lakes Symp. VLSI, pages 76–79, 1993.
I. Wegener. Optimal decision trees and one-time-only branching programs for symmetric Boolean functions. Information and Control, 62:129–143, 1984.
I. Wegener. The Complexity of Boolean Functions. John Wiley & Sons Ltd., and B.G. Teubner, Stuttgart, 1987.
R. Werchner, T. Harich, R. Drechsler, and B. Becker. Satisfiability problems for ordered functional decision diagrams. submitted, 1994.
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., Werchner, R. (1995). On the relation between BDDs and FDDs. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_82
Download citation
DOI: https://doi.org/10.1007/3-540-59175-3_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59175-7
Online ISBN: 978-3-540-49220-7
eBook Packages: Springer Book Archive