Minimization of BDDs

  • Christoph Scholl
Chapter

Abstract

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.

Keywords

Boolean Function Symmetric Group Variable Order Weight Class Variable Partition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Christoph Scholl
    • 1
  1. 1.Institute of Computer ScienceAlbert-Ludwigs-UniversityFreiburg im BreisgauGermany

Personalised recommendations