Category:Quine-McCluskey algorithm

From LiteratePrograms
Jump to: navigation, search

The Quine-McCluskey algorithm is a two-level logic minimization method. It takes a boolean formula and attempts to reduce it to an equivalent, more succinct boolean formula. For example, suppose A, B and C are boolean variables, and the logical negation of X is written as \bar{X}. Then we could reduce this boolean formula f:

f(A,B,C) = \bar{A}\bar{B}\bar{C} + \bar{A}B + AB\bar{C} + AC

To this equivalent formula:

f(A,B,C) = B + AC + \bar{A}\bar{C}

This boolean formula minimization problem is also solved by Karnaugh maps, but in a less systematic and scalable way.

hijacker
hijacker
hijacker
hijacker

This category currently contains no pages or media.