Implementation of Quine-McCluskey Minimization method Using ‘C’ code
[attachment=17910]

Introduction

The Karnaugh map is a method to simplify Boolean algebra expressions.
McCluskey method is functionally identical to Karnaugh mapping, but the tabular form makes it more efficient for use in computer algorithms
This method involves two steps:
Finding all prime implicants of the function.
Use those prime implicants in a prime implicant chart to find the essential prime implicants of the function, as well as other prime implicants that are necessary to cover the function.

Quine-McCluskey Minimization

Terms are initially listed as
Each group contains terms with the same number of true and complemented variables
Terms are listed in numerical order within group
Terms and implicants are identified using one of three common notations
full variable form
cellular form
1,0,- form

Notation Forms

Full variable form - variables and complements in algebraic form
hard to identify when adjacency applies
very easy to make mistakes
Cellular form - terms are identified by their decimal index value
Easy to tell when adjacency applies; indexes must differ by power of two (one bit)
Implicants identified by term nos. separated by comma; differing bit pos. in () following terms