基于矩阵分析的线性分组码盲识别  

Blind recognition of linear block codes based on matrix analysis

作　　者：刘杰[1] 张立民[1] 占超[2] 

机构地区：[1]海军航空工程学院信息融合研究所 [2]中国人民解放军92515部队

出　　处：《系统工程与电子技术》2017年第2期404-409,共6页Systems Engineering and Electronics

基　　金：国家自然科学基金重大研究计划(91538201);泰山学者工程专项经费(st201511020)资助课题

摘　　要：针对现有的矩阵分析法对线性分组码进行盲识别时,容错性能较差的问题,提出了一种改进的方法。首先利用截获的码字数据建立分析矩阵并进行高斯消元,然后计算各列列重的归一化值,按照判决门限找出分析矩阵中的线性相关列,并以此建立统计量,最后通过统计量极大值的分布规律完成码长的识别。识别出码长后,通过移位处理及随机交换分析矩阵的行进行多次平均,实现高误码率下码字起点的识别。仿真结果表明,该方法与传统矩阵分析法相比,计算量基本相当,但容错性能有很大提升,能在较高误码率下有效实现线性分组码的盲识别。Since the existing matrix analysis method has a poor performance when solving the blind recognition problems of linear block codes, an improved method is proposed. Firstly, Gauss elimination algorithm is applied to the interception matrix and the normalized weight of each column is calculated, then a statistical esti- mation is used to find correlation columns in the matrix, based on which a statistical index is setted up to get the code length according to the distribution of maximum values. To achieve successful recognition of code start bit under high bit error rate （BER）, shift operation with many times of average is adopted after code length identifi- cation. Simulation results show that the proposed method has a better fault-tolerant performance when comparing to the traditional matrix analysis method, while the computational complexity is approximately the same, thus it can be more effective for the blind recognition problem.

关 键 词：线性分组码 矩阵分析法 高斯消元 统计判决 

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