基于校验矩阵匹配的循环码参数盲识别算法

发布时间：2018-05-15 06:54

本文选题：非合作信号处理 + 循环码　；参考：《电子与信息学报》2017年04期

【摘要】：针对目前循环码参数盲识别存在容错率低、所需截获数据多的问题,该文提出一种基于校验矩阵匹配的循环码参数盲识别算法。首先求出所有码字长度n和生成多项式为x~n-1的因式对应的校验矩阵作为候选校验矩阵。然后利用截获的二进制码流构造截获矩阵,使其与候选校验矩阵相乘,判断在不同的码字长度和同步时刻是否存在校验矩阵,再结合存在校验矩阵对应的多项式来识别码字长度、同步时刻和生成多项式。仿真结果表明,所提算法对高码率(63,51)循环码识别,关于码字长度、同步时刻、生成多项式的正确识别率要求在80%时,系统允许的最大误码率分别可达4.6×10~(-2),4.6×10~(-2),1.6×10~(-2)。
[Abstract]:Aiming at the problem of low fault-tolerant rate and many intercepted data in blind identification of cyclic code parameters, this paper proposes a blind identification algorithm for cyclic code parameters based on the matching of check matrices. First, the check matrix corresponding to all codeword length n and generating polynomial x~n-1 is obtained as candidate check matrix. Then the intercepted matrix is constructed by using the intercepted binary code stream to multiply it with the candidate check matrix to determine whether there is a check matrix at different codeword length and synchronization time. The length of codeword, the synchronization time and the generating polynomial are identified by combining the polynomials corresponding to the checkout matrix. The simulation results show that the proposed algorithm is suitable for high bit rate code identification. For code length and synchronization time, the correct recognition rate of generating polynomial is 80. The maximum bit error rate allowed by the system can reach 4.6 脳 10 ~ (-10) ~ (-2) and 4.6 脳 10 ~ (10) ~ (-2) ~ (2) respectively.
【作者单位】：重庆邮电大学信号与信息处理重庆市重点实验室;
【基金】：国家自然科学基金(61671095,61371164,61275099) 信号与信息处理重庆市市级重点实验室建设项目(CSTC2009 CA2003) 重庆市教育委员会科研项目(KJ130524,KJ1600427,KJ1600429)~~
【分类号】：TN911.22

【相似文献】