Multi-Factor Pruning for Recursive Projection-Aggregation Decoding of RM Codes
2022 IEEE Workshop on Signal Processing Systems (SiPS)(2022)
摘要
The recently introduced recursive projection aggregation (RPA) decoding method for Reed-Muller (RM) codes can achieve near-maximum likelihood (ML) decoding performance. However, its high computational complexity makes its implementation challenging for time- and resource-critical applications. In this work, we present a complexity reduction technique called multi-factor pruning that reduces the computational complexity of RPA significantly. Our simulation results show that the proposed pruning approach with appropriately selected factors can reduce the complexity of RPA by up to 92% for RM(8, 3) while keeping a comparable error-correcting performance.
更多查看译文
关键词
Reed-Muller codes,Recursive projection-aggregation (RPA) decoding,Projection pruning,Computational complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要