Comparison of Reweighted Message Passing Algorithms for LDPC Decoding
Paper i 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.

Författare

Henk Wymeersch

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Federico Penna

Fraunhofer-Institut fur Nachrichtentechnik Heinrich-Hertz-Institut - HHI

Vladimir Savic

Linköpings universitet

Jun Zhao

Chalmers, Signaler och system

2013 IEEE International Conference on Communications, ICC 2013; Budapest; Hungary; 9 June 2013 through 13 June 2013

1550-3607 (ISSN)

3264-3269

Coopnet

Europeiska kommissionen (FP7), 2011-05-01 -- 2016-04-30.

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Telekommunikation

Kommunikationssystem

Infrastruktur

C3SE (Chalmers Centre for Computational Science and Engineering)

DOI

10.1109/ICC.2013.6655048

ISBN

978-146733122-7

Mer information

Senast uppdaterat

2018-02-28