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





MatchLogicFunction IsBiUnateFunction IsCovering IsOneFunction IsSelfDualFunction IsUnateFunction And BCDEx3 BinaryNumberToString binary binaryioset() ToSOP Diagram DigitalSystem Equiv Get MostSignificantDigit RadixFromIndex OrAnd PermutationMatrix To2LayerAndOr ShortestInputsForTransition Forwardly SimpleCover TimingChart EnlargeLogicFunction Normalization ShrinkLogicFunction XORP Zero

Search This Website :

 
Buy website traffic cheap