Quine-McCluskey Method
Quine-McCluskey Method Introduction Using K-maps to find the minimised two-level form of a function is difficult for functions of more than 4 variables and nearly impossible for functions of more than 6 variables because it's hard to visualize and spot patterns in multidimensional space. An alternative to using K-maps is the Quine-McCluskey algorithm. The Quine-McCluskey algorithm provides a systematic approach for finding the prime implicants and selecting a minimum cover. Because the algorithm is tedious it is better suited to machine implementation. Quine-McCluskey Algorithm With both the K-map method and Quine-McCluskey algorithm you are trying to find a minimum number of terms that cover all of the minterms in the function. For example, the two minterms AB'CD' and ABCD' are covered by the term ACD' Both the K-map method and Quine-McCluskey algorithm go through the following 3 phases: Step 1: find prime implicants. Step 2: find essential prime...
Comments
Post a Comment