.png){kind=icon}
返回
Linear-Complexity ADMM Updates for Decoding LDPC Codes in Partial Response Channels
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2019.2942022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter investigates the application of alternating direction method of multipliers (ADMM) in decoding low-density parity-check (LDPC) codes over partial response (PR) channels. Unlike the ADMM decoding in memoryless channels, the ADMM decoding in PR channels becomes involved with the correlation among adjacent code symbols. As the update equations for code symbols constitute the most complicated part of the ADMM decoding in PR channels, this letter focuses on their derivation by making use of the iterative fashion of ADMM and incorporating the use of a penalty function. A notable advantage of the proposed ADMM penalized decoding algorithm is that its complexity increases linearly with the memory length of PR channels. Simulation results show that the proposed algorithm can achieve error performance comparable with that of Turbo equalization (TE) in the waterfall region. It can also outperform TE at high signal-to-noise ratios as iteration grows.
Keyword:
ADMM
complexity
LDPC codes
partial response channel
turbo equalization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
分享收藏
查看更多内容