Aliasing and Diagnosis Probability in MISR and STUMPS Using a General Error Model

A number of methods have been proposed to study aliasing in MISR compression. However, most of the methods can compute aliasing probability only for specific test lengths and/or specific error models. Recently, a GLFSR structure [15] was introduced which admits coding theory formulation. The conventional signature analyzers such as LFSR and MISR form special cases of this GLFSR structure. Using this formulation, a general result is now presented which computes the exact aliasing probability for MISRs with primitive feedback polynomials, for any test length and for any error model. The framework is then extended to study the probability of correct diagnosis when faulty signature is used to identify the faulty CUT in the STUMPS environment. Specifically, the results in [7, 15, 161 are extended by proposing two new error models, a general error model which subsumes all the commonly used models, and a fixed magnitude error model which is shown to be useful for fault diagnosis. It is shown how statistical simulation can be used to determine the general error model, for a given CUT. Aliasing for some benchmark circuits, for various error models and test lengths is studied.

[1]  Dhiraj K. Pradhan,et al.  A New Framework for Designing and Analyzing BIST Techniques and Zero Aliasing Compression , 1991, IEEE Trans. Computers.

[2]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[3]  Kazuhiko Iwasaki,et al.  Design of signature circuits based on weight distributions of error-correcting codes , 1990, Proceedings. International Test Conference 1990.

[4]  Theo J. Powell,et al.  Analysis and Simulation of Parallel Signature Analyzers , 1987, ITC.

[5]  K. Iwasaki,et al.  An analysis of the aliasing probability of multiple-input signature registers in the case of a 2m-ary symmetric channel , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  M. Gruetzner,et al.  Aliasing Errors in Signature in Analysis Registers , 1987, IEEE Design & Test of Computers.

[7]  Dhiraj K. Pradhan,et al.  A new framework for designing and analyzing BIST techniques: computation of exact aliasing probability , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.

[8]  Mark G. Karpovsky,et al.  Spectral Techniques and Fault Detection , 1985 .

[9]  W. Daehn,et al.  Aliasing errors in multiple input signature analysis registers , 1989, [1989] Proceedings of the 1st European Test Conference.

[10]  Michele Favalli,et al.  An analytical model for the aliasing probability in signature analysis testing , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Nirmal R. Saxena,et al.  A Unified View of Test Compression Methods , 1987, IEEE Transactions on Computers.

[12]  Dhiraj K. Pradhan,et al.  Aliasing Probability for Multiple Input Signature Analyzer , 1990, IEEE Trans. Computers.

[13]  Ian F. Blake,et al.  On the Complete Weight Enumerator of Reed-Solomon Codes , 1991, SIAM J. Discret. Math..

[14]  B. Ricco,et al.  Aliasing in signature analysis testing with multiple-input shift-registers , 1989, [1989] Proceedings of the 1st European Test Conference.

[15]  Jacob Savir,et al.  Built In Test for VLSI: Pseudorandom Techniques , 1987 .

[16]  André Ivanov,et al.  An iterative technique for calculating aliasing probability of linear feedback signature registers , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[17]  Shu Lin,et al.  The binary weight distribution of the extended (2m,2m − 4) code of the Reed-Solomon code over GF(2m) with generator polynomial (x − α)(x − α2)(x − α3) , 1988 .

[18]  Dhiraj K. Pradhan,et al.  Fault-tolerant computing : theory and techniques , 1986 .