Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.1k questions

1.2k answers


510 users

0 votes
I have a doubt regarding the conversion of BDD to ZDD. We have an algorithm , but it's pretty lengthy. Do we have some other methods to convert BDD to ZDD.

What I am thinking of,

1) BDD to FDD by, Full DNF-> RMNF ( using xor reductions for negations as well) It will give me the FDD equation.

2) Taking this FDD as my next input then, add missing terms as ( missing_term xor 1), then do reduction. It should give my ZDD.

Is it correct ?
in # Study-Organisation (Master) by (2.7k points)

1 Answer

+1 vote
Best answer
What you essentially suggest is to convert the BDD to a FDD and then to a ZDD. I doubt that this is simpler in general.

However, why not undoing the BDD elimination rule to get a non-reduced BDD and then applying the elimination rule of ZDDs? That can also be done on subtrees first to keep the complexity under control.
by (162k points)
selected by it . Can we use any methods for conversion or should we always us algorithms given in the notes?
If you have another correct algorithm, it is fine, but then you should explain what you are computing, since otherwise, the people correcting it will be surprised and not convinced at first.
Thanks for the clarification.

Related questions

0 votes
1 answer
0 votes
1 answer
asked Aug 20 in # Study-Organisation (Master) by yk (2.7k points)
+1 vote
1 answer
Imprint | Privacy Policy