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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2013 IEEE International Conference on Communications s. 3264 - 3269
Hlavní autoři: Wymeersch, Henk, Penna, Federico, Savic, Vladimir, Jun Zhao
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2013
Témata:
Complexity theory
Decoding
Iterative decoding
LDPC
max-product
Message Passing
Signal to noise ratio
sum-product
ISBN:9781467331227, 1467331228
ISSN:1550-3607
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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