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
IsBiUnateFunction IsParityFunction IsSelfAntiDualFunction MinValue BCD binary bool() ToDualFunction ToNotFunction ToVariableInvertedFunction Eq Count MantissaToPositiveNumber MostSignificantDigit PositiveNumberToMantissa RadixFromIndex RadixToIndex object() OrAnd Solve Forwardly ToDigitalSystem BestVariableOrder string() TimingChart TruthTable GetDontCareLogicFunction GetPositiveLogicFunction ComputeFunctionOrder Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.