• DocumentCode
    1363330
  • Title

    Finding the optimal variable ordering for binary decision diagrams

  • Author

    Friedman, Steven J. ; Supowit, Kenneth J.

  • Author_Institution
    Dept. of Comput. Sci., Princeton Univ., NJ, USA
  • Volume
    39
  • Issue
    5
  • fYear
    1990
  • fDate
    5/1/1990 12:00:00 AM
  • Firstpage
    710
  • Lastpage
    713
  • Abstract
    The ordered binary decision diagram is a canonical representation for Boolean functions, presented by R.E. Bryant (1985) as a compact representation for a broad class of interesting functions derived from circuits. However, the size of the diagram is very sensitive to the choice of ordering on the variables; hence, for some applications, such as differential cascode voltage switch (DCVS) trees, it becomes extremely important to find the ordering leading to the most compact representation. An algorithm for this problem with time complexity O (n23n) is presented. This represents an improvement over the previous best algorithm
  • Keywords
    Boolean functions; logic design; trees (mathematics); Boolean functions; binary decision diagrams; canonical representation; compact representation; differential cascode voltage switch; optimal variable ordering; time complexity; trees; Application software; Boolean functions; Circuits; Computer science; Data structures; Decision trees; Logic testing; Scholarships; Switches; Voltage;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.53586
  • Filename
    53586
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1363330