The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1980 vol.29)
pp: 757-759
W. Coy , Department of Informatics, University of Dortmund, Dortmund, West Germany and the Faculty of Mathematics and Informatics, University of Bremen
ABSTRACT
Poage has constructed a complex fault detection algorithm which generates a complete and minimal test set of all multiple stuck-at faults of a given combinational network. Several authors have derived from his method fast and simple multiple fault detection algorithms, which are claimed to generate complete test sets with a "near-minimal" or "near-optimal" number of tests. We show that the algorithms by Bossen and Hong and the algorithm by Yang and Yau may generate test sets with an exponential number of tests (relative to the number of inputs) where a linear number of tests is sufficient for a complete multiple fault detection test set.
INDEX TERMS
redundant networks, Algorithms, cause-effect analysis, combinational networks, fault detection, fault functions, multiple stuck-at faults, test complexity, test pattern generation
CITATION
W. Coy, "A Remark on the Nonminimality of Certain Multiple Fault Detection Algorithms", IEEE Transactions on Computers, vol.29, no. 8, pp. 757-759, August 1980, doi:10.1109/TC.1980.1675666
37 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool