Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Don't-care term

Known as: Don't-care (logic), Don't care, Can't happen 
In digital logic, a don't-care term for a function is an input-sequence (a series of bits) for which the function output does not matter. An input… Expand
Wikipedia

Related topics

Related topics

12 relations
And-inverter graphBinary-coded decimalDecision tableFlip-flop (electronics)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
SALSA: Systematic logic synthesis of approximate circuits
Approximate computing has emerged as a new design paradigm that exploits the inherent error resilience of a wide range of… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
An Algorithm for Synthesis of Reversible Logic Circuits
Reversible logic finds many applications, especially in the area of quantum computing. A completely specified n-input, n-output… Expand
  • figure 3
  • figure 2
  • figure 1
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Dictionary matching and indexing with errors and don't cares
This paper considers various flavors of the following online problem: preprocess a text or collection of strings, so that given a… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
XID: Don't care identification of test patterns for combinational circuits
Given a test set for stuck-at faults of a combinational circuit or a full-scan sequential circuit, some of the primary input… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Quality of experience
  • R. Jain
  • IEEE MultiMedia
  • 2004
    • Corpus ID: 41960653
In a technical product's early stages, the typical IEEE MultiMedia reader would judge it by the strength and novelty of its… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Thinking in Java
From the Book: I suggested to my brother Todd, who is making the leap from hardware into programming, that the next big… Expand
  • table 11-4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
The efficiency of Boolean function manipulation depends on the form of representation of Boolean functions. Binary Decision… Expand
  • figure 1
  • figure 7
  • figure 10
  • table 4
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A new approach to text searching
We introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with don't… Expand
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
1967
Highly Cited
1967
Generalization of Consensus Theory and Application to the Minimization of Boolean Functions
  • P. Tison
  • IEEE Trans. Electron. Comput.
  • 1967
    • Corpus ID: 32541506
Given two implicants of a Boolean function, we can, by performing their consensus, find a third implicant. This operation has… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE