Advertisement

Variable Ordering for BDDs

  • Shin-ichi Minato
Chapter
  • 111 Downloads
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 342)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Shin-ichi Minato
    • 1
  1. 1.NTT LSI LaboratoriesKanagawaJapan

Personalised recommendations