The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1995 vol.44)
pp: 1265-1274
ABSTRACT
<p><it>Abstract</it>—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 <it>n</it>. The error performance of an LFSR with any BCH polynomial of degree <it>m</it> for the test length 2<super><it>m</it>/2</super>− 2 is shown to be very good by deriving the formula for the weight distribution of the corresponding code.</p>
INDEX TERMS
Aliasing probability, BCH code, Hamming code, signature analysis, single input signature register, weight distribution.
CITATION
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, November 1995, doi:10.1109/12.475122
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool