一种改进的线性分组码码长快速识别方法

An improved fast code length recognition method for linear block codes

现有的信道编码盲识别方法通常是基于矩阵化简来进行识别,其容错性能一般。提出一种改进的矩阵化简方法,该方法将截获到的数据横向放入分析矩阵,对化简后的矩阵求各列列重的比率,对所有列重比率求信息差熵,从而实现线性分组码码长的识别。仿真实验表明,该方法计算复杂度低,识别速度快,且在较高误码率的影响下,可以达到较好的识别效果。

Most existing channel coding blind recognition methods, based on the matrix simplification technique generally do not have a good tolerant performance. In this paper, an improved matrix simplification method is presented to address this issue. Firstly, it organizes the intercepted data sequence into an analytical matrix in a row by row manner, then counts the column weight ratios of the simplified matrix, the code length can be recognized with the calculation of differential infor- mation entropy of column weight ratios. Simulation results show that, the method has low computational complexity and fast recognition speed, it can achieve a better recognition performance even in a higher BER condition.