An Iterative Scheme for Lowering the Error-Floor of Low-Density Parity-Check Codes

DOI

10.2991/cecs-18.2018.19How to use a DOI?

Keywords

Error floor, two-stage iterative decoding scheme, belief propagation, LDPC, parity check equations.

Abstract

This paper proposes a two-stage iterative decoding scheme named matrix transform belief propagation scheme (MT-BP) based on conventional belief propagation (BP) algorithm for low-density parity-check (LDPC) codes. By introducing information measurement, location vectors and parity check matrix transform, the proposed method can establish additional parity check equations and take more information bits of variable nodes into consideration compared with conventional BP algorithm. The simulations are performed on random regular LDPC codes and algebraic quasi-cyclic codes (QC-LDPC), the experimental results show MT-BP method can efficiently reduce the bit error rate (BER).

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zuohong Xu
AU  - Yanmin Ma
AU  - Qian Cheng
AU  - Jiang Zhu
AU  - Kai Gao
PY  - 2018/07
DA  - 2018/07
TI  - An Iterative Scheme for Lowering the Error-Floor of Low-Density Parity-Check Codes
BT  - Proceedings of the 2018 International Symposium on Communication Engineering & Computer Science (CECS 2018)
PB  - Atlantis Press
SP  - 99
EP  - 103
SN  - 2352-538X
UR  - https://doi.org/10.2991/cecs-18.2018.19
DO  - 10.2991/cecs-18.2018.19
ID  - Xu2018/07
ER  -