By Topic

A global approach to the variable ordering problem in PSBDDs

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
$33 $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)
Wei Wang ; Dept. of Electr. & Comput. Eng., Portland State Univ., OR, USA ; M. Chrzanowska-Jeske

We present a new global approach to the variable-ordering problem in Pseudo-Symmetric Binary Decision Diagrams (PSBDDs). It is based on analyzing symmetric relations between functions' variables. We group all function's variables into symmetry chains and then order the chains based on symmetries. To further reduce the size and the number of levels in PSBDDs, we introduce a hierarchical decomposition method, based on multiple symmetries. Comparing to the previously published results, we substantially reduced the numbers of levels (delay) in PSBDDs, and for many non-symmetric benchmark functions we did not have to use any repeated variables. Results for MCNC benchmark functions are presented

Published in:

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

Date of Conference: