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





IsBiUnateFunctionTo IsNegativeUnateFunctionTo IsUnateFunctionTo BDD ToAndOr MaxValue StringToBinaryNumber ToDualFunction ToXORP DigitalSystem FeedbackSystem minterm MantissaToPositiveDecimal PositiveIntegerToMantissa PositiveNumberToMantissa Radixes PermutationMatrix real To2LayerNor Save ToStateTransitionTable string() CreateFromLogicFunctions ComputeDONTCARE ComputeFunctionOrder CreateDummyLogicFunction Normalization var XORP Zero

Search This Website :

 
Buy website traffic cheap