By Topic

Variable ordering on multiway decision graphs

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

2 Author(s)
Yi Feng ; Dept. d''Inf. et de Recherche Oper., Montreal Univ., Que., Canada ; Cerny, E.

The paper presents variable (re)ordering methods for Multiway Decision Graphs (MDG). MDGs have proved to be a powerful tool for automated hardware verification of RTL designs. To reduce the effects of the state explosion problem, we explore automatic static and dynamic variable ordering algorithms for MDG. Compared with ROBDDs, the situation is complicated by the presence of first order terms in MDGs. The static variable ordering algorithm is based on several heuristic rules, and the dynamic reordering algorithm that minimizes the size of the MDGs during the verification process combines the merits of symmetry and state group sifting. Experimental results on benchmarks show the effectiveness of our method.

Published in:

Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on  (Volume:5 )

Date of Conference:

2002