Need help on Tabular Method of Minimisation

[sangquang]

The tabular method (Quine-McCluskey method) is used to minimize logic functions having many variables.

You may need to take a look at this link to know what it is: http://www.ee.surrey.ac.uk/Projects/Labview/minimisation/tabular.html#introduction

Any idea to build this on Labview (for example, a logic function of 4 variables)?

[Burrito]

Hi sangquang,

I created a small program that might help you get started. It uses an array of 4 switches to represent 4 binary bits. The program determines the number of 1's in the binary representation of the number, and also finds the minterm.

From here you can extrapolate on the program in order to implement your logic minimization algorithm.

[sangquang]

Hi Burrito,

Thank you for fast reply. Could you save it to Lv 8?

[sangquang]

Burrito,

I got Lv 12 so I can read your file now.

I appreciate your suggestion. I dont have problem in converting minterm to binary.

My problems are:

1. I want users can input as many minterms as they want.

2. How could I compare all those minterms to find essential prime implicants.