摘要
针对RS(Reed-Solomon)码识别算法存在的计算量大和漏警概率高的问题,提出了一种基于快速码根检验的RS码综合识别算法。首先,在二元域中求解校验关系,利用快速码根检验算法依次遍历参数;然后,利用组合码根的分布特性,对级数、本原多项式以及纠错能力进行联合判定;最后,赋予长短码不同的置信权重,将通过判定的待定参数进行综合衡量,选择最优参数,并计算生成多项式。所提算法不需要信噪比等先验信息,具有较好的适应性。仿真结果表明,所提算法在较低复杂度下可以有效地降低漏警概率,与常规的硬判决算法相比,所提算法性能较好,可以较快地完成编码参数识别。
In order to solve the problem of high computation and high missed alarm probability of RS(Reed-Solomon)codes for recognition,comprehensive recognition algorithm of RS codes based on fast code root trial was proposed.Firstly,the check relationship was solved in binary equivalently and fast code root trial was used to check parameters in sequence.Secondly,according to distribution characteristics of the combined code roots,m-level primitive polynomial field and error correction ability was associatively determined.Finally,the short codes and long codes were given differ-ent confidence weights and the determined parameters were comprehensively analyzed.The optimal parameter was se-lected and the generate polynomial was calculated.The proposed algorithm did not need prior information such as sig-nal-to-noise ratio(SNR),and had good adaptability.The simulation results show that the proposed algorithm can effec-tively reduce the missed alarm probability under the condition of low complexity.Compared with the conventional hard decision algorithm,the performance of the proposed algorithm is improved,and the parameter recognition of RS codes can be completed quickly.
作者
张晓林
李修桥
孙溶辰
ZHANG Xiaolin;LI Xiuqiao;SUN Rongchen(College of Information and Communication Engineering,Harbin Engineering University,Harbin 150001,China)
出处
《通信学报》
EI
CSCD
北大核心
2022年第11期117-126,共10页
Journal on Communications
基金
国家自然科学基金资助项目(No.62001139)。
关键词
RS码
快速码根检验
置信权重
综合识别
漏警概率
盲识别
RS code
fast code root trial
confidence weight
comprehensive recognition
missed alarm probability
blind recognition
