Comparison of reweighted message passing algorithms for LDPC decoding

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...

Full description

Saved in:
Bibliographic Details
Published in:2013 IEEE International Conference on Communications pp. 3264 - 3269
Main Authors: Wymeersch, Henk, Penna, Federico, Savic, Vladimir, Jun Zhao
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2013
Subjects:
Complexity theory
Decoding
Iterative decoding
LDPC
max-product
Message Passing
Signal to noise ratio
sum-product
ISBN:9781467331227, 1467331228
ISSN:1550-3607
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:9781467331227
1467331228
ISSN:1550-3607
DOI:10.1109/ICC.2013.6655048