01-09-2015, 05:58 PM
quine mccluskey algorithm implementation in java..source code with gui if possible..pls its urgent
|
quine mccluskey algorithm implementation
|
quine mccluskey algorithm implementation in java..source code with gui if possible..pls its urgent
31-03-2017, 03:07 PM
The Quine-McCluskey method is useful for minimizing logical expressions for a greater number of variables when compared to minimization by Karnaugh Map or Boolean Algebra. In this work, we have tried to gather all the computer codes that are available on the Internet, to edit and modify them, as well as to rewrite some parts of the codes collected by ourselves that are used in the implementation of the QuineMcCluskey method. A brief introduction and logic of this method are discussed after the codes have been provided. The Quine-McCluskey method has been implemented using computer languages such as C and C ++ using a number of variations. Our effort is to list them all, so that readers well versed in any of the particular computer languages find it easy to follow the code written in that particular language.
The Quine-McCluskey algorithm or the prime implants method is a method used to minimize Boolean functions. It was developed by W.V. Quine and Edward J. McCluskey in 1956. It is functionally identical to Karnaugh mapping, but the tabular form makes it more efficient for use in computer algorithms, and also gives a deterministic way of verifying that the minimal form of a Boolean function has been reached. It is sometimes referred to as a tabulation method. The method involves two steps:
1. Find all prime implicants of the function.
2. Use the prime implicants in a main implicit letter to find the essential primary implicants of the function, as well as other prime implicants that are necessary to cover the function.
The Quine-McCluskey algorithm or the prime implants method is a method used to minimize Boolean functions. It was developed by W.V. Quine and Edward J. McCluskey in 1956. It is functionally identical to Karnaugh mapping, but the tabular form makes it more efficient for use in computer algorithms, and also gives a deterministic way of verifying that the minimal form of a Boolean function has been reached. It is sometimes referred to as a tabulation method. The method involves two steps:
1. Find all prime implicants of the function.
2. Use the prime implicants in a main implicit letter to find the essential primary implicants of the function, as well as other prime implicants that are necessary to cover the function.
|
« Next Oldest | Next Newest »
|
