Open AccessEfficient decoding approach for NB‐LDPC codes with short blocklength
Author(s) -
Yang Xiao,
Jiang Ming,
Li Zhengyi,
Wang Chen,
Zhao Chunming
Publication year - 2019
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2018.6099
Subject(s) - low density parity check code , decoding methods , algorithm , serial concatenated convolutional codes , concatenated error correction code , trellis (graph) , list decoding , computer science , mathematics , block code
In this study, the authors propose a parallel concatenated decoding (PCD) scheme for short non‐binary low‐density‐parity‐check (NB‐LDPC) codes. It consists of a reduced trellis extended min‐sum (R‐TEMS) algorithm which efficiently reduces the check node updating complexity over high‐order Galois fields and a low complexity ordered statistic decoding aided by partial cyclic redundancy check bits. The R‐TEMS algorithm has a negligible performance loss and noticeable reduction in decoding complexity with respect to the trellis‐based EMS (TEMS) algorithm. Besides, the PCD shows a close error‐correction performance when compared with other concatenated decoding schemes for NB‐LDPC codes. It achieves a coding gain about 0.5 dB with reasonable complexity contrasted with the Q‐ary sum–product algorithm for high‐rate short NB‐LDPC codes over GF(256).