Don't-care (logic)
From Wikipedia, the free encyclopedia
In digital logic, a don't-care term is an input 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. An example would be the binary values 1010 through 1111 (10 through 15) for a BCD function. 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. Don't-care terms are important to consider in minimizing using Karnaugh maps and the Quine–McCluskey algorithm.
[edit] See also
[edit] References
 |
This logic-related article is a stub. You can help by expanding it. |
