Fault detection in combinational networks by Reed-Muller transforms
- 1 June 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (6) , 788-797
- https://doi.org/10.1109/12.24287
Abstract
A new approach for fault detection in combinational networks based on Reed-Muller (RM) transforms is presented. An upper bound on the number of RM spectral coefficients required to be verified for detection of multiple stuck-at-faults and single bridging faults at the input lines of an n-input network is shown to be n. The time complexity (time required to test a network) for detection of multiple terminal faults and the storage required for storing the test are determined. An upper bound is found for the minimum number of test patterns required to detect a fault. The authors present standard tests based on this result, with a simple test generation procedure and upper bounds on minimal numbers of test patterns.Keywords
This publication has 14 references indexed in Scilit:
- Fault detection in combinational networks by Reed-Muller transformsIEEE Transactions on Computers, 1989
- A parity bit signature for exhaustive testingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Spectral Fault Signatures for Single Stuck-At Faults in Combinational NetworksIEEE Transactions on Computers, 1984
- Minimisation of Reed-Muller polynomials with fixed polarityIEE Proceedings E Computers and Digital Techniques, 1984
- Testing by Verifying Walsh CoefficientsIEEE Transactions on Computers, 1983
- Mapping of Reed-Muller coefficients and the minimisation of exclusive OR-switching functionsIEE Proceedings E Computers and Digital Techniques, 1982
- Minimization of Reed–Muller Canonic ExpansionIEEE Transactions on Computers, 1979
- Fault Detecting Test Sets for Reed-Muller Canonic NetworksIEEE Transactions on Computers, 1975
- Unateness Properties of and-Exclusive-or Logic CircuitsIEEE Transactions on Computers, 1974
- Easily Testable Realizations ror Logic FunctionsIEEE Transactions on Computers, 1972