Publications-Detail

Improved Decoding of Binary and Non-Binary LDPC Codes by Probabilistic Shuffled Belief Propagation

Authors:
Beermann, M.Schmalen, L.Vary, P.
Book Title:
Proceedings of IEEE International Conference on Communications (ICC)
Organization:
IEEE
Date:
Jun. 2011
ISBN:
978-1-61284-232-5
ISSN:
1550-3607
DOI:
10.1109/icc.2011.5962813
Language:
English

Abstract

Low-density parity-check (LDPC) codes have proved to be very powerful channel coding schemes with a broad range of applications. However, as maximum-likelihood decoding is utterly complex, suboptimal decoders have to be employed. One of the most popular decoding algorithms of LDPC codes is belief propagation (BP) decoding. In this paper, we present a novel scheduling for belief propagation decoding of LDPC codes. The new approach combines probabilistic scheduling with the known shuffled and check-shuffled serial scheduling algorithms. The resulting probabilistic shuffled and probabilistic check-shuffled decoders show a superior performance in terms of residual bit error rate. The drawback is that the convergence speed is slightly decreased. However, the convergence is still faster than for the standard and probabilistic flooding algorithms. Furthermore, we have adapted the probabilistic and the proposed probabilistic serial BP schemes to the non-binary case. We show that the aforementioned effects on the binary decoder can similarly be observed when applying the different schedules to the decoding of LDPC codes over higher order Galois fields.

Download

BibTeX

Copyright © by IEEE
beermann11a.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.