By Topic

Evolutionary-Reduced Ordered Binary Decision Diagram

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Moeinzadeh, H. ; Dept. of Comput. Eng., Iran Univ. of Sci. & Technol., Tehran ; Mohammadi, Mehdi ; Pazhoumand-Dar, H. ; Mehrbakhsh, A.
more authors

Reduced ordered binary decision diagram (ROBDD) is a memory-efficient data structure which is used in many applications such as synthesis, digital system, verification, testing and VLSI-CAD. The size of an ROBDD for a function can be increased exponentially by the number of independent variables of the function that is called ldquomemory explosion problemrdquo. The choice of the variable ordering largely influences the size of the OBDD especially for large input variables. Finding the optimal variable ordering is an NP-complete problem, hence, in this paper, two evolutionary methods (GA and PSO) are used to find optimal order of input variable in binary decision diagram. Some benchmarks form LGSynth91 are used to evaluate our suggestion methods. Obtained results show that evolutionary methods have the ability to find optimal order of input variable and reduce the size of ROBDD considerably.

Published in:

Modelling & Simulation, 2009. AMS '09. Third Asia International Conference on

Date of Conference:

25-29 May 2009