z-logo
open-access-imgOpen Access
Exact Modeling of Binary Decision Diagram Complexity
Author(s) -
Mohamed Raseen,
E Venitha
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i3.34.18976
Subject(s) - binary decision diagram , binary number , diagram , mathematics , relation (database) , algorithm , computer science , statistics , data mining , arithmetic
An exact model of Binary Decision Diagram (BDD) complexity is derived in this paper. An estimate of BDD complexity using models has already been proposed. The estimated BDD complexity in previous papers is just an approximation of experimental data using a curve that fits the data. Mathematical analysis indicates that many curves can be fitted to the same data. This paper derives the exact model for the BDD complexity by analysis. In order to derive the exact model, relation between the SOP (Sum Of Product) terms and Min-terms was analyzed. Further the variation of BDD size for various Min-terms was also analyzed. Finally the plot between the experimental BDD size and the derived exact model proves the accuracy of the derived model.  

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here