This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A fast Algorithm for Optimum Syndrome Space Compression
February 1988 (vol. 37 no. 2)
pp. 228-232
A procedure for multiple-output combinational circuits is presented that yields the optimum space compressor while using counting for time compression. The procedure is intended for the built-in selftest environment where output response data compression is appropriate. Optimum is defined as the minimum number of error patterns missed by the combination of space and time compression. The proced

[1] V. K. Agarwal and E. Cerny, "Store and generate built-in-testing approach," inProc. 11th Int. Symp. Fault Tolerant Comput., 1981, pp. 35-40.
[2] R. A. Frohwerk, "Signature analysis: A new digital field service method,"Hewlett-Packard J., pp. 2-8, May 1977.
[3] N. Benowitzet al., "An advanced fault isolation system for digital logic,"IEEE Trans. Comput., vol. C-24, pp. 489-497, May 1975.
[4] T. Sridhar, D. S. Ho, T. J. Powell, and S. M. Thatte, "Analysis and simulation of parallel signature analyzers," inProc. 1982 IEEE Int. Test Conf., pp. 656-661.
[5] K. K. Salvja and M. Karpovsky, "Testing computer hardware through data compression in space and time," inProc. 1983 IEEE Int. Test Conf., pp. 83-88.
[6] W. C. Carter, "The ubiquitous parity bit," inProc. 12th Int. Symp. Fault Tolerant Comput., 1982, pp. 289-296.
[7] J. P. Hayes, "Transition count testing of combinational logic circuit,"IEEE Trans. Comput., vol. C-25, pp. 613-620, June 1976.
[8] J. Savir, "Syndrome-testable design for combinational circuits,"IEEE Trans. Comput., vol. C-29, pp. 442-451, June 1980.
[9] A. K. Susskind, "Testing by verifying Walsh coefficients," inProc. 11th Int. Symp. Fault Tolerant Comput., 1981, pp. 206-208.
[10] T. C. Hsiao and S. Seth, "An analysis of the use of Rademacher-Walsh spectrum in compact testing,"IEEE Trans. Comput., vol. C-33, pp. 934-937, Oct. 1984.
[11] D. M. Miller and J. C. Muzio, "Spectral fault signatures for single stuck-at faults in combinational networks,"IEEE Trans. Comput., vol. C-33, pp. 765-769, Aug. 1984.
[12] J. E. Smith, "Measures of effectiveness of fault signature analysis,"IEEE Trans. Comput., vol. C-29, pp. 510-514, June 1980.
[13] V. K. Agarwal, "Increasing effectiveness of built-in-testing by output data modification," inProc. 13th Int. Symp. Fault Tolerant Comput., June 1983, pp. 227-233.
[14] N. Ahmed and K. R. Rao,Orthogonal Transforms for Digital Signal Processing. New York: Springer-Verlag, 1975.
[15] A. V. Oppenheim and R. W. Schafer,Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.

Index Terms:
optimum syndrome space compression; multiple-output combinational circuits; counting for time compression; built-in selftest; output response data compression; fast Walsh transform; automatic testing; combinatorial circuits; data compression; logic testing; transforms; Walsh functions.
Citation:
C.-H. Tung, J.P. Robinson, "A fast Algorithm for Optimum Syndrome Space Compression," IEEE Transactions on Computers, vol. 37, no. 2, pp. 228-232, Feb. 1988, doi:10.1109/12.2153
Usage of this product signifies your acceptance of the Terms of Use.