基于软判决下的不删余极化码参数识别  

Recognition of non-drilled polar codes based on soft decision

作　　者：吴昭军 钟兆根 张立民 但波 WU Zhaojun;ZHONG Zhaogen;ZHANG Limin;DAN Bo(The School of Aviation Support,Naval Aviation University,Yantai 264001,China;The School of Basis of Aviation Science,Naval Aviation University,Yantai 264001,China;The School of Coastal Defense,Naval Aviation University,Yantai 264001,China)

机构地区：[1]海军航空大学航空作战勤务学院,山东烟台264001 [2]海军航空大学航空基础学院,山东烟台264001 [3]海军航空大学岸防兵学院,山东烟台264001

出　　处：《通信学报》2020年第12期60-71,共12页Journal on Communications

基　　金：国家自然科学基金资助项目(No.91538201);泰山学者工程专项经费基金资助项目(No.ts201511020);信息系统安全技术重点实验室基金资助项目(No.6142111190404)。

摘　　要：针对极化码盲识别问题,首先证明了能表征实际极化码码长、码率关系的定理1和定理2及区别冻结比特位和信息比特位的定理3。基于这3个定理,通过遍历可能的码长值,构建了码字矩阵和克罗内克矩阵,然后遍历信息比特位,检测码字空间与疑似对偶空间的校验关系。为了检测校验关系,引入了对数似然比概念,基于其统计特性和最优准则,估计出该遍历码长下的码率及信息比特位置,最终完成参数的识别。仿真结果表明,3个定理的结论与仿真结果一致,且算法具有较强的容错性,在信噪比为6.5 dB、码长为1024条件下,参数识别率能够达到98%以上。In order to solve the problem of the blind recognition of polar codes,the theorem 1 and theorem 2 were proved firstly,which reflects the relationship between length and rate of actual polar codes,and then theorem 3 which could distinguish frozen bit and information bit positions was also proved.Based on these three theorems,the codewords matrixes and Kronecker matrixes were constructed by traversing the possible code length values.Then the information bits were traversed to detect the check relationship between the codewords and the suspected dual space.In order to detect the check relationship,log likelihood ratio was introduced,based on its characteristics and optimal criteria,the code rate and information bit positions were estimated.The simulation results show that the conclusions of the three theorems are consistent with the results.At the same time,the proposed algorithm has a strong error tolerance.Under 6.5 dB and code length of 1024,the rate of recognition can reach more than 98%.

关 键 词：极化码 软判决 码长 信息比特位 冻结比特位 识别 

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