• DocumentCode
    1550436
  • Title

    A note on complexity of OBDD composition and efficiency of partitioned-OBDDs over OBDDs

  • Author

    Jain, Jawahar ; Wegener, Ingo ; Fujita, Masahiro

  • Author_Institution
    Fujitsu Labs of America, Sunnyvale, CA, USA
  • Volume
    50
  • Issue
    11
  • fYear
    2001
  • fDate
    11/1/2001 12:00:00 AM
  • Firstpage
    1289
  • Lastpage
    1290
  • Abstract
    We discuss an open problem with constructing an OBDD using composition and prove that the worst case complexity of the construction is truly cubic. Using this insight, we show compactness of partitioned-OBDD over monolithic OBDD
  • Keywords
    Boolean functions; VLSI; binary decision diagrams; logic CAD; OBDD composition; compactness; cubic complexity; monolithic OBDD; partitioned-OBDD; worst case complexity; Binary decision diagrams; Boolean functions; Circuits; Computer science; Input variables; Phased arrays; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.966501
  • Filename
    966501
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1550436