Publications – Details
Improved Decoding of Binary and Non-Binary LDPC Codes by Probabilistic Shuffled Belief Propagation
- Authors:
- Moritz Beermann, Laurent Schmalen, and Peter Vary
- Book Title:
- Proceedings of IEEE International Conference on Communications (ICC)
- Venue:
- Kyoto, Japan
- Event Date:
- 5.-9.6.2011
- Organization:
- IEEE
- Date:
- June 2011
- ISBN:
- 978-1-61284-232-5
- ISSN:
- 1550-3607
- URL:
- 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 of Publication
Copyright Notice
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
The following notice applies to all IEEE publications:
© IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.