Convert.ToShannonTree
Back to table
/*
Logic-Function-Analysis
Convert.ToShannonTree
[BDD g]=Convert.ToShannonTree(LogicFunction f);
f : a logic function
g : a logic fucntion in the BDD form.
Compute the Shannon-Tree (No-reduced-no-reorderd BDD) of the logic object.
*/
//-------------------------------------------------------------------
// examples
f=AndOr()
{
1,-2;
-1,2;
}
g=Convert.ToShannonTree(f);
Print(f,g);
//-------------------------------------------------------------------
// result
IsInverse IsLinearFunction IsSymmetricFunctionTo IsUnateFunctionTo BDD binary() AbsoluteExpression GrayCode PureBinary ToDualFunction ToVariableInvertedFunction ToXORP Eq logicvardef NumberSystem LeastSignificantDigit MostSignificantDigit RadixToIndex To2LayerAndXor To2LayerNand OutputAndStateBasedly Simplification Balanced FastVerificationData ROBDD CreateFromLogicFunctions GetSubTable Normalization ShannonExpansion Zero