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