This Article 
 Bibliographic References 
 Add to: 
A Note on Aliasing Probability for Multiple Input Signature Analyzer
September 1993 (vol. 42 no. 9)
pp. 1152

Recently D.K. Pradhan, S.K. Gupta and M.G. Karpovsky (1990) affirmed that the codes generated by (x- alpha )(x- beta ) were not Reed-Solomon, where alpha and beta were roots of the distinct primitive polynomials of degree m. It was assumed that beta = alpha /sup 8/, where s-1 and 2/sup m/-1 were mutually prime. The authors show that under the above assumption the respective codes are Reed-Solomon codes.

[1] D. K. Pradhan, S. K. Gupta, and M. G. Karpovsky, "Aliasing probability for multiple input signature analyzer,"IEEE Trans. Comput., vol. 39, no. 4, pp. 586-591, Apr. 1990.
[2] W. W. Peterson and E. J. Weldon, Jr.,Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
[3] K. Iwasaki and F. Arakawa, "An analysis of the aliasing probability of multiple input signature registers in the case of a 2m-ary symmetric channel,"IEEE Trans. Comput.-Aided Design, vol. 9, no. 4, pp. 427-438, Apr. 1990.
[4] D. K. Pradhan and S. K. Gupta, "A new framework for designing and analyzing BIST techniques and zero aliasing compression,"IEEE Trans. Comput., vol. 40, no. 6, pp. 743-763, June 1991.

Index Terms:
aliasing probability; multiple input signature analyzer; distinct primitive polynomials; Reed-Solomon codes; logic analysers; logic testing; Reed-Solomon codes.
M. Morii, K. Iwasaki, "A Note on Aliasing Probability for Multiple Input Signature Analyzer," IEEE Transactions on Computers, vol. 42, no. 9, pp. 1152, Sept. 1993, doi:10.1109/12.241605
Usage of this product signifies your acceptance of the Terms of Use.