Generator Matrix Based Puncturing in Polar Coding
Generator Matrix Based Puncturing in Polar Coding
复制标题
DOI：
10.1109/icspcs47537.2019.9008761
复制
发表时间：
2019-12
期刊：
影响因子：
--
通讯作者：
Takumi Kandatsu;T. Saba
中科院分区：
文献类型：
--
作者：
Takumi Kandatsu;T. Saba
极性编码是由Arikan提出的一种低复杂度、高纠错能力的信道编码方案。在极坐标编码中，编码器可以输出的码字长度为$N=2^{N}$，其中N为整数。码字长度大于2n可以通过穿刺来实现。一般来说，极化码的特点是由于信道极化的影响，编码器的每个输入位的译码误码率不同。因此，提出了一种方法，其中被刺穿的钻头仅由冻结的钻头组成。然而，为了实现这一点，可能会将冻结的位分配到不易受解码错误影响的位位置。本文提出了一种基于编码器生成矩阵的穿刺方法。该方法从输入比特数较少的比特中选择待穿刺的比特，并将冻结比特分配到相应的输入比特位置。利用该方法可以抑制极性编码中使用穿刺时纠错能力的下降。通过计算机仿真，我们证明了采用我们的穿刺方法的极化编码优于基于擦除概率选择穿刺位和冻结位位置的极化编码。
Polar coding proposed by Arikan has attracted attention as a channel coding scheme with low complexity and high error correction capability. In polar coding, the codeword length that can be output by the encoder is $N=2^{n}$, where n is an integer. Codeword lengths other than 2n can be realized by puncturing. In general, polar codes have the characteristics that the decoding error rate differs for each input bit position of the encoder due to the effect of the channel polarization. Therefore, a method has been proposed in which bits to be punctured are composed of only frozen bits. However, to achieve this, frozen bits might be allocated to bit positions which are insusceptible to decoding errors. In this paper, we propose a puncturing method based on the generator matrix of the encoder. In the proposed method, bits to be punctured are selected from those composed of a smaller number of input bits, and we allocate frozen bits to the corresponding input bit positions. By using the proposed method, it is possible to suppress the degradation of the error correction capability when puncturing is used in polar coding. Through computer simulation, we show that the polar coding with our puncturing method outperforms the polar coding with the method in which positions of punctured bits and frozen bits are selected based on the erasure probabilities.