论文标题
Reed-Muller代码的稀疏多折叠递归投影聚合
Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes
论文作者
论文摘要
Reed-Muller（RM）代码是最古老的代码系列之一。最近，提出了递归投影聚合（RPA）解码器，该解码器的性能接近了短长度RM代码的最大似然解码器。但是，其主要缺点之一是所需的大量计算。在本文中，我们设计了一种新的算法来降低计算预算，同时使性能接近RPA解码器的性能。所提出的方法由多个稀疏RPA组成，这些RPA仅通过在每个稀疏解码器中进行一系列投影而生成。最后，使用循环冗余检查（CRC）在输出代码字之间进行决定。仿真结果表明，我们提出的方法将RPA解码器的计算降低到$ 80 \％$，而性能损失微不足道。
Reed-Muller (RM) codes are one of the oldest families of codes. Recently, a recursive projection aggregation (RPA) decoder has been proposed, which achieves a performance that is close to the maximum likelihood decoder for short-length RM codes. One of its main drawbacks, however, is the large amount of computations needed. In this paper, we devise a new algorithm to lower the computational budget while keeping a performance close to that of the RPA decoder. The proposed approach consists of multiple sparse RPAs that are generated by performing only a selection of projections in each sparsified decoder. In the end, a cyclic redundancy check (CRC) is used to decide between output codewords. Simulation results show that our proposed approach reduces the RPA decoder's computations up to $80\%$ with negligible performance loss.
