基于分层最小和译码的RS-LDPC级联码改进算法  

Improved Algorithm for RS-LDPC Concatenated Codes Based on Layered Min-Sum Decoding

作　　者：李晓辉[1] 梁宇恒 石明利 LI Xiaohui;LIANG Yuheng;SHI Mingli(State Key Laboratory of Integrated Service Networks,Xidian University,Xi'an 710071,China)

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071

出　　处：《移动通信》2024年第5期32-36,共5页Mobile Communications

基　　金：国家自然科学基金“智能超表面绿色化设计技术研究”(62376204)。

摘　　要：RS-LDPC级联码能够有效提高数据传输的可靠性和系统的容错能力,在5G通信等领域中得到了广泛的应用,且在6G中具有很好的应用前景。但是RS-LDPC级联码与单码相比具有计算复杂度高、不易于在硬件上实现的不足,因此提出一种基于分层最小和的RS-LDPC级联码改进译码算法,将LDPC码的校验矩阵分解成多个子矩阵,在不同子矩阵层次上并行计算。此外,还引入了新的关于校验节点信息更新的简化函数,旨在保证译码性能的同时降低计算复杂度,达到易于硬件实现的目的。结果表明改进型分层最小和算法复杂度大大降低,且在性能上优于传统BP译码0.25 dB左右。RS-LDPC concatenated codes are instrumental in enhancing the reliability and fault tolerance of data transmissions,garnering extensive application in fields such as 5G communications and showing promising prospects for 6G technologies.However,these concatenated codes pose challenges due to their higher computational complexity compared to single codes,making them less feasible for hardware implementation.To address this issue,this paper introduces an improved decoding algorithm for RS-LDPC concatenated codes based on a layered min-sum approach.The algorithm decomposes the LDPC code's parity-check matrix into multiple submatrices,allowing parallel computations across different matrix layers.Additionally,a novel simplified function for updating check node information is proposed to maintain decoding performance while reducing computational complexity,thus facilitating easier hardware implementation.Results indicate that the enhanced layered min-sum algorithm significantly reduces complexity and achieves a performance improvement of approximately 0.25 dB over traditional belief propagation decoding.

关 键 词：LDPC码 RS码 级联码 最小和译码 分层译码 

分 类 号：TN929.5[电子电信—通信与信息系统]