Efficient decoding approach for NB-LDPC codes with short blocklength

• Published in: IET communications Vol. 13; no. 14; pp. 2141 - 2145
• Main Authors: Yang, Xiao, Jiang, Ming, Li, Zhengyi, Wang, Chen, Zhao, Chunming
• Format: Journal Article
• Language: English
• Published: The Institution of Engineering and Technology 27.08.2019
• Subjects: channel coding; check node updating complexity; close error‐correction performance; coding gain; computational complexity; cyclic redundancy check codes; decoding; efficient decoding approach; error correction; Galois fields; high‐order Galois fields; high‐rate short NB‐LDPC codes; low complexity ordered statistic decoding; negligible performance loss; noise figure 0.5 dB; noticeable reduction; parallel concatenated decoding scheme; parity check codes; partial cyclic redundancy check bits; PCD; Q‐ary sum–product algorithm; reasonable complexity; reduced trellis extended min‐sum algorithm; Research Article; R‐TEMS algorithm; short blocklength; short nonbinary low‐density‐parity‐check codes; statistic decoding; trellis codes; trellis‐based EMS algorithm; noticeable reduction; channel coding; parity check codes; high-rate short NB-LDPC codes; trellis codes; Q-ary sum–product algorithm; partial cyclic redundancy check bits; short blocklength; R-TEMS algorithm; negligible performance loss; error correction; high-order Galois fields; reasonable complexity; reduced trellis extended min-sum algorithm; close error-correction performance; parallel concatenated decoding scheme; trellis-based EMS algorithm; noise figure 0.5 dB; check node updating complexity; short nonbinary low-density-parity-check codes; Galois fields; decoding; PCD; efficient decoding approach; coding gain; statistic decoding; low complexity ordered statistic decoding; cyclic redundancy check codes; computational complexity
• ISSN: 1751-8628; 1751-8636; 1751-8636
• DOI: 10.1049/iet-com.2018.6099

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).