2013 |
Volume 1 |
Issue Issue 1
An Algorithm for the Construction of Decision Diagram by Eliminating, Merging and Rearranging the Input Cube Set
1.
Manjunath Managuli
– Asst. Prof., Department Of Cse, Vijaya Vittal Institute Of Technology, Bangalore, Karnataka, India
2.
Yogeshkumar M. H.
– Asst. Prof., Department Of Cse, Vijaya Vittal Institute Of Technology, Bangalore, Karnataka, India
Received
10-Nov-2013
|
Accepted
-
|
Published
10-Nov-2013
|
Abstract
This proposed work is Decision Diagrams are a
data structure that allows compact representation of
discrete functions Boolean functions. The construction
of DDS in terms of memory and time is considered as
problems .we proposed method of eliminating, merging
and reordering the set of cubes in matrix specification
that results in the reduction of both memories occupied
and time complexities of the construction of DDs. First
we employ elimination algorithm followed by merging
and then again elimination algorithm and reordering
the set of cubes .In this way, the number of operations
on the nodes is reduced. This reduction results in a
decrease both in the number of temporary nodes and
construction time the experiments show that the total
number of created nodes is reduced on an average by
35% and construction time is decreased by 49%.
Keywords Cubes, Decision Diagram
Locked
Subscribed
Open Access
