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





Advanced IsMonotonicFunction IsParityFunction IsSelfDualFunction IsSymmetricFunctionTo And BDD Binary TwoComplement binaryioset bool ToNotFunction ToSOP Diagram DiagramGateName Count MantissaToPositiveDecimal MostSignificantDigit object() Realization To2LayerNand Implementation Full StateDeviceName TruthTable GetPositiveLogicFunction RandomGenerate var XORP Zero

Search This Website :

 
Buy website traffic cheap