基于零空间矩阵匹配的极化码参数盲识别算法

针对目前极化码参数盲识别问题,该文提出一种基于零空间矩阵匹配的极化码参数盲识别算法。由于极化码生成矩阵的构造是确定的,其生成矩阵都是满秩的方阵,该算法首先利用极化码编码中信道可靠性估计删除生成矩阵中冻结位码字对应的行,再找出该矩阵在二元域中的零空间矩阵作为该码长下的监督矩阵,用不同长度码长的监督矩阵与待检测的码字迭代相乘,根据乘积结果中“1”的比例来判断码字的码长、信息位个数和位置分布。仿真结果表明,针对200组码长64,信息位个数30的极化码,在最大误比特率不超过0.06时,识别率能保持在80%以上。

Blind Identification Algorithm of Polarization Code Parameters Based on Null Space Matrix Matching

To solve the problem of blind identification of polar codes’ parameters, a blind recognition algorithm of polar codes based on zero space matrix matching is proposed. The construction of polar codes’ generation matrix is certain, and all the generation matrices are full rank square matrices, first the rows corresponding to the frozen bit codes are deleted by using the channel reliability estimation in the polar code encoding. Then, the null space matrix of this matrix in the binary field is found out as the supervision matrix under the code length. The code word is iteratively multipied by the supervision matrix of different code lengths, according to the proportion of "1" in the product result, the code length, number and position distribution of information bits of the code word are determined. The simulation results show that for the 200 groups of polar code with 64-code-length and 30-information-bits, the recognition rate can be kept above 80% when the maximum bit error rate is less than 0.06.