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

针对目前循环码参数盲识别存在容错率低、所需截获数据多的问题，该文提出一种基于校验矩阵匹配的循环码参数盲识别算法。首先求出所有码字长度n和生成多项式为xn-1的因式对应的校验矩阵作为候选校验矩阵。然后利用截获的二进制码流构造截获矩阵，使其与候选校验矩阵相乘，判断在不同的码字长度和同步时刻是否存在校验矩阵，再结合存在校验矩阵对应的多项式来识别码字长度、同步时刻和生成多项式。仿真结果表明，所提算法对高码率(63,51)循环码识别，关于码字长度、同步时刻、生成多项式的正确识别率要求在80%时，系统允许的最大误码率分别可达4.610-2,4.610-2,1.610-2。

Blind Recognition of Cyclic Code Based on Check Matrix Match Algorithm

Blind recognition of cyclic code based on check matrix match algorithm is proposed in order to solve the blind identification issue of low fault tolerance rate and large intercepted data. First, the corresponding check matrix of all of the code lengthn and the factor ofxn-1 is regarded as candidate check matrix. Second, a matrix is filled with intercepted bit stream received from binary symmetric channel. It is multipled with candidate check matrix, and whether check matrix in code length and synchronization exists or not is determined, and then code length, synchronization and generate polynomial can be estimated. The simulation results show that if the proposed method is applied to (63, 51) cyclic code, when the probability of correct recognition of code length, synchronization and generate polynomial requires 80%, the maximum bit error rate is4.610-2, 4.610-2 and1.610-2 respectively.