Quine-McCluskey Minimization Method
Advantages over K-maps
- Can be computerized
- Can handle functions of more than six variables
Overview of the method
- Given the minterms of a function
- Find all prime implicants (steps 1 and 2)
- Partition minterms into groups according to the number of 1’s
- Exhaustively search for prime implicants
- Find a minimum prime implicant cover (steps 3 and 4)
- Construct a prime implicant chart
- Select the minimum number of prime implicants