ShannonTree.Balanced
Back to table
/*
Shannon-Tree
ShannonTree.Balanced
[BDD tree]=ShannonTree.Balanced(LogicFunction F);
F : a logic function
tree : a logic function in the BDD form
Create the tree of the given logic-function with the balanced algorithm.
The balanced algorithm is an algorithm to decomposite the logic function with considering the positive and the negative functions simultanueously.
*/
//-------------------------------------------------------------------
// examples
f = AndOr()
{
2,4;
1,-3;
-1,2,3;
-1,2,3,4;
-2,-4;
}
g=ShannonTree.Balanced(f);
Print(f,g);
//-------------------------------------------------------------------
// result
IsEqual IsOneFunction IsUnateFunction AndOr BDD List MinValue BCDEx3 binaryioset() binaryioset ToSOP Diagram Dimacs Load MantissaToPositiveInteger RadixFromIndex RadixToIndex OrAnd Print SOP To2LayerNand TransitionSeries CreateCompactTableWithFullSimplification SimpleCover GetDontCareLogicFunction GetNegativeLogicFunction RandomGenerate AdjustLogicVariableCount ComputeDONTCARE Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.