线性分组码的盲识别技术研究  

Research on blind recognition technology for linear block code

作　　者：杨燕子 李迟生[1] 罗伟娟 

机构地区：[1]南昌大学信息工程学院,江西南昌330031

出　　处：《现代电子技术》2018年第3期23-26,共4页Modern Electronics Technique

基　　金：国家自然科学基金项目(61661030)~~

摘　　要：主要针对二进制线性分组码的盲识别问题进行研究,通过对现有算法的优缺点总结,以码重分析识别法为基础,提出一种联合码重分布、汉明距离分布以及深度分布特性的线性分组码识别算法。该算法先利用在识别过程中,当遍历到的码长和起始点是正确值时,编码序列和随机序列的码重相似度最低这一特性完成码长的识别和起始点的粗识别,再利用分组码的最小汉明距离不小于3这一特性对粗识别的起始点进行确定,在此基础上,利用(n,k)线性分组码的非零深度值恰好等于分组码信息位k这一特性求出信息位和码率,最后将深度值不为零的位置对应的码字相组合得到生成矩阵。大量实验表明,该算法能完成分组码的盲识别,与现有的部分算法相比,它的起始点识别环节的识别正确率和适应误码能力都有良好的提升,具有较好的工程实用性。The blind recognition of binary linear block code is studied.By summarizing the advantage and disadvantage of the current algorithm,on the basis of code weight analysis recognition method,a linear block code recognition algorithm combining code weight distribution,Hamming distance distribution and depth distribution characteristics is put forward.The lowest code weight similarity of coding sequence and random sequence is used to realize the code length recognition and rough recognition of initial point when the values of the traversed code length and initial point are correct.The characteristic that the minimun Hamming distance of the block code is bigger than 3 is used to dertermine the initial point of rough recognition.On this basis,the characteristic that the nonzero depth value of the(n,k)linear block code is equal to the block code information bit k is used to solve the information bit and code rate.The position that the depth value is not zero is combined with its corresponding codon to get the generation matrix.The results of a large number of experiments show that,in comparison with the available algorithms,the recognition accuracy and error code adaption ability of the proposed algorithm for the stage of initial point recognition are better improved,and the algorithm has high engineering practicability.

关 键 词：线性分组码 盲识别 码重分布 汉明距离 深度分布 起始点 

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