标题： 长极化码与在复杂度受限解码下的LDPC码 显示英文标题

标题： Long Polar vs. LDPC Codes under Complexity-Constrained Decoding

摘要： 工业界和学术界的普遍观点是，极化码在短码长情况下具有竞争力，但随着码块长度的增加，其性能已无法跟上低密度奇偶校验（LDPC）码。 这种观点通常基于假设LDPC码可以通过大量置信传播（BP）迭代进行解码。 然而，在实际应用中，由于时延和复杂度的限制，迭代次数可能相当有限。 在本文中，我们表明，在类似的固定点对数似然比（LLR）操作数量下，采用逐次取消（SC）解码的长极化码优于其LDPC对应码。 特别是，极化码的简化逐次取消（SSC）解码在复杂度扩展方面优于$N \log{N}$，并且所需的运算次数少于具有相同参数的LDPC码的一个BP迭代。 显示英文摘要

摘要： The prevailing opinion in industry and academia is that polar codes are competitive for short code lengths, but can no longer keep up with low-density parity-check (LDPC) codes as block length increases. This view is typically based on the assumption that LDPC codes can be decoded with a large number of belief propagation (BP) iterations. However, in practice, the number of iterations may be rather limited due to latency and complexity constraints. In this paper, we show that for a similar number of fixed-point log-likelihood ratio (LLR) operations, long polar codes under successive cancellation (SC) decoding outperform their LDPC counterparts. In particular, simplified successive cancellation (SSC) decoding of polar codes exhibits a better complexity scaling than $N \log{N}$ and requires fewer operations than a single BP iteration of an LDPC code with the same parameters.