Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/LCOMM.2019.2942022 | IEEE Communications Letters |
Keywords | Field | DocType |
Maximum likelihood decoding,Iterative decoding,Convex functions,Mathematical model,Memoryless systems | Computer science,Low-density parity-check code,Parallel computing,Computer network,Communication channel,Linear complexity,Decoding methods,Partial response | Journal |
Volume | Issue | ISSN |
23 | 12 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaopeng Jiao | 1 | 38 | 9.90 |
| Jianjun Mu | 2 | 41 | 10.63 |
| Yu-cheng He | 3 | 53 | 10.01 |
| Weinan Xu | 4 | 0 | 0.34 |