| Recommend this page to a friend! |
| Classes of Armin Randjbar-Daemi | > | Boolean Minimization | > | Download .tar.gz .zip | > | > | > | |||||
|
| |||||||||||||||||||||||||||||||||||||||||||
| Detailed description | ||
| 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. |
| Groups | ||
| Algorithms | Numerical and statistical algorithms | View top rated classes |
| Applications | Related links | |||||||
No application links were specified for this class.
|
|||||||||||||||||||||||||||||||||||||||||||||