Computer and Information Science
An Efficient Method for Generating Optimal OBDD of Boolean Functions
Abstract
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 3.0 License.
Computer and Information Science ISSN 1913-8989 (Print) ISSN 1913-8997 (Online)
Copyright © Canadian Center of Science and Education
To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.