Generator polynomial estimation of LFSR sequence based on GFFT

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 LF...

Full description

Saved in:
Bibliographic Details
Main Author: Lihua SHEN
Format: Article
Language:zho
Published: Beijing Xintong Media Co., Ltd 2018-02-01
Series:Dianxin kexue
Subjects:
Online Access:http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2018025/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1841530293711798272
author Lihua SHEN
author_facet Lihua SHEN
author_sort Lihua SHEN
collection DOAJ
description 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.
format Article
id doaj-art-6e1413b19c9d40d0ae3308fafae9a26b
institution Kabale University
issn 1000-0801
language zho
publishDate 2018-02-01
publisher Beijing Xintong Media Co., Ltd
record_format Article
series Dianxin kexue
spelling doaj-art-6e1413b19c9d40d0ae3308fafae9a26b2025-01-15T03:05:12ZzhoBeijing Xintong Media Co., LtdDianxin kexue1000-08012018-02-0134586459596965Generator polynomial estimation of LFSR sequence based on GFFTLihua SHENThe 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.http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2018025/signal processinglinear feedback shift registerGalois field Fourier transformgenerator polynomial
spellingShingle Lihua SHEN
Generator polynomial estimation of LFSR sequence based on GFFT
Dianxin kexue
signal processing
linear feedback shift register
Galois field Fourier transform
generator polynomial
title Generator polynomial estimation of LFSR sequence based on GFFT
title_full Generator polynomial estimation of LFSR sequence based on GFFT
title_fullStr Generator polynomial estimation of LFSR sequence based on GFFT
title_full_unstemmed Generator polynomial estimation of LFSR sequence based on GFFT
title_short Generator polynomial estimation of LFSR sequence based on GFFT
title_sort generator polynomial estimation of lfsr sequence based on gfft
topic signal processing
linear feedback shift register
Galois field Fourier transform
generator polynomial
url http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2018025/
work_keys_str_mv AT lihuashen generatorpolynomialestimationoflfsrsequencebasedongfft