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 IsCovering IsNegativeUnateFunctionTo IsZeroFunction ToAndOr Binary MaxValue BCD Convert ToOrAnd ToPOS DigitalSystem Dimacs LeastSignificantDigit RadixFromIndex POS To2LayerOrAnd SOP Solve InputVariables OutputAndStateBasedly ToFeedbackSystem GetExcitationTable DontCare MultiCover TruthTable GetDontCareLogicFunction ComputeDONTCARE var() Zero

搜索本網站 :

 
Buy website traffic cheap