A Remark on the Nonminimality of Certain Multiple Fault Detection Algorithms

Authors:
W. Coy
Affiliations:
Department of Informatics, University of Dortmund, Dortmund, West Germany and the Faculty of Mathematics and Informatics, University of Bremen
Venue:
IEEE Transactions on Computers
Year:
1980

Citing 4
Cited 0

Multiple Fault Detection for Combinational Logic Circuits

IEEE Transactions on Computers
Cause-Effect Analysis for Multiple Fault Detection in Combinational Networks

IEEE Transactions on Computers
Authors' Reply2

IEEE Transactions on Computers
On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of Tests

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

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.