Abstract
Reduced Ordered Binary Decision Diagrams (RoBDDs) are a data structure frequently used for representation and manipulation of Boolean functions. Since the size of ROBDDs is extremely sensitive to the variable order a lot of heuristics to get a good variable order have been developed. For the class of partially symmetric Boolean functions this paper presents a new general method to improve quality of ordering heuristics based on the exchange of variables. Statistical and benchmark results are given to show the efficiency of our approach.
Chapter PDF
Similar content being viewed by others
References
S.B. Akers (1978). Binary Decision Diagrams IEEE Trans. on CAD, 27 (6): 509–516, 1978.
B. Becker (1992). Synthesis for Testability: Binary Decision Diagrams, volume 577 of LNCS. Symp. on Theoretical Aspects of Comp. Science, pages 501–512, 1992.
B. Becker and R. Drechsler (1994). Efficient Graph Based Representation of Multi-Valued Functions with an Application to Genetic Algorithms. In IEEE Nth International Symposium on Multi-Valued Logic, pages 65–72, 1994.
K.S. Brace, R.L. Rudell, and R.E. Bryant (1990). Efficient Implementation of a BDD Package. In Design Automation Conf., pages 40–45, 1990.
R.J. Brown, S. D. and Francis, J. Rose, and Z.G. Vranesic (1992). Field-Programmable Gate Arrays. Kluwer Academic Publisher, 1992.
R.E. Bryant (1986). Graph—Based Algorithms for Boolean Function Manipulation. IEEE Trans. on CAD, 35 (8): 677–691, 1986.
R.E. Bryant (1992). Symbolic Boolean Manipulation with Ordered Binary Decision diagrams. ACM, Comp. Surveys, 24: 293–318, 1992.
D. I. Cheng and M. Marek Sadowska (1993). Verifying Equivalence of Functions with Unknown Input Correspondence. In European Conf. on Design Automation, pages 81–85, 1993.
R. Drechsler and B. Becker (1995). Sympathy: Fast Exact Minimization of Fixed Polarity Reed-Muller Expressions for Symmetric Functions. In European Conf. on Design Automation, pages 91–97, 1995.
R. Drechsler, A. Sarabi, M. Theobald, B. Becker, and M.A. Perkowski (1995). Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams. In Design Automation Conf., pages 415–419, 1994.
E. Felt, G. York, Brayton R., and A. Sangiovanni-Vincentelli (1993). Dynamic Variable Reordering for BDD Minimization. In European Conf. on Design Automation, pages 130–135, 1993.
St.J. Friedman and K.J. Supowit (1990). Finding the Optimal Variable Ordering for Binary Decision Diagrams. IEEE Trans. on CAD, 39 (5): 710–713, 1990.
H. Fujii, G. Otomo, and C. Hori (1993). Interleaving Based Variable Ordering Methods for Ordered Binary Decision Diagrams. In IEEE Int’l Conf. on CAD, pages 38–41, 1993.
M. Fujita, H. Fujisawa, and N.Kawato (1988). Evaluation and Improvements of Boolean Comparison Methods Based on Binary Decision Diagrams In IEEE Intl Conf. on CAD, pages 2–5, 1988.
M. Fujita, Y. Matsunaga, and T. Kakuda (1991). On Variable Ordering of Binary Decision Diagrams for the Application of Multi-level Logic Synthesis. In European Conf. on Design Automation, pages 50–54, 1991.
J. Gergov and C. Meinel (1992). Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. In WC’92, LNCS, pages 310–320, 1992.
S.L. Hurst (1977). Detection of Symmetries in Combinatorial Functions by Spectral Means IEE Electronic Circuits and Systems, 1 (5): 173–180, 1977.
N. Ishiura, H. Sawada, and S. Yajima (1991). Minimization of Binary Decision Diagrams Based on Exchanges of Variables. In IEEE Int’l Conf. on CAD, pages 472–475, 1991.
B.-G. Kim and D.L. Dietmeyer (1991). Multilevel Logic Synthesis of Symmetric Switching Functions. IEEE Trans. on CAD, 10 (4): 436–446, 1991.
Y.-T. Lai, S. Sastry, and M. Pedram (1992). Boolean Matching using Binary Decision Diagrams with Applications to Logic Synthesis and Verification. In Int’l Conf. on Comp. Design, pages 452–458, 1992.
C.Y. Lee (1959). Representation of Switching Circuits by Binary Decision Diagrams Bell System Technical Jour., 38: 985–999, 1959.
F. Mailhot and G.D. Micheli (1990). Technology Mapping using Boolean Matching and Don’t Care Sets. In European Conf. on Design Automation, pages 212–216, 1990.
S. Malik, A.R. Wang, R.K. Brayton, and A. Sangiovanni-Vincentelli (1988). Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment. In IEEE Intl Conf. on CAD, pages 6–9, 1988.
J. Mohnke and S. Malik (1993). Permutation and Phase Independent Boolean Comparison. In European Conf. on Design Automation, pages 86–92, 1993.
D. Möller, J. Mohnke, and M. Weber (1993). Detection of Symmetry of Boolean Functions Represented by ROBDDs. In IEEE Int’l Conf. on CAD, pages 680–684, 1993.
B.M.E. Moret (1982). Decision Trees and Diagrams. ACM, Comp. Surveys, 14(4): 593–623, 1982.
S. Panda, F. Somenzi, and B.F. Plessier (1994). Symmetry Detection and Dynamic Variable Ordering of Decision Diagrams. In IEEE Int’l Conf. on CAD, pages 628–631, 1994.
R. Rudell (1993). Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In IEEE Int’l Conf. on CAD, pages 42–47, November 1993.
E. Sentovich, K. Singh, L. Lavagno, Ch. Moon, R. Murgai, A. Saldanha, H. Savoj, P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli (1992). SIS: a system for sequential circuit synthesis, 1992. Department of EE and CS, UC Berkeley.
I. Wegener (1984). Optimal Decision Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions. Information and Control, 62: 129–143, 1984.
I. Wegener (1987). The Complexity of Boolean Functions. John Wiley & Sons Ltd., and B.G. Teubner, Stuttgart (Wiley—Teubner Series in Computer Science), 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Möller, D., Molitor, P., Drechsler, R. (1995). Symmetry Based Variable Ordering for ROBDDs. In: Saucier, G., Mignotte, A. (eds) Logic and Architecture Synthesis. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34920-6_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-34920-6_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2923-7
Online ISBN: 978-0-387-34920-6
eBook Packages: Springer Book Archive