Prime Implicant
The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions

Use Me  ?

New searches

You are here:Open notes-->Seminar-topics-and-ppt-for-engineering-->Prime-Implicant

Prime Implicant

How to study this subject

A prime implicant of a function is an implicant that cannot be covered by a more general (more reduced - meaning with fewer literals) implicant. W.V. Quine defined a prime implicant of F 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 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 xy (and others) is a prime implicant, xyz and xyzw are not. From the latter, multiple literals can be removed to make it prime:

  • x, y and z can be removed, yielding w.
  • Alternatively, z and w can be removed, yielding xy.
  • Finally, x and w can be removed, yielding 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 xyz to xy or to yz without changing the cover of f

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

Official Notes

Add contents here

Notes from other sources

implicants; Using Don't Cares to simplify functions.

Model question papers

Add contents here

Previous year question papers

Add contents here

Useful links



Join eduladder!