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

1.6k comments

531 users

0 votes
Hi,

I have a doubt regarding BDD2FDD algorithm ,

I have done with FDD2BDD algorithm by +ve davio with apply algorithm

FDD2BDD((-ve)) XOR root & ( Apply(xor, BDD2FDD(-ve),BDD2FDD(+ve))) using this recursive method.

But I'm not sure how to do FDD2BDD vice versa. Could you please help on this?
in # Study-Organisation (Master) by (2.7k points)

1 Answer

+1 vote
 
Best answer

For BDD2FDD, you recursively compute the FDDs of the cofactors. Then, you compute the xor of these FDDs which is (of course) a computation that takes the two FDDs of the recursive calls and computes a FDD as their xor operation. This Apply function works as the one for BDDs, i.e., recursively traverses the FDDs and moves the maximal node upwards.

For FDD2BDD, you recursively compute the BDDs of the sub functions high(f) and low(f). Then, you compute the xor of these BDDs which is (of course) a computation that takes the two BDDs computed by the recursive calls and computes a BDD as their xor operation. You just use the Apply algorithm for the latter.

So, what is the question?

by (166k points)
selected by

Related questions

0 votes
1 answer
0 votes
1 answer
asked Jan 14 in * TF "Emb. Sys. and Rob." by Faris (180 points)
0 votes
1 answer
asked Aug 21, 2023 in * TF "Emb. Sys. and Rob." by AA (190 points)
0 votes
1 answer
asked Aug 22, 2023 in # Study-Organisation (Master) by yk (2.7k points)
0 votes
1 answer
asked Aug 21, 2023 in # Study-Organisation (Master) by yk (2.7k points)
Imprint | Privacy Policy
...