This PR is for adding support to non-SOP expression minimization in the Boolean Logic Library.
The main difference is in the generation of the truth table: a brute-force approach is taken where the expression is evaluated for every row in the table. Then espresso algorithm is called similar to SOP expressions.
This PR is for adding support to non-SOP expression minimization in the Boolean Logic Library.
The main difference is in the generation of the truth table: a brute-force approach is taken where the expression is evaluated for every row in the table. Then espresso algorithm is called similar to SOP expressions.