移动通信2024，Vol.48Issue(5)：32-36,5.DOI:10.3969/j.issn.1006-1010.20240321-0001
基于分层最小和译码的RS-LDPC级联码改进算法
Improved Algorithm for RS-LDPC Concatenated Codes Based on Layered Min-Sum Decoding
摘要
Abstract
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码/级联码/最小和译码/分层译码Key words
LDPC code/RS code/concatenated code/min-sum decoding/layered decoding分类
电子信息工程引用本文复制引用
李晓辉,梁宇恒,石明利..基于分层最小和译码的RS-LDPC级联码改进算法[J].移动通信,2024,48(5):32-36,5.基金项目
国家自然科学基金"智能超表面绿色化设计技术研究"(62376204) （62376204）
