|
Published Articles >> Table of Contents >> Abstract
Sixth Asian Test Symposium (ATS'97)
p. 228
A variable reordering method for fast optimization of binary decision diagrams
Moon-Bae Song, Dept. of Comput. Sci., Soongsil Univ., Seoul, South Korea
Hoon Chang, Dept. of Comput. Sci., Soongsil Univ., Seoul, South Korea
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ATS.1997.643963
Send link to a friend
| Abstract |
|
In this paper, a new variable ordering algorithm, distributed reordering algorithm that allows more faster solution than existing ones, is presented. Since this method can accomplish fast optimization of BDD in less memory and computation time, the proposed algorithm is more efficient for dynamic variable ordering. Also, the proposed algorithm can achieve more optimized results in combining with other variable ordering method.
|
 Additional Information
|
Index Terms- circuit optimisation; variable reordering; optimization; binary decision diagrams; distributed reordering algorithm; computation time; dynamic variable ordering; window permutation
Citation:
Moon-Bae Song, Hoon Chang,
"A variable reordering method for fast optimization of binary decision diagrams,"
ats,
p. 228,
Sixth Asian Test Symposium (ATS'97),
1997
|
|
