论文标题
经过修改的芦苇和EBCH代码的连续取消灭活解码
Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes
论文作者
论文摘要
提出了具有失活的连续取消（SC）解码器，作为对二元擦除通道上SC列表（SCL）解码的有效实现。提出的解码器在SC解码过程中删除并继续解码时，将一个虚拟变量分配给一个信息位。使用从解码的冷冻位收集的信息来解决灭活的位。该解码器利用Hadamard矩阵的结构，但可以通过将其表示为具有动态冷冻位的极性代码来应用于任何线性代码。 SCL解码器是使用密度演化部分表征的，以计算实现最大A-tostiori解码性能所需的平均灭活数量。提出的措施量化了性能与复杂性权衡，并为SCL解码中路径数量的动态提供了新的见解。该技术用于分析具有动态冷冻位的Reed-Muller（RM）代码。结果表明，这些修改后的RM代码靠近扩展的BCH代码。
A successive cancellation (SC) decoder with inactivations is proposed as an efficient implementation of SC list (SCL) decoding over the binary erasure channel. The proposed decoder assigns a dummy variable to an information bit whenever it is erased during SC decoding and continues with decoding. Inactivated bits are resolved using information gathered from decoding frozen bits. This decoder leverages the structure of the Hadamard matrix, but can be applied to any linear code by representing it as a polar code with dynamic frozen bits. SCL decoders are partially characterized using density evolution to compute the average number of inactivations required to achieve the maximum a-posteriori decoding performance. The proposed measure quantifies the performance vs. complexity trade-off and provides new insight into dynamics of the number of paths in SCL decoding. The technique is applied to analyze Reed-Muller (RM) codes with dynamic frozen bits. It is shown that these modified RM codes perform close to extended BCH codes.
