论文标题
相邻折叠的极性代码：一种新的代码构建，以加快极化
Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization
论文作者
论文摘要
代码长度$ n = 2^m $的极性代码的构建涉及$ m $层的极性变换。在本文中，我们观察到每一层极性变换后，一个人可以交换某些相邻的位以加速极化过程。更确切地说，如果上一块比连续的解码器下的下一点更可靠，那么切换这两个相邻位的解码顺序将使可靠的位更可靠，而且嘈杂的位更加嘈杂。 基于此观察结果，我们提出了一个新的代码系列，称为相邻位置（ABS）极地代码。在ABS极性代码的构建中，我们在每个极性变换层之后添加了一个置换层。为了选择在置换层中交换哪一对相邻位，我们依靠一个新的极性变换，将两个独立的频道与$ 4 $ - ARY输入相结合。这种新的极性变换使我们能够通过极性变换的不同层跟踪每对相邻位的演变，并且在ABS极性代码的连续取消列表（SCL）解码器中也起着至关重要的作用。广泛的仿真结果表明，当我们使用CRC辅助的SCL解码器时，ABS极性代码始终超过0.15dB-0.3db的标准极性代码，这两个代码列表尺寸$ 32 $。本文中所有算法的实现可在https://github.com/plumjelly/abs-polar上获得
The construction of polar codes with code length $n=2^m$ involves $m$ layers of polar transforms. In this paper, we observe that after each layer of polar transforms, one can swap certain pairs of adjacent bits to accelerate the polarization process. More precisely, if the previous bit is more reliable than its next bit under the successive decoder, then switching the decoding order of these two adjacent bits will make the reliable bit even more reliable and the noisy bit even noisier. Based on this observation, we propose a new family of codes called the Adjacent-Bits-Swapped (ABS) polar codes. We add a permutation layer after each polar transform layer in the construction of the ABS polar codes. In order to choose which pairs of adjacent bits to swap in the permutation layers, we rely on a new polar transform that combines two independent channels with $4$-ary inputs. This new polar transform allows us to track the evolution of every pair of adjacent bits through different layers of polar transforms, and it also plays an essential role in the Successive Cancellation List (SCL) decoder for the ABS polar codes. Extensive simulation results show that ABS polar codes consistently outperform standard polar codes by 0.15dB--0.3dB when we use CRC-aided SCL decoder with list size $32$ for both codes. The implementations of all the algorithms in this paper are available at https://github.com/PlumJelly/ABS-Polar
