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
Advanced IsEqual IsPositiveUnateFunctionTo IsZeroFunction TwoComplement binaryioset() ToVariableInvertedFunction DiagramGateName FeedbackDiagram Nor MantissaToPositiveDecimal PositiveNumberToMantissa Print Realization To2LayerAndOr ToFullAnd MaxSAT Solve Save ShortestInputsForDistinguishTwoStates Backwardly ToDigitalSystem FastVerificationData Canonical Full GetDontCareLogicFunction Utility CreateDummyLogicFunction IndependentBase Zero