Variable Ordering for BDDs
- 111 Downloads
BDDs give canonical forms of Boolean functions provided that the order of input variables is fixed, but the BDD for a given function can have many different forms depending on the permutation of the variables — and sometimes the size of BDDs greatly varies with the order. The size of BDDs determines not only the memory requirement but also the amount of execution time for their manipulation. The variable ordering algorithm is thus one of the most important issues in the application of BDDs.
Unable to display preview. Download preview PDF.