Algorithms: Boolean Minimization
Armin Randjbar-Daemi (contact me)
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.
Click here for detailed information about this class on phpclasses.org
Php Handleiding