The Eladr Protocol is a decentralized, security and efficiency enhanced Web3 noSQL database powered by IPFS as the data storage layer https://ipfs.io/, and the Cardano block chain as the rewards token platform, https://cardano.org/. It provides a JSON based, IPFS layer 2 solution for data indexing and retrieval in an 'append only' file system built with open source Node.js API libraries.

The ELADR token was designed to incentivize and reward community members as a proof of contribution. Token holders are also granted access to EduLadder.com premium features as well as associated ELADR token enabled apps.

WHITE PAPER Buy Now Try BETA

Real Problems! Real Experts!

Watch related videos of your favorite subject.
Connect with students from different parts of the world.
See Our team
Wondering how we keep quality?
Got unsolved questions?

You are here:Open notes-->Seminar-topics-and-ppt-for-engineering-->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.

# Previous year question papers

#### Editors

RajivRajivRajivRajiv

## Tool box

Edit this note | Upvote | Down vote | Questions

### Watch more videos from this user Here

Learn how to upload a video over here