Minimization of BDDs
Chapter 3 will show that the minimization of robdds plays an important role for the realization of Boolean functions by decomposition. Before applying decomposition, the robdd representation of the function is minimized to obtain a good starting point for optimization. Therefore in this chapter we deal with several methods for minimizing the robdd representation of Boolean functions, including variable reordering and don’t care exploitation to minimize robdds for incompletely specified Boolean functions.
KeywordsBoolean Function Symmetric Group Variable Order Weight Class Variable Partition
Unable to display preview. Download preview PDF.