DocumentCode :
684071
Title :
A polynomial estimation algorithm for PN sequence based on reliability accumulation
Author :
Meiyue Yang ; Kaizhi Huang ; Wenyu Luo
Author_Institution :
Nat. Digital Switching Syst. Eng. & Technol. R&D Center, Zhengzhou, China
fYear :
2013
fDate :
23-25 March 2013
Firstpage :
1551
Lastpage :
1556
Abstract :
To solve the problems of current polynomial estimation algorithms for PN sequence, such as insufficient efficiency and error-tolerance, a novel algorithm based on reliability accumulation is proposed combining BM iterative algorithm based on binary sequence with improved Chase algorithm. Using sequence soft information and constructing the sequence and corresponding polynomial reliability outside BM algorithm, polynomial estimation is accomplished by reliability accumulation. Then, the reliability-accumulated polynomial scale is reduced according to the primitive polynomial characteristic on GF(2) field to improve the estimation accuracy. Simulation results show that the method is not restricted by the tap number of polynomial and has a good performance on estimating the 17th order polynomial under the situation of 15% BER.
Keywords :
iterative methods; polynomials; random sequences; BM iterative algorithm; Berlekamp-Massey algorithm; PN sequence; binary sequence; estimation accuracy; improved Chase algorithm; polynomial estimation algorithm; primitive polynomial characteristic; pseudorandom sequence; reliability accumulation; reliability-accumulated polynomial scale; sequence soft information; Algorithm design and analysis; Estimation; Fault tolerance; Fault tolerant systems; Generators; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Science and Technology (ICIST), 2013 International Conference on
Conference_Location :
Yangzhou
Print_ISBN :
978-1-4673-5137-9
Type :
conf
DOI :
10.1109/ICIST.2013.6747832
Filename :
6747832
Link To Document :
بازگشت