Globecom

On the Design of Generalized LDPC Codes with Component BCJR Decoding

Yanfang Liu, Pablo M. Olmos, David G. M. Mitchell

Published Dec 1, 2020• 6 citations

Abstract

Generalized low-density parity-check (GLDPC) codes, where the single parity-check (SPC) nodes are replaced by generalized constraint (GC) nodes, are known to offer a reduced gap to capacity when compared with conventional LDPC codes, while also maintaining linear growth of minimum distance. However, for certain classes of practical GLDPC codes, there remains a gap to capacity even when utilizing blockwise decoding algorithm at GC nodes. In this work, we propose to optimize the design of GLDPC codes where the GC nodes are decoded with a trellis-based bit-wise Bahl-Cocke-Jelinek- Raviv (BCJR) component decoding algorithm. We analyze the asymptotic threshold behavior of GLDPC codes and determine the optimal proportion of the GC nodes in the GLDPC Tanner graph.We show significant performance improvements compared to existing designs with the same order of decoding complexity.

DOI: 10.1109/globecom42002.2020.9322143

Related papers

On LDPC code ensembles with generalized constraints

Yanfang Liu, Pablo M. Olmos, Tobias Koch

In this paper, we analyze the tradeoff between coding rate and asymptotic performance of a class of generalized low-density parity-check (GLDPC) codes constructed by including a certain fraction of generalized constraint (GC) nodes in the graph. The rate of the GLDPC ensemble is bounded using classical results on linear block codes, namely Hamming bound and Varshamov bound. We also study the impact of the decoding method used at GC nodes. To incorporate both bounded-distance (BD) and Maximum Likelihood (ML) decoding at GC nodes into our analysis without having to resort on multi-edge type of degree distributions (DDs), we propose the probabilistic peeling decoder (P-PD) algorithm, which models the decoding step at every GC node as an instance of a Bernoulli random variable with a success probability that depends on the GC block code and its decoding algorithm. The P-PD asymptotic performance over the BEC can be efficiently predicted using standard techniques for LDPC codes such as density evolution (DE) or the differential equation method. Furthermore, for a class of GLDPC ensembles, we demonstrate that the simulated P-PD performance accurately predicts the actual performance of the GLPDC code. We illustrate our analysis for GLDPC code ensembles using (2, 6) and (2,15) base DDs. In all cases, we show that a large fraction of GC nodes is required to reduce the original gap to capacity.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20171 citation

A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC

Yanfang Liu, Pablo M. Olmos, Tobias Koch

In this paper, we analyze the tradeoff between coding rate and asymptotic performance of a class of generalized low-density parity-check (GLDPC) codes constructed by including a certain fraction of generalized constraint (GC) nodes in the graph. The rate of the GLDPC ensemble is bounded using classical results on linear block codes, namely, Hamming bound and Varshamov bound. We also study the impact of the decoding method used at GC nodes. To incorporate both bounded-distance (BD) and maximum likelihood (ML) decoding at GC nodes into our analysis without resorting on multi-edge type of degree distributions (DDs), we propose the probabilistic peeling decoding (P-PD) algorithm, which models the decoding step at every GC node as an instance of a Bernoulli random variable with a successful decoding probability that depends on both the GC block code and its decoding algorithm. The P-PD asymptotic performance over the BEC can be efficiently predicted using standard techniques for LDPC codes such as density evolution (DE) or the differential equation method. Furthermore, for a class of GLDPC ensembles, we demonstrate that the simulated P-PD performance accurately predicts the actual performance of the GLPDC code under ML decoding at GC nodes. We illustrate our analysis for GLDPC code ensembles with regular and irregular DDs. In all cases, we show that a large fraction of GC nodes is required to reduce the original gap to capacity, but the optimal fraction is strictly smaller than one. We then consider techniques to further reduce the gap to capacity by means of random puncturing, and the inclusion of a certain fraction of generalized variable nodes in the graph.

arXiv:1709.00873IEEE Transactions on Information TheoryJul 12, 201916 citations

Generalized LDPC code with single-parity-check product constraints at super check nodes

Y. Min, Francis C. M. Lau, Chi Kong Tse

Due to the more complex constraints, generalized low-density parity-check (GLDPC) codes can achieve better error performance but require much higher decoding complexities compared with the standard LDPC codes. In this paper, single-parity-check product-codes (SPC-PCs) are considered as the constituent codes in the super check nodes of a GLDPC code. Moreover, turbo iterations are used in decoding the SPC-PCs. The error performance and the decoder complexity of the proposed GLDPC code are compared with other LDPC code and GLDPC code.

International Symposium on Turbo Codes and Iterative Information ProcessingAug 1, 20127 citations

Low-complexity Decoding Method of Generalized LDPC with Polar Component Codes

Wenxue Sun, Yin Xu, Hao Ju +5 more

Generalized low-density parity-check with polar component (GLDPC-PC) codes exhibit promising potential for 6G wireless systems with higher demands on reliability and data rate. The decoding method for GLDPC-PC codes involves belief propagation (BP), where the soft information of the component code is used as extrinsic information for check nodes. Although the Bahl-Cocke-Jelinek-Raviv (BCJR) decoding algorithm provides bitwise optimal soft information for linear block codes, its decoding complexity increases exponentially with the code length, making it impractical for applications. Therefore, the near-optimal soft-output successive cancellation list (SO-SCL) decoding with fixed scaling is proposed to reduce decoding complexity. However, the complexity of SO-SCL decoding still holds potential for further optimization. In this work, we propose an offline approximation of the unvisited probability codebook and a staged scaling strategy for the extrinsic information to reduce decoding complexity while maintaining low performance loss.

IEEE/CIC International Conference on Communications in China (ICCC)Aug 10, 20250 citations

Decoding of Generalized LDPC Codes Using the BCJR Algorithm

Alexey A. Bandyukov, Andrey A. Metlyakov, Fedor I. Ivanov

Generalized low-density parity-check (GLDPC) codes have emerged as a promising class of error-correcting codes that extend the capabilities of traditional LDPC codes by incorporating more powerful component codes. This paper investigates an approach to construct long GLDPC codes using short component codes. In this scheme, the BCJR algorithm is used as a component decoder and integrated into the belief propagation algorithm. Simulation results demonstrate that constructions incorporating quasi-cyclic LDPC codes yield the best performance. Compared to the conventional decoding approach for LDPC codes, the proposed generalized constructions demonstrated better bit and frame error rate performance. This approach is promising for communication systems that require low latency. A comparison is also provided with LDPC codes constructed using the Progressive Edge-Growth (PEG) algorithm.

International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY)Nov 5, 20250 citations

Density Evolution Analysis of Generalized Low-density Parity-check Codes under a Posteriori Probability Decoder

Chang, Dongxu, Qingqing Peng, Ma, Zhiming +2 more

In this study, the performance of generalized low-density parity-check (GLDPC) codes under the a posteriori probability (APP) decoder is analyzed. We explore the concentration, symmetry, and monotonicity properties of GLDPC codes under the APP decoder, extending the applicability of density evolution to GLDPC codes. On the binary memoryless symmetric channels, using the BEC and BI-AWGN channels as two examples, we demonstrate that with an appropriate proportion of generalized constraint (GC) nodes, GLDPC codes can reduce the original gap to capacity compared to their original LDPC counterparts. Additionally, on the BI-AWGN channel, we apply and improve the Gaussian approximation algorithm in the density evolution of GLDPC codes. By adopting Gaussian mixture distributions to approximate the message distributions from variable nodes and Gaussian distributions for those from constraint nodes, the precision of the channel parameter threshold can be significantly enhanced while maintaining a low computational complexity similar to that of Gaussian approximations. Furthermore, we identify a class of subcodes that can greatly simplify the performance analysis and practical decoding of GLDPC codes, which we refer to as message-invariant subcodes. Using the aforementioned techniques, our simulation experiments provide empirical evidence that GLDPC codes, when decoded with the APP decoder and equipped with the right fraction of GC nodes, can achieve substantial performance improvements compared to low-density parity-check (LDPC) codes.

arXiv:2404.01136Apr 1, 20240 citations