This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Maximum Value of Aliasing Probabilities for Single Input Signature Registers
November 1995 (vol. 44 no. 11)
pp. 1265-1274

Abstract—The aliasing error performance of a signature register is measured by the maximum values of the aliasing error probabilities for certain ranges of the bit-error rate (and those of the test length). Based on these measures, we evaluate the performances of all the single input signature registers whose feedback polynomials are primitive polynomials of degree 16 and generator polynomials of the double-error-correcting BCH codes of the same degree. When the degree of the feedback polynomial is large, say 32, it is computationally hard to obtain the exact aliasing probability. But we observe that the numbers of codewords with large weights in the corresponding code dominate the maximum value of the aliasing probabilities. By computing the numbers of codewords of large weights, we find primitive polynomials of degree 32 whose maximum value of the aliasing probabilities is very large for some test lengths n. The error performance of an LFSR with any BCH polynomial of degree m for the test length 2m/2− 2 is shown to be very good by deriving the formula for the weight distribution of the corresponding code.

[1] J.E. Smith,“Measures of the effectiveness of fault signature analysis,” IEEE Trans. Computers, vol. 29, pp. 510-514, June 1980.
[2] T.W. Williams,W. Daech,M. Gruetzer,, and C.W. Starke,“Bounds and analysis of aliasing errors in linear-feedback shift-registers,” IEEE Trans. Computer Aided Design, vol. 7, pp. 75-83, Jan. 1988.
[3] A. Ivanov and V.K. Agarwal,“An iterative technique for calculating aliasing probability of linear feedback signature registers,” 18th Int’l Symp. Fault Tolerant Computing, pp. 70-75, June 1988.
[4] K. Iwasaki and F. Arakawa,"An Analysis of Aliasing Probability of Multiple Input Signature Registers in the Case of 2m-ary Symmetric Channel," IEEE Trans. Computer-Aided Design/ICAS, vol. 9, no. 4, pp. 427-438, Apr. 1990.
[5] D.K. Pradhan, S. Gupta, and M. Karpovsky, "Aliasing Probabilities for Multiple Input Signature Analyzer," IEEE Trans. Computers, vol. 39, no. 4, pp. 586-591, Apr. 1990.
[6] K. Iwasaki and N. Yamaguchi, "Design of Signature Circuits Based on Weight Distribution of Error-Correcting Codes," Proc. ITC, pp. 779-785, Sept. 1990.
[7] N. Saxena,P. Franco,, and E. McCluskey,“Refined bounds on signature analysis aliasing for random testing,” 1991 Int’l Test Conf., pp. 818-827, Oct. 1991.
[8] P.H. Bardell and M.J. Lapointe, "Production Experience with Built-In Self-Test in the IBM ES/9000 System," Proc. Int'l Test Conf., pp. 28-36, Oct. 1991.
[9] S. Lin and D. J. Costello,Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
[10] S. Feng,T. Fujiwara,T. Kasami, and K. Iwasaki,“On the aliasing probability for single input signature registers,” 14th Symp. Information Theory and Its Applications, pp. 65-68,Ibusuki, Japan, Dec. 1991.
[11] T. Fujiwara,T. Kasami, and S. Lin,“Error detecting capabilities of shortened Hamming codes adopted for error detection in IEEE Standard 802.3,” IEEE Trans. Commununications, vol. 37, pp. 986-989, Sept. 1989.
[12] S. Feng,T. Fujiwara,T. Kasami,, and K. Iwasaki,“On the number of codewords with large weights and the maximum value of aliasing probability for single input signature registers,” Proc. 15th Symp. Information Theory and Its Applications, pp. 365-368,Minakami, Japan, Sept. 1992.
[13] S. Feng,T. Fujiwara,T. Kasami, and K. Iwasaki,"On the Maximum Value of Aliasing Probabilities for Single Input Signature Registers," IEEE VLSI Test Symp., pp. 267-274, Apr. 1993.

Index Terms:
Aliasing probability, BCH code, Hamming code, signature analysis, single input signature register, weight distribution.
Citation:
Toru Fujiwara, Shou-ping Feng, Tadao Kasami, Kazuhiko Iwasaki, "On the Maximum Value of Aliasing Probabilities for Single Input Signature Registers," IEEE Transactions on Computers, vol. 44, no. 11, pp. 1265-1274, Nov. 1995, doi:10.1109/12.475122
Usage of this product signifies your acceptance of the Terms of Use.