HS-ROBDD: an efficient variable order binary decision diagram

Authors:
Mehdi Mohammadi;Hossein Pazhoumand-dar;Mohsen Soryani;Hossein Moeinzadeh
Affiliations:
Department of Computer engineering, Iran University of Science and Technology, Tehran, Iran, Tehran, Iran;Department of Computer engineering, Islamic Azad University-Mashhad branch, Mashhad, Iran, Mashad, Iran;Department of Computer engineering, Iran University of Science and Technology, Tehran, Iran, Tehran, Iran;Department of Computer engineering, Iran University of Science and Technology, Tehran, Iran, Tehran, Iran
Venue:
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Year:
2009

Citing 13
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Dynamic variable ordering for ordered binary decision diagrams

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Sampling schemes for computing OBDD variable orderings

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Model checking

Model checking
Decision Trees and Diagrams

ACM Computing Surveys (CSUR)
Symbolic Model Checking

Symbolic Model Checking
Decomposition Techniques for Efficient ROBDD Construction

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
A study of composition schemes for mixed apply/compose based construction of ROBDDs

VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
Recent Advances in BDD Based Representations for Boolean Functions: A Survey

VLSID '99 Proceedings of the 12th International Conference on VLSI Design - 'VLSI for the Information Appliance'
Efficient Scheduling Techniques for ROBDD Construction

VLSID '99 Proceedings of the 12th International Conference on VLSI Design - 'VLSI for the Information Appliance'
On variable ordering of binary decision diagrams for the application of multi-level logic synthesis

EURO-DAC '91 Proceedings of the conference on European design automation
Binary Decision Diagrams

IEEE Transactions on Computers
Evolutionary-Reduced Ordered Binary Decision Diagram

AMS '09 Proceedings of the 2009 Third Asia International Conference on Modelling & Simulation

Quantified Score

Hi-index	0.00

Visualization

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.