This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum
February 2005 (vol. 54 no. 2)
pp. 236-237
ASCII Text
x 
 
Maxim Teslenko, Andr? Martinelli, Elena Dubrova, "Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum," IEEE Transactions on Computers, vol. 54, no. 2, pp. 236-237, February, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TC.2005.17,
author = {Maxim Teslenko and Andr? Martinelli and Elena Dubrova},
title = {Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum},
journal ={IEEE Transactions on Computers},
volume = {54},
number = {2},
issn = {0018-9340},
year = {2005},
pages = {236-237},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.17},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum
IS - 2
SN - 0018-9340
SP236
EP237
EPD - 236-237
A1 - Maxim Teslenko,
A1 - Andr? Martinelli,
A1 - Elena Dubrova,
PY - 2005
KW - ROBDD
KW - variable ordering
KW - bound set.
VL - 54
JA - IEEE Transactions on Computers
ER -
 
This paper reports a result concerning the relation between the best variable orderings of an ROBDD G_f and the decomposition structure of the Boolean function f represented by G_f. It was stated in [1] that, if f has a decomposition of type f(X) = g(h_1(Y_1), h_2(Y_2), \ldots, h_k(Y_k)), where \{Y_i\}, i \in \{1,2,\ldots,k\}, is a partition of X, then one of the orderings which keeps the variables within the sets \{Y_i\} adjacent is a best ordering for G_f. Using a counterexample, we show that this statement is incorrect.

[1] S.-W. Jeong, “Binary Decision Diagrams and Their Applications to Implicit Enumeration Techniques in Logic Synthesis,” PhD thesis, Univ. of Colorado, 1992.
[2] R. Ashenhurst, “The Decomposition of Switching Functions,” Proc. Int'l Symp. Theory of Switching, vol. 29, pp. 74-116, 1959.
[3] E. Dubrova and L. Macchiarulo, “A Comment on Graph-Based Algorithm for Boolean Function Manipulation,” IEEE Trans. Computers, vol. 49, no. 10, pp. 1290-1292, Oct. 2000.

Index Terms:
ROBDD, variable ordering, bound set.
Citation:
Maxim Teslenko, Andr? Martinelli, Elena Dubrova, "Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum," IEEE Transactions on Computers, vol. 54, no. 2, pp. 236-237, Feb. 2005, doi:10.1109/TC.2005.17
Usage of this product signifies your acceptance of the Terms of Use.