Telecommunications Science ›› 2018, Vol. 34 ›› Issue (2): 58-64.doi: 10.11959/j.issn.1000-0801.2018025

• research and development • Previous Articles     Next Articles

Generator polynomial estimation of LFSR sequence based on GFFT

Lihua SHEN   

  1. Zhijiang College of Zhejiang University of Technology,Shaoxing 312030,China
  • Revised:2017-12-14 Online:2018-02-01 Published:2018-02-13

Abstract:

The problem addressed here is generator polynomial estimation of linear feedback shift register (LFSR) sequence.An algorithm based on the Galois field Fourier transform (GFFT) was proposed.The relationship between non-zero points in GFFT of LFSR sequence and zero points in generator polynomial of LFSR sequence was illustrated firstly.Then the generator polynomial of LFSR sequence was fast estimated based on that property,and the improved method in noisy environment was proposed at last.Validity of the algorithm is verified by the simulation results,and the computational load is illustrated.The computational efficiency of the proposed algorithm is higher than that of the existing algorithms.

Key words: signal processing, linear feedback shift register, Galois field Fourier transform, generator polynomial

CLC Number: 

No Suggested Reading articles found!