Comparison of reweighted message passing algorithms for LDPC decoding
2013 (English)In: IEEE International Conference on Communications (ICC), 2013, IEEE , 2013, 3264-3269 p.Conference paper (Refereed)
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 ofthe reweighted max-product decoder. When latency is not an issue, the traditional sum-product decoder yields the best performance.
Place, publisher, year, edition, pages
IEEE , 2013. 3264-3269 p.
Message Passing, LDPC, max-product, sum-product
Communication Systems Signal Processing
IdentifiersURN: urn:nbn:se:liu:diva-88545DOI: 10.1109/ICC.2013.6655048ISBN: 978-146733122-7OAI: oai:DiVA.org:liu-88545DiVA: diva2:604733
IEEE International Conference on Communications (ICC 2013), 9-13 June 2013, Budapest, Hungary
FundereLLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsSwedish Foundation for Strategic Research