By Topic

An oscillating algorithm for variable ordering in 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

4 Author(s)
Taher, M. ; Dept. of Comput. & Syst., Ain Shams Univ., Cairo, Egypt ; Salem, A. ; Mahdi, W. ; Wahdan, A.

In this paper we present a novel heuristic for improving the variable order computation in the binary decision diagram. The proposed algorithm uses two way swapping and it oscillates forward and backward to minimize the number of cycles needed to get the best order. The validity of the proposed approach has been shown using ISCAS 85 benchmarks

Published in:

Electronics, Circuits and Systems, 2000. ICECS 2000. The 7th IEEE International Conference on  (Volume:2 )

Date of Conference: