CASIA OpenIR  > 国家专用集成电路设计工程技术研究中心
A Low-Complexity Min-Sum Decoding Algorithm for LDPC Codes
Li H1,2; Guo J2; Guo C2; Wang D2
2018-05
Conference NameIEEE International Conference on Communication Technology
Conference Date2017.10.27-2017.10.30
Conference Place中国四川
Abstract

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.

KeywordLdpc Decoding Low-complexity Min-sum Simplified Check Nodes
Document Type会议论文
Identifierhttp://ir.ia.ac.cn/handle/173211/21044
Collection国家专用集成电路设计工程技术研究中心
Affiliation1.中国科学院大学
2.中国科学院自动化研究所
Recommended Citation
GB/T 7714
Li H,Guo J,Guo C,et al. A Low-Complexity Min-Sum Decoding Algorithm for LDPC Codes[C],2018.
Files in This Item: Download All
File Name/Size DocType Version Access License
A Low-Complexity Min(285KB)会议论文 开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li H]'s Articles
[Guo J]'s Articles
[Guo C]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li H]'s Articles
[Guo J]'s Articles
[Guo C]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li H]'s Articles
[Guo J]'s Articles
[Guo C]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: A Low-Complexity Min-Sum Decoding Algorithm for LDPC Codes.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.