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
MatchLogicFunction IsPositiveUnateFunctionTo IsSelfAntiDualFunction AbsoluteExpression BCDEx3 ToDualFunction ToTruthTable DiagramGateName DigitalSystem Eq Equiv list() Count Get Nor Not PositiveDecimalToMantissa Print To2LayerAndOr SAT AutoAssignInputAndStateVariables Forwardly Compatibility DontCare StateDeviceName StateTransition CreateDummyLogicFunction Normalization XORP Zero