Simplification of Logic Function

We have 5 methods for the simplification of logic function.

  1. Simplification.SimpleInner : Remove the similar logic-term.
  2. Simplification.SimpleCover : Forwardly remove the full or partly covered logic-terms.
  3. Simplification.MultiCover : Backwordly remove the logic-term that is covered by multiple logic-terms.
  4. Simplification.Full : A method that generating internal logic-terms and removing the covered logic-terms.
  5. Simplification.Shannon : A method searches the fastest path to decomposite the logic-function.

The first 3 methods are used in the internal computation for reducing the logic-terms

And, the last 2 methods are the method for the quosi-optimized simplification in the realizing stage.

[ f ] = AndOr()
{
    1,-2,3,-4,-5,-6 ;
    -1,-2,3,4,-5,6 ;
    -1,2,3,-4,-5,6 ;
    1,-2,3,4,5,6 ;
    -1,-2,-3,4,-5,6 ;
    1,2,-3,4,5,6 ;
    1,2,-3,-4,-5,6 ;
    1,2,-3,-4,5,6 ;
    1,2,-3,4,5,6 ;
    -1,2,-3,-4,5,6 ;
}

// [ g ] = Simplification.Full(f);
[ g ] = Simplification.Shannon(f);

Print("result:", g);

/*
The result should be :
g = AndOr()
{
  1,2,-3,-4,6;
  1,2,-3,5,6;
  -1,-2,4,-5,6;
  2,-3,-4,5,6;
  1,-2,3,4,5,6;
  1,-2,3,-4,-5,-6;
  -1,2,3,-4,-5,6;
}
*/



IsPositiveFunction IsUnateFunction IsUnateFunctionTo PureBinary binaryioset() binaryioset Dimacs Email logicvardef minterm() LeastSignificantDigit MantissaToPositiveNumber PositiveDecimalToMantissa PositiveNumberToMantissa RadixFromIndex object() real() To2LayerOrAnd To2LayerAndXor To2LayerNand Assign To2layerOrAnd Compatibility ShannonTree Balanced MultiCover StateTransition RandomGenerate Xor Zero

Search This Website :

 
Buy website traffic cheap