ShannonTree.Fast


Back to table

/*
Shannon-Tree
ShannonTree.Fast

[BDD tree]=ShannonTree.Fast(LogicFunction F);

F : a logic function
tree : a logic function in the BDD form

Create the tree of the given logic-function with the fast algorithm.

The result very depends on the selection of the first few variables. Hence, sometimes it returns some unexpected terrible result.
*/
//-------------------------------------------------------------------
// examples
f = AndOr()
{
		2,4;
		1,-3;
		-1,2,3;
		-1,2,3,4;
		-2,-4;
}

g=ShannonTree.Fast(f);
Print(f,g);

//-------------------------------------------------------------------
// result





MatchLogicFunction IsBiUnateFunction IsPositiveUnateFunctionTo IsSymmetricFunctionTo binary() List OneComplement StringToBinaryNumber binaryioset bool FeedbackDiagram Nand MantissaToPositiveInteger PositiveNumberToMantissa RadixFromIndex To2LayerNor To2LayerOrAnd To2LayerAndOr ToFullAnd Save InputVariables ToStateTransitionTable ToDigitalSystem GetDontCareLogicFunction GetPositiveLogicFunction Utility IndependentBase ShannonExpansion Xor Zero

搜索本網站 :

 
Buy website traffic cheap