DocumentCode
2748191
Title
Polynomial time solvable fault detection problems
Author
Chakradhar, Srimat T. ; Agrawal, Vishwani D. ; Bushnell, Michael L.
Author_Institution
Dept. of Comput. Sci., Rutgers Univ., Piscataway, NJ, USA
fYear
1990
fDate
26-28 June 1990
Firstpage
56
Lastpage
63
Abstract
A class of combinational circuits, called the (k,K)-circuits is presented, and a polynomial-time algorithm to detect any single or multiple stuckfault in such circuits is introduced. The (k,K)-circuits are a generalization of H. Fujiwara´s (1988) K-bounded circuits. The fault detection problem is formulated as an energy minimization problem using the bidirectional neural net model proposed earlier. A minimizing point of the energy function corresponds to a test. A polynomial-time algorithm is presented here to solve the single and multiple fault-detection problem for the (k,K)-circuits by recursively eliminating variables in the energy function.<>
Keywords
combinatorial circuits; fault location; logic testing; neural nets; bidirectional neural net model; combinational circuits; energy minimization problem; fault detection problem; polynomial-time algorithm; stuckfault; Circuit faults; Circuit testing; Combinational circuits; Computer science; Electrical fault detection; Fault detection; Fault diagnosis; Integrated circuit interconnections; Logic circuits; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Fault-Tolerant Computing, 1990. FTCS-20. Digest of Papers., 20th International Symposium
Conference_Location
Newcastle Upon Tyne, UK
Print_ISBN
0-8186-2051-X
Type
conf
DOI
10.1109/FTCS.1990.89335
Filename
89335
Link To Document