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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.