论文标题
ABS+极性代码：利用相邻位的更多线性变换
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits
论文作者
论文摘要
最近提出了ABS极性代码，以通过在每层变换后交换一对相邻的位来加快极化。在本文中，我们观察到，在每对相邻的位置都引起了偶数变换层后，将Arikan Transform $（u_i，u_ {u_i，u_i {u_i，u_i，u_i，u_i，u_i+1}）\ mapsto（u_ {i}+u_ {i}+u_ {i+1}，u_ {i+1}）$在相邻的位置上都引起了均匀的层次化。 鉴于此，我们提出了ABS+极地代码，除了在ABS极性代码中交换变换外，还包含了Arikan变换。为了有效地构建和解码ABS+极性代码，我们通过不同的极性变换层获得了相邻位的关节分布之间的新递归关系。在广泛的参数上的仿真结果表明，ABS+极性代码的CRC辅助SCL解码器在ABS极性代码对ABS极性代码上的改进，同时保持相同的解码时间。此外，当ABS+极地代码都使用CRC AIDED SCL解码器列表尺寸$ 32 $时，将标准极性代码对标准极性代码改进。本文中所有算法的实现可在https://github.com/plumjelly/abs-polar上获得
ABS polar codes were recently proposed to speed up polarization by swapping certain pairs of adjacent bits after each layer of polar transform. In this paper, we observe that applying the Arikan transform $(U_i, U_{i+1}) \mapsto (U_{i}+U_{i+1}, U_{i+1})$ on certain pairs of adjacent bits after each polar transform layer leads to even faster polarization. In light of this, we propose ABS+ polar codes which incorporate the Arikan transform in addition to the swapping transform in ABS polar codes. In order to efficiently construct and decode ABS+ polar codes, we derive a new recursive relation between the joint distributions of adjacent bits through different layers of polar transforms. Simulation results over a wide range of parameters show that the CRC-aided SCL decoder of ABS+ polar codes improves upon that of ABS polar codes by 0.1dB--0.25dB while maintaining the same decoding time. Moreover, ABS+ polar codes improve upon standard polar codes by 0.2dB--0.45dB when they both use the CRC-aided SCL decoder with list size $32$. The implementations of all the algorithms in this paper are available at https://github.com/PlumJelly/ABS-Polar
