An Efficient Method for Generating Optimal OBDD of Boolean Functions
MetadataShow full item record
Singh, Ashutosh Kumar and Mohan, Anand. 2008. An Efficient Method for Generating Optimal OBDD of Boolean Functions. Computer and Information Science. 1 (2): pp. 56-62.
Computer and Information Science
Curtin Sarawak - Faculty Office
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.
Showing items related by title, author, creator and subject.
Herrmann, Johannes; Soh, Sieteng; Rai, S.; West, Geoffrey (2010)The expected hop count (EHC) or performability of a wireless sensor network (WSN) with probabilistic node failures provides the expected number of operational nodes a message traverses from a set of sensors to reach its ...
Herrmann, Johannes u (2010)The Augmented Ordered Binary Decision Diagram (OBDD-A) has been shown to be extremely efficient for reliability calculations, especially when combined with the Boundary Set method of partition representation. The existing ...
Herrmann, Johannes; Soh, Sieteng (2013)Digital channel capacity of a network is an important factor in network design. Recent solutions use the Markov chain to model and compute the capacity of only a specific wireless network with multiple relays and multiple ...