Implicant

In Boolean logic, the term implicant has either a generic or a particular meaning. In the generic use, it refers to the hypothesis of an implication (wiktionary:implicant). In the particular use, a product term (i.e., a conjunction of literals) P is an implicant of a Boolean function F, denoted ${\displaystyle P\leq F}$, if P implies F (i.e., whenever P takes the value 1 so does F). For instance, implicants of the function

${\displaystyle f(x,y,z,w)=xy+yz+w}$

include the terms ${\displaystyle xy}$, ${\displaystyle xyz}$, ${\displaystyle xyzw}$, ${\displaystyle w}$, as well as some others.

Prime implicant

A prime implicant of a function is an implicant (in the above particular sense) that cannot be covered by a more general, (more reduced - meaning with fewer literals) implicant. W. V. Quine defined a prime implicant to be an implicant that is minimal - that is, the removal of any literal from P results in a non-implicant for F. Essential prime implicants (aka core prime implicants) are prime implicants that cover an output of the function that no combination of other prime implicants is able to cover.

Using the example above, one can easily see that while ${\displaystyle xy}$ (and others) is a prime implicant, ${\displaystyle xyz}$ and ${\displaystyle xyzw}$ are not. From the latter, multiple literals can be removed to make it prime:

• ${\displaystyle x}$, ${\displaystyle y}$ and ${\displaystyle z}$ can be removed, yielding ${\displaystyle w}$.
• Alternatively, ${\displaystyle z}$ and ${\displaystyle w}$ can be removed, yielding ${\displaystyle xy}$.
• Finally, ${\displaystyle x}$ and ${\displaystyle w}$ can be removed, yielding ${\displaystyle yz}$.

The process of removing literals from a Boolean term is called expanding the term. Expanding by one literal doubles the number of input combinations for which the term is true (in binary Boolean algebra). Using the example function above, we may expand ${\displaystyle xyz}$ to ${\displaystyle xy}$ or to ${\displaystyle yz}$ without changing the cover of ${\displaystyle f}$.[1]

The sum of all prime implicants of a Boolean function is called its complete sum, minimal covering sum, or Blake canonical form.

See also

• Quine–McCluskey algorithm
• Karnaugh map
• Petrick's method

References

1. De Micheli, Giovanni. Synthesis and Optimization of Digital Circuits. McGraw-Hill, Inc., 1994

External links

• Slides explaining implicants, prime implicants and essential prime implicants
• Examples of finding essential prime implicants using K-map