The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1991 vol.40)
pp: 320-324
ABSTRACT
<p>A method for the derivation of fault signatures for the detection of faults in single-output combinational networks is described. The approach uses the arithmetic spectrum instead of the Rademacher-Walsh spectrum. It is a form of data compression that serves to reduce the volume of the response data at test time. The price which is paid for the reduction in the storage requirements is that some of the knowledge of exact fault location is lost. The derived signatures are short and easily tested using very simple test equipment. The test circuitry could be included on the chip since the overhead involved is comparatively small. The test procedure requires a high-speed counter cycling at maximum speed through selected subsets of all input combinations. Hence, the network under test is exercised at speed, and a number of dynamic errors that are not testable by means of conventional test-set approaches will be detected.</p>
INDEX TERMS
fault detection; fault signatures; single-output combinational networks; arithmetic spectrum; data compression; response data; storage requirements; chip; high-speed counter; dynamic errors; combinatorial circuits; data compression; integrated circuit testing; logic testing.
CITATION
K.D. Heidtmann, "Arithmetic Spectrum Applied to Fault Detection for Combinational Networks", IEEE Transactions on Computers, vol.40, no. 3, pp. 320-324, March 1991, doi:10.1109/12.76409
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool