Don't-care (logic)

Don't-care (logic)

In digital logic, a don't-care term is an input-sequence (a series of bits) to a function that the designer does not care about, usually because that input would never happen, or because differences in that input would not result in any changes to the output. By using these don't-care inputs, designers can potentially minimize their function much more so than if the don't-care inputs were taken to have an output of all 0 or all 1. An example of a would be the binary values 1010 through 1111 (10 through 15) for a function that takes a BCD value, because a BCD value is never made up of the values 1010 to 1111. Don't-care terms are important to consider in minimizing using Karnaugh maps and the Quine–McCluskey algorithm.

ee also

* Karnaugh map
* Quine–McCluskey algorithm

References

* [http://134.193.15.25/vu/course/cs281/lectures/simplification/simplification.html An explanation on boolean simplification and don't-care terms]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Don't Care — This article is about the music single. For the meaning relating to digital logic, see Don t care (logic). Don t Care Single by Obituary …   Wikipedia

  • Don't-care term — In digital logic, a don t care term is an input sequence (a series of bits) to a function that the designer does not care about, usually because that input would never happen, or because differences in that input would not result in any changes… …   Wikipedia

  • Don't-care — In logic synthesis and logic simulation a don t care or X value is one value in a multi valued logic system that denotes an unknown value, or a value that the designer (for whatever reason) does not care about. In the Verilog hardware description …   Wikipedia

  • Don J. Grundmann — Infobox Person name = Donald J. Grundmann image size = 150px caption = birth name = birth date = Birth date and age|1952|3|5 birth place = Oakland, California death date = death place = death cause = residence = San Leandro, California other… …   Wikipedia

  • Ternary logic — A ternary, three valued or trivalent logic (sometimes abbreviated 3VL) is a term to describe any of several multi valued logic systems in which there are three truth values indicating true , false and some third value. This is contrasted with the …   Wikipedia

  • Paraconsistent logic — A paraconsistent logic is a logical system that attempts to deal with contradictions in a discriminating way. Alternatively, paraconsistent logic is the subfield of logic that is concerned with studying and developing paraconsistent (or… …   Wikipedia

  • Concurrent constraint logic programming — is a version of constraint logic programming aimed primarily at programming concurrent processes rather than (or in addition to) solving constraint satisfaction problems. Goals in constraint logic programming are evaluated concurrently; a… …   Wikipedia

  • Espresso heuristic logic minimizer — The Espresso logic minimizer is a computer program using heuristic and specific algorithms for efficiently reducing the complexity of digital electronic gate circuits.[1] Espresso was developed at IBM by Robert Brayton. Rudell later published the …   Wikipedia

  • Linear logic — In mathematical logic, linear logic is a type of substructural logic that denies the structural rules of weakening and contraction . The interpretation is of hypotheses as resources : every hypothesis must be consumed exactly once in a proof.… …   Wikipedia

  • The Care Bears Adventure in Wonderland — Infobox Film name = The Care Bears Adventure in Wonderland caption = Original theatrical poster director = Raymond Jafelice producer = Michael Hirsh Patrick Loubert Clive A. Smith writer = Peter Sauder (from the works of Lewis Carroll) music =… …   Wikipedia

Share the article and excerpts

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