An Efficient Method for Generating Optimal OBDD of Boolean Functions

  •  Ashutosh Singh    
  •  Anand Mohan    


An efficient method of finding optimal (OBDD) of an n variable Boolean function is presented that offers a simple and straightforward procedure for optimal OBDD generation along with storage economy. This is achieved by generating n! fold tables and applying node reduction rules to each fold table directly instead of generating all n! OBDDs of the function.

This work is licensed under a Creative Commons Attribution 4.0 License.
  • ISSN(Print): 1913-8989
  • ISSN(Online): 1913-8997
  • Started: 2008
  • Frequency: quarterly

Journal Metrics

WJCI (2020): 0.439

Impact Factor 2020 (by WJCI): 0.247

Google Scholar Citations (March 2022): 6907

Google-based Impact Factor (2021): 0.68

h-index (December 2021): 37

i10-index (December 2021): 172

(Click Here to Learn More)