Simplification.Canonical


Back to table

/*
Logic-Function-Analysis
Simplification.Canonical

[LogicFunction g]=Simplification.Canonical(LogicFunction f);

f : a logic function
g : a logic function may in the simpler form

Simplify a logic function with the full algorithm but without removing the multi-covered logic terms.

*/
//-------------------------------------------------------------------
// examples
P=AndOr(){ 
   1,2 ; 
   -1,3 ; 
   -1,-2,3 ; 
   -1,-2,-3 ; 
   1,2,3 ; 
}
[f]=Simplification.Canonical(P);
Print(f);


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





IsBiUnateFunction IsLinearFunction IsSelfDualFunction IsSymmetricFunction IsThresholdFunction Binary BCDEx3 OneComplement ToSOP FeedbackDiagram FeedbackSystem Imply Load Nand PermutationMatrix Print To2LayerAndXor SAT MaxSAT Save Simplification Full StateTransition TimingChart GetDontCareLogicFunction GetPositiveLogicFunction AdjustLogicVariableCount CreateDummyLogicFunction ShannonExpansion Zero

Search This Website :

 
Buy website traffic cheap