一种构造长度兼容极化码的平衡树方法
A Balanced Tree Approach to Construction of Length-Compatible Polar Codes
AI总结:
本文提出一种基于平衡二叉树的长度灵活极化码编码方案,通过长度自适应操作实现编解码,并提出SNR相关与无关的构造方法及PSC解码算法,性能与5G极化码相当且有效降低解码延迟。
摘要:
从树的角度出发,我们设计了一种长度灵活的编码方案。对于任意码长,我们首先构建一棵平衡二叉树(BBT),其中根节点代表传输的码字,叶节点代表活跃比特或冻结比特,父节点通过长度自适应的(U+V|V)操作与其子节点相关联。编码和基于连续消除(SC)的解码都可以在构建的编码树上实现。对于码的构造,我们提出了一种信噪比(SNR)相关的方法和两种SNR无关的方法,这些方法都评估叶节点的可靠性,然后选择最可靠的叶节点作为活跃节点。数值结果表明,我们提出的码可以具有与5G极化码相当的性能。为了减少解码延迟,我们提出了一种基于分区连续消除(PSC)的解码算法,该算法可以在通过修剪编码树获得的子树上实现。数值结果表明,基于PSC的解码可以实现与传统基于SC的解码相似的性能。
英文摘要:
From the perspective of tree, we design a length-flexible coding scheme. For an arbitrary code length, we first construct a balanced binary tree (BBT) where the root node represents a transmitted codeword, the leaf nodes represent either active bits or frozen bits, and a parent node is related to its child nodes by a length-adaptive (U+V|V) operation. Both the encoding and the successive cancellation (SC)-based decoding can be implemented over the constructed coding tree. For code construction, we propose a signal-to-noise ratio (SNR)-dependent method and two SNR-independent methods, all of which evaluate the reliabilities of leaf nodes and then select the most reliable leaf nodes as the active nodes. Numerical results demonstrate that our proposed codes can have comparable performance to the 5G polar codes. To reduce the decoding latency, we propose a partitioned successive cancellation (PSC)-based decoding algorithm, which can be implemented over a sub-tree obtained by pruning the coding tree. Numerical results show that the PSC-based decoding can achieve similar performance to the conventional SC-based decoding.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。