A Low-Complexity Min-Sum Decoding Algorithm for LDPC Codes | |
Li H1,2; Guo J2; Guo C2; Wang D2 | |
2018-05 | |
会议日期 | 2017.10.27-2017.10.30 |
会议地点 | 中国四川 |
关键词 | Ldpc Decoding Low-complexity Min-sum Simplified Check Nodes |
英文摘要 | This paper proposes a low-complexity LDPC decoding algorithm with simplified check nodes updating. The proposed algorithm simplifies the result of the secondminimum in check nodes based on the first-minimum computation instead of computing it directly. In order to obtain the approximate result, effective corrected coefficients are utilized, which can reduce the complexity by eliminating the complex computations. Complexity analysis is provided and the results indicate that the complexity of the proposed algorithm is much lower than the general NMS algorithm and MS-based simplified algorithms. Simulation results show that the performance of the proposed algorithm can closely match the NMS algorithm with the same number of iterations. |
内容类型 | 会议论文 |
源URL | [http://ir.ia.ac.cn/handle/173211/21044] |
专题 | 自动化研究所_国家专用集成电路设计工程技术研究中心 |
作者单位 | 1.中国科学院大学 2.中国科学院自动化研究所 |
推荐引用方式 GB/T 7714 | Li H,Guo J,Guo C,et al. A Low-Complexity Min-Sum Decoding Algorithm for LDPC Codes[C]. 见:. 中国四川. 2017.10.27-2017.10.30. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论