A Generalization of Residual Belief Propagation for Flexible Reduced Complexity LDPC Decoding

Authors:

Beermann, M. ,  Vary, P.

Book Title:

Proceedings of IEEE Vehicular Technology Conference (VTC-Fall)

Organization:

IEEE

Address:

Kyoto, Japan

Date:

Sep. 2011

ISBN:

978-1-42448-328-0

ISSN:

1090-3038

DOI:

10.1109/VETECF.2011.6092834

Language:

English

Abstract

Beside the well known iterative Belief Propagation algorithm several alternative decoding schemes for Low-Density Parity-Check (LDPC) codes providing better performance in terms of residual error rate, convergence speed or computational complexity have been developed in the last years. Recently, Informed Dynamic Scheduling has been proposed in [1] providing different decoding strategies that dynamically decide which messages are passed throughout the decoding process. It was shown that the overall convergence can be sped up considerably and also more errors can be corrected compared to other (non-dynamic) decoding strategies. However, these improvements are somehow overshadowed by a significant amount of additional computational complexity that is needed for the selection of the messages to be updated in each decoding step. We propose two novel dynamic decoding strategies that allow for a flexible adaptation of the decoder’s dynamics and reduce the additional complexity remarkably while maintaining, and in some cases even exceeding, the convergence speed and error rate performance of currently known dynamic schedules.

Download

BibTeX

Copyright © by IEEE
beermann11b.pdf

© 2024 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

---