Quine Mccluskey (Tabular) Minimization

QUINE-MCCLUSKEY (TABULAR) MINIMIZATION:

·              Two step process utilizing tabular listings to:

^§          Identify prime implicants (implicant tables)

^§          Identify minimal PI set (cover tables)

·              All work is done in tabular form

^§          Number of variables is not a limitation

^§          Basis for many computer implementations

^§          Don’t cares are easily handled

·              Proper organization and term identification are key factors for correct results 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

·              1,0,- form - terms are identified by their binary index value

^§          Easier to translate to/from full variable form

^§          Easy to identify when adjacency applies, one bit is different

^§          - shows variable(s) dropped when adjacency is used

·              Different forms may be mixed during the minimization