Comparison of Reweighted Message Passing Algorithms for LDPC Decoding
Paper in proceeding, 2013

Low density parity check (LDPC) codes can be decoded with a variety of decoding algorithms, offering a trade-off in terms of complexity, latency, and performance. We describe seven distinct LDPC decoders and provide a performance comparison for a practical regular LDPC code. Our simulations indicate that the best performance/latency trade-off is achieved by one version of the reweighted max-product decoder. When latency is not an issue, the traditional sum-product decoder yields the best performance.

Author

Henk Wymeersch

Chalmers, Signals and Systems, Communication, Antennas and Optical Networks

Federico Penna

Fraunhofer Society

Vladimir Savic

Linköping University

Jun Zhao

Chalmers, Signals and Systems

IEEE International Conference on Communications

15503607 (ISSN)

3264-3269
978-146733122-7 (ISBN)

Cooperative Situational Awareness for Wireless Networks (COOPNET)

European Commission (EC) (EC/FP7/258418), 2011-05-01 -- 2016-04-30.

Areas of Advance

Information and Communication Technology

Subject Categories (SSIF 2011)

Telecommunications

Communication Systems

Infrastructure

C3SE (-2020, Chalmers Centre for Computational Science and Engineering)

DOI

10.1109/ICC.2013.6655048

ISBN

978-146733122-7

More information

Latest update

3/8/2025 1