基于公约式权重的截短线性分组码盲识别方法  

Blind recognition of short linear block code based on the weight of common polynomial

作　　者：沈利华[1] 章剑林[2] 

机构地区：[1]浙江工业大学之江学院,浙江绍兴312030 [2]杭州师范大学阿里巴巴商学院,浙江杭州311121

出　　处：《电信科学》2017年第6期114-120,共7页Telecommunications Science

摘　　要：针对通信信号侦察处理中的截短线性分组码的盲识别问题,提出了一种基于公约式权重最大化的识别方法。算法对侦收的码字序列进行不同长度的分段,计算分段码字与x^n+1的最大公约式并按公约式阶数进行滤除,通过高阶公约式的个数估计码字长度。同时根据公约式的出现概率定义公约式的权重,利用权重最大的公约式实现码字生成多项式的估计。仿真实验表明算法有效可行,并理论分析了算法的容错性和计算复杂度。和已有算法相比较,本文算法在相同的误码率条件下,具有更高的检测识别概率,且同时具备截短码字和非截短码字的识别能力。According to the problem of a short linear block code in communication signal processing, an algorithm based on the maximal weight of common polynomial was proposed. Firstly, the received code sequence was divided with different lengths. Then the common polynomial of code words and x^n＋ 1 was obtained and filtered. The code length was estimated by the number of common polynomials. The weight was defined according to the probability of polynomial, and the generator polynomial was recovered according to the maximal weight. The validity and the per- formances of the blind recognition method were illustrated by the computer simulation results. The correct recogni- tion rate of the algorithm is higher than that of the existing algorithms under the same bit error rate, and the method is applicable for both short codes and normal codes.

关 键 词：盲识别 线性分组码 欧几里得算法 公约式 权重 

分 类 号：TN911.22[电子电信—通信与信息系统]