论文标题
平衡树的方法来构建长度兼容的极性代码
A Balanced Tree Approach to Construction of Length-Compatible Polar Codes
论文作者
论文摘要
从树的角度来看，我们设计了一种长度柔滑的编码方案。对于任意代码长度，我们首先构建平衡的二进制树（BBT），其中根节点代表传输的代码字，叶子节点代表活动位或冷冻位，而父节点则与其子节点通过长度自适应（U+V | V）操作与其子节点相关。编码和连续取消（SC）的解码都可以在构造的编码树上实现。对于代码构建，我们提出了一个信噪比（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.
