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





IsEqual IsLinearFunction IsMonotonicFunction IsPositiveFunction IsPositiveUnateFunctionTo IsThresholdFunction IsUnateFunction IsUnateFunctionTo GrayCode AddXorTerm ToTruthTable Equiv LogicScript minterm MantissaToPositiveDecimal One To2LayerNor Solve Save Sequential StateVariables CreateCompactTable ROBDD TimingChart Utility AdjustLogicVariableCount CreateDummyLogicFunction ShannonExpansion var Zero

Search This Website :

 
Buy website traffic cheap