Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Engineering & Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
