• DocumentCode
    3569845
  • Title

    Mathematical model to predict the number of nodes in an ROBDD

  • Author

    Raseen, Mohamed ; Prasad, P. W Chandana ; Assi, Ali

  • Author_Institution
    Coll. of Inf. Technol., United Arab Emirates Univ., Al-Ain, United Arab Emirates
  • Volume
    3
  • fYear
    2004
  • Abstract
    This paper analyses and describes the relation between the size of a Boolean function and the number of nodes in its ROBDD representation. Knowing the number of variables and the number of product terms of a Boolean function, we can predict the number of nodes in its reordered binary decision diagram (ROBDD) without building the BDD. A mathematical model for this prediction has been developed. This model can be used to find the maximum number of nodes that can be produced for a given number of variables. The model can also be used to find the number of product terms above which the ROBDD is reduced to 1 node only. We demonstrate that the predictions using this model are quite promising, fast and easy to implement.
  • Keywords
    Boolean functions; binary decision diagrams; combinational circuits; Boolean function; combinational circuits; mathematical model; node prediction; reordered binary decision diagram; Artificial intelligence; Binary decision diagrams; Boolean functions; Circuit synthesis; Circuit testing; Combinational circuits; Data structures; Formal specifications; Formal verification; Mathematical model;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2004. MWSCAS '04. The 2004 47th Midwest Symposium on
  • Print_ISBN
    0-7803-8346-X
  • Type

    conf

  • DOI
    10.1109/MWSCAS.2004.1354387
  • Filename
    1354387