This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Aliasing Probability for Multiple Input Signature Analyzer
April 1990 (vol. 39 no. 4)
pp. 586-591

Single and multiple multiple-input-signature-register (MISR) aliasing probability expressions are presented for arbitrary test lengths. A framework, based on algebraic codes, is developed for the analysis and synthesis of MISR-based test response compressors for BIST. This framework is used to develop closed-form expressions for the aliasing probability of MISR for arbitrary test length. An error model, based on q-ary symmetric channel, is proposed using more realistic assumptions. Results are presented that provide the weight distributions for q-ary codes (q=2/sup m/, where the circuit under test has m outputs). These results are used to compute the aliasing probability for the MISR compression technique for arbitrary test lengths. This result is extended to compression using two different MISRs. It is shown that significant improvements can be obtained by using two signature analyzers instead of one. The weight distribution of a class of codes of arbitrary length is also given.

[1] P. H. Bardell, W. H. McAnney, and J. Savir,Built-In Test for VLSI: Pseudorandom Techniques. New York: Wiley, 1987.
[2] S. K. Gupta and D. K. Pradhan, "Combining data compression techniques," inProc. BIST Workshop, Charleston, SC, 1987.
[3] A. Ivanov and V. K. Agarwal, "An analysis of the probabilistic behavior of linear feedback signature registers,"IEEE Trans. Comput.-Aided Design, vol. 8, pp. 1074-1088, Oct. 1989.
[4] K. Iwasaki, "Analysis and proposal of signature circuits for LSI testing, "IEEE Trans. Comput.-Aided Design, vol. 7, no. 1, pp. 84-90, Jan 1988.
[5] T. Kasami and S. Lin, "The binary weight distribution of the extended (2m, 2m- 4) code of the Reed-Solomon code overGF(2m) with generator polynomial (x-α)(x-α2)(x-α3),"Linear Alg. Appl., vol. 98, pp. 291-307.
[6] M. G. Karpovsky and P. Nagvajara, "Optimal time and space compression of test responses for VLSI devices," inProc. Int. Test Conf., 1987, pp. 523-528.
[7] M. G. Karpovsky and P. Nagvajara, "Optimal robust compression of test responses,"IEEE Trans. Comput., vol. 37, Nov. 1988.
[8] F. J. MacWilliams and N. J. A. Sloane,Theory of Error-Correcting Codes. New York: North-Holland, 1978.
[9] P. C. Maxwell, "Comparative analysis of different implementations of multiple-input signature analyzers,"IEEE Trans. Comput., vol. 37, pp. 1411-1414, Nov. 1988.
[10] D. K. Pradhan and S. Gupta, "A new framework for designing and analyzing BIST techniques: Computation of exact aliasing probability,"IEEE Trans. Comput., submitted for publication.
[11] J. E. Smith, "Measures of the effectiveness of fault signature analysis,"IEEE Trans. Comput., vol. C-29, pp. 510-514, June 1980.
[12] T. W. Williams, W. Daehn, M. Gruetzner, and C. W. Starke, "Bounds and analysis of aliasing errors in linear-feedback shift-registers,"IEEE Trans. Comput-Aided Design, vol. CAD-7, pp. 75-83, Jan. 1988.
[13] T. W. Williams and A. Daehn, "Aliasing errors in multiple input signature analysis registers," inProc. BIST Workshop, Charleston, SC, 1989.

Index Terms:
multiple input signature analyzer; multiple-input-signature-register; aliasing probability expressions; arbitrary test lengths; algebraic codes; test response compressors; closed-form expressions; error model; q-ary symmetric channel; weight distributions; compression technique; logic analysers.
Citation:
D.K. Pradhan, S.K. Gupta, M.G. Karpovsky, "Aliasing Probability for Multiple Input Signature Analyzer," IEEE Transactions on Computers, vol. 39, no. 4, pp. 586-591, April 1990, doi:10.1109/12.54855
Usage of this product signifies your acceptance of the Terms of Use.