In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.

Watch related videos of your favorite subject.

Connect with students from different parts of the world.

Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE

See Our team

Wondering how we keep quality?

Got unsolved questions? Ask Questions

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 (and others) is a prime implicant, and are not. From the latter, multiple literals can be removed to make it prime:

- , and can be removed, yielding .
- Alternatively, and can be removed, yielding .
- Finally, and can be removed, yielding .

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 to or to without changing the cover of

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