HS-ROBDD: an efficient variable order binary decision diagram
Authors: 
Mehdi Mohammadi, Hossein Pazhoumand-dar, Mohsen Soryani, Hossein MoeinzadehAuthors Info & Claims
Mehdi Mohammadi, Hossein Pazhoumand-dar, Mohsen Soryani, Hossein MoeinzadehAuthors Info & ClaimsPages 2115 - 2118
Abstract
Reduced Ordered Binary Decision Diagrams (ROBDDs) are frequently used as the representation of choice to solve various CAD problems such as synthesis, digital-system verification and testing. The size of an ROBDD for a function can be increased exponentially by the number of independent variables of the function that is called "memory explosion problem". Since the size of an ROBDD heavily depends on the variable order used, there is a strong need to find variable orders that minimize the number of nodes in an ROBDD. As finding the optimal variable ordering is an NP-Complete problem, in this paper, we use Harmony Search (HS) to find an optimal variable ordering in binary decision diagram. Some benchmarks form LGSynth91 are used to evaluate our suggestion method. Obtained results show that this method has the ability to find optimal order of input variable and reduce the size of ROBDD considerably.
References
[1]
Moeinzadeh.H. et al., Evolutionary-Reduce Order Binary Descion Diagram, In Proceedings of the 3th IEEE International conference on Modeling and simulation (AMS2009), Baundung, 2009.
[2]
Narayan, A., Recent Advances in BDD Based Representations for Boolean Functions: A Survey, In Proceedings of the 12th international conference on VLSI design, 1999, 408--413.
[3]
Bryant, R.E., Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, 1986, 677--691.
[4]
Lee, C.Y., Representation of switching circuits by binary decision programs., Bell Syst. Tech. J.,1959, 985--999.
[5]
Fujita, M., Fujisawa, H. and Matsunaga, Y. Variable Ordering Algorithms for Ordered Binary Decision Diagrams and Their Evaluation, IEEE Transactions on Computer Aided Design of Integrated Circuits and System, January 1993, vol. 12, 6--12.
[6]
Clarke, E., Grumberg, O. and Peled, D., Model Checking, MIT Press, 1999
[7]
McMillan, K.L., Symbolic Model Checking, Kluwer Academic Publishers, 1993
[8]
Moret, B.M.E., Decision trees and diagrams. In Computing Surveys, 1982, vol 14, 593--623.
[9]
Geem, Z.W., Kim, J.H. and Loganathan, G.V., A new heuristic optimization algorithm: harmony search, Simulation, 76 (2) (2001) 60--68.
[10]
Lee, K.S. and Geem, Z.W., A new meta-heuristic algorithm for continues engineering optimization: harmony search theory and practice, Comput. Meth. Appl. Mech. Eng. 194 (2004) 3902--3933.
[11]
Kim, J.H., Geem, Z.W. and Kim, E.S., Parameter estimation of the nonlinear Muskingum model using harmony search, J. Am. Water Resour. Assoc. 37 (5) (2001) 1131--1138.
[12]
Jawahar, J., William, A. and F.Masahiro. Sampling scheme for computing OBDD variable ordering, In Proceedings of the IEEE/ACM international conference on computer aided design, 631--638, 1998.
[13]
Fujita, M., et al. Evaluation and improvements of Boolean comparison method based on Binary Decision Diagrams. ICCAD, 1988.
[14]
Malik, S., et al. Logic verification using Binary Decision Diagrams in a logic synthesis environment. ICCAD, 1988
[15]
Ishiura, N., et al. Minimization of Binary Decision Diagrams based on exchange of variables. DAC, 1991.
[16]
Drechsler, R., et al. A genetic algorithm for variable ordering of OBDDs. IEEE Proc. Comp. Digital Techniques, 1996.
[17]
Fujita, M., et al. On variable ordering of Binary Decision Diagrams for the application of multi-level logic synthesis. EDAC, 1991
[18]
Rudell, R. Dynamic variable ordering for Ordered Binary Decision Diagrams. ICCAD, 1993
[19]
Jain, J., Narayan, A., Coelho, C., Khatri, S., Sangiovanni Vincentelli, A., Brayton, R. and Fujita, M., Decomposition Techniques for Effcient ROBDD Construction. In Formal Methods in CAD 96, 1996, LNCS. Springer-Verlag.
[20]
Narayan, A., Khatri, S.P., Jain, J., Fujita, M., Brayton, R.K. and A. Sangiovanni-Vincentelli. A Study of Composition Schemes for Mixed Apply/Compose Based Construction of ROBDDs. Proceedings of the Intl. Conf. on VLSI Design, 1996.
[21]
Murgai, R., Jain, J. and Fujita, M., Efficient Scheduling Techniques for ROBDD Construction, In Proceedings of the 12th international conference on VLSI design,1999, 391--401.
[22]
Akers, S.B., Binary Decision Diagrams. IEEE Transactions on Computers, 1978, 509--516.
Index Terms
- HS-ROBDD: an efficient variable order binary decision diagram
Recommendations
Determining the Number of Paths in Decision Diagrams by Using Autocorrelation Coefficients
This paper deals with the number of paths in multiterminal binary decision diagrams (MTBDDs) and shared binary decision diagrams (SBDDs) representing a set of Boolean functions. It is shown that the number of paths in an MTBDD (SBDD) can be uniquely ...
An efficient estimation of the ROBDD's complexity
This paper describes a new mathematical model for the estimation of reduced ordered binary decision diagram's (ROBDD's) complexity, for any Boolean function with different degrees of variables complexity. The model is capable of predicting the maximum ...
Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum
This paper reports a result concerning the relation between the best variable orderings of an ROBDD G_f and the decomposition structure of the Boolean function f represented by G_f. It was stated in [1] that, if f has a decomposition of type f(X) = g(h_...
Comments
Information & Contributors
Information
Published In
Copyright © 2009 Copyright is held by the author/owner(s).
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 July 2009
Check for updates
Author Tag
Qualifiers
- Short-paper
Conference
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 289Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in