首页 | 本学科首页   官方微博 | 高级检索  
     

基于可信度累积的伪随机序列多项式估计算法
引用本文:陈 松,黄开枝,赵 华.基于可信度累积的伪随机序列多项式估计算法[J].通信学报,2012(9):125-131.
作者姓名:陈 松  黄开枝  赵 华
作者单位:国家数字交换系统工程技术研究中心
基金项目:国家自然科学基金资助项目(61171108)~~
摘    要:针对高阶误码条件下伪随机序列多项式估计算法效率不高、容错性能差等问题进行研究,提出一种基于可信度累积的多项式估计算法。该算法结合了基于二元序列迭代的BM算法和改进型Chase算法,利用序列软信息,在BM算法外部构建序列及多项式可信度集合,通过可信度累积实现估计。然后,利用本原多项式的二元域性质,通过缩小累积多项式规模,提高估计精度。仿真结果表明,该算法性能不受制于多项式抽头个数,在误码率为18%的条件下能够完成17阶m序列多项式估计。

关 键 词:m序列  本原多项式  可信度  BM算法  软信息

Polynomial estimation method for PN sequence based on reliability accumulation
CHEN Song,HUANG Kai-zhi,ZHAO Hua.Polynomial estimation method for PN sequence based on reliability accumulation[J].Journal on Communications,2012(9):125-131.
Authors:CHEN Song  HUANG Kai-zhi  ZHAO Hua
Affiliation:(National Digital Switching System Engineering & Technological Research Center,Zhengzhou 450002,China)
Abstract:The issues of insufficient efficiency and poor error-tolerance of current high-order polynomial estimation methods under error conditions were studied.By combining the iterative berlekamp-massey(BM) algorithm in GF(2) and the improved Chase algorithm,a novel algorithm based on reliability accumulation was proposed.The sequence soft in-formation was mapped to sequence reliability as the input information of BM algorithm,and the corresponding output re-liability of estimated polynomial was accumulated as the rule of correct polynomial.In order to improve the estimation precision,the candidate reliability-accumulated polynomial set were reduced by the characteristics of primitive polyno-mial in GF(2).The simulation results show that the proposed method is irrelevant with the tapped number of generator polynomial,and has a good estimation performance to estimate 17-order polynomials when the sequence BER is 18%.
Keywords:m sequence  primitive polynomial  reliability  BM algorithm  soft information
本文献已被 CNKI 等数据库收录!
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号