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 IsSelfDualFunction IsSymmetricFunctionTo FromBinary MaxValue MinValue GrayCode TwoComplement ToAndXor ToNotFunction ToXORP FeedbackSystem list() Count Get PositiveDecimalToMantissa RadixFromIndex One PermutationMatrix InputVariables ToFeedbackSystem ToDigitalSystem Compatibility ShannonTree BestVariableOrder DontCare SimpleCover AdjustLogicVariableCount EnlargeLogicFunction Zero

搜索本網站 :

 
Buy website traffic cheap