论文标题
一种极地子代码方法的信念传播列表解码
A Polar Subcode Approach to Belief Propagation List Decoding
论文作者
论文摘要
排列解码引起了最近的兴趣，因为它可以以平行方式利用代码的对称性。此外，已经表明，通过将列表的极性代码视为极性亚代码，可以增加排列解码中的可用排列集。我们将此想法扩展到预先转化的极性代码，例如环状冗余检查（CRC）辅助码，由于它们缺乏自动态，以前无法使用置换来解码。使用基于信念的传播（BP）的子模型，我们展示了与CRC ADED SCL（CA-SCL）解码相近的性能。所提出的算法的表现优于先前最佳的迭代CRC信念传播列表（CA-BPL）解码器的误解性能和解码延迟。
Permutation decoding gained recent interest as it can exploit the symmetries of a code in a parallel fashion. Moreover, it has been shown that by viewing permuted polar codes as polar subcodes, the set of usable permutations in permutation decoding can be increased. We extend this idea to pre-transformed polar codes, such as cyclic redundancy check (CRC)-aided polar codes, which previously could not be decoded using permutations due to their lack of automorphisms. Using belief propagation (BP)-based subdecoders, we showcase a performance close to CRC-aided SCL (CA-SCL) decoding. The proposed algorithm outperforms the previously best performing iterative CRC-aided belief propagation list (CA-BPL) decoder both in error-rate performance and decoding latency.
