IEEE Wireless Communications and Networking Conference
GE-Free BP-OSD for Short 5G LDPC Codes
Qianfan Wang, Yue Wang, Jiayi Yang, Linqi Song, Xiao Ma
Abstract
In this paper, we propose a two-stage beliefpropagation ordered statistics decoding (BP-OSD)-like algorithm, referred to as BP-LCGCD, tailored to 5G low-density paritycheck (LDPC) codes. When standard BP decoding fails, a modified BP (mBP) with an iteration limit determined by the code's girth and a normalization factor is performed to generate reliable posterior log-likelihood ratios (LLRs) in the pre-processing stage. In the post-processing stage, a locally constrained guessing codeword decoding (LC-GCD) module uses these posterior LLRs from mBP to produce candidate codewords without online Gaussian elimination (GE), where numerous invalid test error patterns (TEPs) are skipped by the introduced local constraints. To predict the performance, we derive an upper bound on FER and employ a saddlepoint method to compute its dominant tail-probability term. Furthermore, we propose an offline EXIT-chart-based method to select a fixed quasi-reliable basis, where variable nodes with the highest mutual information are chosen. Simulation results demonstrate that the proposed GE-free BP-LCGCD significantly outperforms standard BP, achieves FER very close to GE-based BP-OSD, and approaches the finite-length bound across multiple code rates for 5G LDPC codes, while requiring significantly fewer re-encodings and eliminating the need for online GE.