|Info||View files (3)||Download .zip||Reputation||Support forum||Blog|
|Last Updated||Ratings||Unique User Downloads||Download Rankings|
|2008-03-17 (6 years ago)||Not enough user ratings||Total: 311||All time: 6,443 This week: 1,726|
|boolean_minimization 0.9||GNU General Public Lice...||4||Algorithms|
This class can be used to minimize boolean expressions using base 3 matrix.
It takes as parameters minterms and variables.
The class performs boolean minimization and returns the prime implicants as a class array variable.
It uses the principle that any combination of causal conditions is a line number in the base 3 matrix. Also a prime implicant produced by minimizing two other combinations, is itself a line number in the base 3 matrix.
This algorithm does not use bit by bit binary comparison, so it is faster than the classic Quine-McCluskey method.
|Install with Composer|
|Version Control||Unique User Downloads||Download Rankings|
|This week:||0||This week:||1,726|