Issue No.06 - June (1989 vol.38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24287
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 multi
Reed-Muller transforms; fault detection; combinational networks; upper bound; multiple stuck-at-faults; single bridging faults; time complexity; test patterns; test generation; combinatorial circuits; computational complexity; logic testing.
T.R. Damarla, M. Karpovsky, "Fault Detection in Combinational Networks by Reed-Muller Transforms", IEEE Transactions on Computers, vol.38, no. 6, pp. 788-797, June 1989, doi:10.1109/12.24287