A New Method for Generator Polynomial Estimation of Period (ql-1)/n LFSR Sequence

Author

Wang, Fenghua ; Xu, Haiyuan ; Huang, ZhiTao

Author_Institution

Sch. of Electron. Sci. & Eng., Nat. Univ. of Defense Technol., Changsha

fYear

2007

fDate

21-25 Sept. 2007

Firstpage

1236

Lastpage

1239

Abstract

A finite field discrete Fourier transform is used for studying the properties of linear feedback shift register (LFSR) sequence with period (ql-1)/n, and the relation of sequence´s linear complexity and the nonzero-points in frequency-domain is given in this paper. Then a new algorithm is introduced to estimate the generator polynomial and initial state of m-sequence and gold-sequence. Based on the principle of FFT, a fast algorithm is also explored.

Keywords

binary sequences; fast Fourier transforms; feedback; frequency-domain analysis; polynomials; LFSR sequence; fast Fourier transform; finite field discrete Fourier transform; frequency-domain; generator polynomial estimation; linear complexity; linear feedback shift register sequence; Discrete Fourier transforms; Frequency domain analysis; Frequency estimation; Galois fields; Linear feedback shift registers; Polynomials; Software measurement; Software testing; Spread spectrum radar; State estimation;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-1311-9

Type

conf

DOI

10.1109/WICOM.2007.315

Filename

4340090