essential prime implicant

essential prime implicant
A prime implicant on a Karnaugh map which "covers" at least one 1 which is not covered by any other prime implicant.

Wikipedia foundation.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • non-essential prime implicant — noun On a Karnaugh map: a prime implicant which does not cover any 1 which cannot covered by some other prime implicant. Ant: essential prime implicant …   Wiktionary

  • Implicant — In Boolean logic, an implicant is a covering (sum term or product term) of one or more minterms in a sum of products (or maxterms in a product of sums) of a boolean function. Formally, a product term P in a sum of products is an implicant of the… …   Wikipedia

  • Quine–McCluskey algorithm — The Quine–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of boolean functions which was developed by W.V. Quine and Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular… …   Wikipedia

  • Petrick's method — In Boolean algebra, Petrick s method (also known as the branch and bound method) is a technique for determining all minimum sum of products solutions from a prime implicant chart. Petrick s method is very tedious for large charts, but it is easy… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”