基于码重分布信息熵的线性分组码盲识别方法  

Linear-Block-Code Blind Recognition based on Code-Weight-Distribution Information Entropy

作　　者：陈金杰[1] 杨俊安 CHEN Jin-jie;YANG Jun-an(Unit 91245 of PLA,Huludao Liaoning 125000,China;National University of Defense Technology,Hefei Anhui 230037,China)

机构地区：[1]91245部队 [2]国防科学技术大学

出　　处：《通信技术》2018年第7期1553-1560,共8页Communications Technology

摘　　要：针对线性分组码的一些盲识别方法应用于数据盲识别分析时存在运算较为复杂、容错性一般等问题,结合线性分组码码重分布特征与信息熵的概念和性质,提出了一种基于码重分布信息熵的线性分组码编码参数盲识别方法。在不同的先验知识条件下,该识别方法根据码重分布的非等概性,通过计算码重分布的信息熵,正确地识别出码长或码字起始点,进而可以求解线性分组码的其他编码参数完成识别。该识别方法不仅减少了计算的复杂度,而且提高了容错性能。仿真实验结果表明,识别方法具有有效性。In order to overcome the weakness of complex computation and lower error-tolerance of existing blind recognition methods in linear block codes,a blind recognition method based on information entropy of code weight distribution is proposed.This method,by combining the character of weight distribution with conception and property of information entropy,using the non-equiprobable weight distribution,and computing the information entropy of weight distribution in different priori conditions,can correctly recognize the code length or code start-bit.Then other coding parameters can be computed and the recognition process be done.Simulation results indicate that this method could effectively reduce the computation complexity and promote the error-tolerance performance,and thus is feasible and reliable.

关 键 词：线性分组码 盲识别 生成矩阵 汉明重量 信息熵 

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