An Efficient Method for Generating Optimal OBDD of Boolean Functions
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 d...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
Canadian Center of Science and Education
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/47374 |
| Summary: | 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. |
|---|