Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,987,003 papers from all fields of science
Search
Sign In
Create Free Account
Don't-care term
Known as:
Don't-care (logic)
, Don't care
, Can't happen
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
And-inverter graph
Binary-coded decimal
Decision table
Flip-flop (electronics)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
ELF-Murphy data on defects and tests sets
E. McCluskey
,
Ahmad A. Al-Yamani
,
+5 authors
S. Mitra
22nd IEEE VLSI Test Symposium, . Proceedings.
2004
Corpus ID: 8468348
LSI logic has designed and manufactured two test chips at CRC. These test chips were used to investigate the characteristics of…
Expand
2004
2004
Mixed RL-Huffman encoding for power reduction and data compression in scan test
M. Tehranipour
,
M. Nourani
,
Karim Arabi
,
A. Afzali-Kusha
IEEE International Symposium on Circuits and…
2004
Corpus ID: 2268957
This paper mixes two encoding techniques to reduce test data volume, test pattern delivery time and power dissipation in scan…
Expand
2001
2001
Burger-Fischer v. Degussa AG: U.S. Courts Allow Siemens and Degussa to Profit from Holocaust Slave Labor
Kara C. Ryf
2001
Corpus ID: 147507437
2001
2001
Identifying redundant gate replacements in verification by error modeling
Ž. Žilić
,
K. Radecka
Proceedings International Test Conference (Cat…
2001
Corpus ID: 34381825
This paper considers verification of combinational circuits by test vectors under assumption of gate and wire replacement faults…
Expand
1994
1994
Parallel String Matching with Variable Length Don't Cares
A. Bertossi
,
E. Lodi
J. Parallel Distributed Comput.
1994
Corpus ID: 6791354
Abstract String matching is the problem of finding all the occurrences of a pattern P in a text T, where P and T are strings over…
Expand
1994
1994
Nondeterministic finite-state machines and sequential don't cares
M. Damiani
Proceedings of European Design and Test…
1994
Corpus ID: 42863847
Nondeterministic finite-state machines are being considered for extracting and representing sequential don't care conditions…
Expand
1992
1992
Using Karnaugh maps to solve Boolean equations by successive elimination
J. Tucker
,
M. Tapia
Proceedings IEEE Southeastcon '92
1992
Corpus ID: 119684236
A novel Karnaugh map method for solving two-valued Boolean equations by successive elimination is presented. This method requires…
Expand
1992
1992
Back-propagation training of a neural network for word spotting
T. English
,
L. Boggess
IEEE International Conference on Acoustics…
1992
Corpus ID: 58747197
An approach to backpropagation training of a neural network for word spotting is described. It is assumed that the network has…
Expand
1988
1988
Don't cares and global flow analysis of Boolean networks
R. Brayton
,
E. Sentovich
,
F. Somenzi
[] IEEE International Conference on Computer…
1988
Corpus ID: 42545022
External, intermediate, and fan-out don't care sets have been used to describe information about network structure required to…
Expand
1961
1961
A Method for Resolving Multiple Responses in a Parallel Search File
E. Frei
,
J. Goldberg
IRE Transactions on Electronic Computers
1961
Corpus ID: 206673836
It is possible to build memories in which the contents of all registers are tested simultaneously, and in which there is a single…
Expand