Blind Identification of the Primitive Polynomial of m-Sequence with Error Using High-order Statistic
Chunwu Liu · Acta Armamentarii · 2010
The blind identification of the primitive polynomial of m-sequence with error i s studied. A novel algorithm which identifies the primitive polynomial of m-seq uence using high-order statistic concept is proposed. The new algorithm finds the multi ple polynomials of the primitive polynomial by the peak value of the high-order corr elation function, and then deduces the primitive polynomial by calculating the g reatest common divisor of these multiple polynomials. With the statistical metho d, the relation and selection of those parameters of the algorithm are further s tudied, which can provide a better guidance for practical application. Compared with the Walsh-Hadamard transformation method which is usually used in practice, the n ew algorithm is not subject to the tapped number of the primitive polynomial, and has h igh error tolerance. The deficit of the new algorithm is that the computing comp lexity is higher than the Walsh-Hadamard transformation.