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





PermuteLogicFunction IsPositiveUnateFunctionTo IsSelfDualFunction IsSymmetricFunction MinValue NineComplement binary Convert ToTruthTable DiagramGateName Email long Minus Nand MantissaToPositiveInteger RadixFromIndex To2LayerAndOr TransitionSeries Backwardly OutputAndStateBasedly Implementation To2layerOrAnd Shannon string AdjustLogicVariableCount ShannonExpansion ShrinkLogicFunction Substitute Xor Zero

搜索本網站 :

 
Buy website traffic cheap