Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Asia Communications and Photonics Conference

Optimization of NB-QC-LDPC Codes with Column Weight Not Exceeding Three

Jingke Zou, Liqian Wang

Published Nov 4, 2023• 0 citations
Publisher

Abstract

The non-binary quasi cyclic low-density parity-check (NB-QC-LDPC) code is a strong candidate code in optical communication. However, the presence of elementary absorbing sets in NB-QC-LDPC codes can degrade the frame error rate (FER) performance of the codes in the error floor region. Additionally, better minimum Hamming distance distribution can improve the FER performance of codes in the waterfall region. In this paper, a joint optimization of absorbing sets and minimum Hamming distance distribution is proposed for NB-QC-LDPC codes with a maximum column weight not exceeding 3. Simulation results show that the constructed codes could achieve comparable or better FER compared to the recently proposed NB-QC-LDPC codes with the same codes parameters.

DOI
10.1109/acp/poem59049.2023.10369673

Related papers

Non-Binary QC-LDPC Codes with Large Girth Devoid of Dominant Absorbing Sets

Suresh Kumar Venkataramanappa, Pavan Kumar, Deepak Mishra +1 more

Non-binary (NB) low-density parity-check (LDPC) codes offer superior error-correcting performance compared to binary LDPC codes, especially for short and medium lengths. Constructing such codes with large girth remains challenging due to various combinatorial constraints. We present a novel algebraic and graph-theoretic construction of non-binary quasi-cyclic (QC) LDPC codes with column weight two and girth 12, which is known to be largest achievable girth for array-based QC-LDPC codes. In constructing girth-12 (2, dc) NB-QC-LDPC codes, our method attains the minimum possible code length for dc < 10. Motivated by the fact that non-binary spatially coupled (SC) QC-LDPC codes achieve optimal performance at column weight three, we further construct NB-SC-QC-LDPC codes with girth ≥ 8 while effectively reducing the number of 8-cycles. Specifically, for (3, dc) codes, our design eliminates dominant absorbing sets such as the (3, 3) and (4, 2), eliminates the (5, 1) elementary absorbing sets (EAS), and eliminates almost all (6, 2) EAS, thereby directly enhancing the error-correction performance. The proposed NB-QC-LDPC codes achieve performance comparable to NB-LDPC codes used in the BeiDou satellite navigation system, while requiring a significantly smaller parity-check matrix storage footprint, for instance, around a 44× reduction in storage requirements with respect to BeiDou rate-1/2 (88, 44) code. Also, the proposed rate-1/2 code with length n = 684 provide a 0.4 dB gain over non-binary near-regular QC-LDPC code with same parameters proposed by Huang et al. [IEEE Trans. Commun.] while requiring a smaller parity-check matrix storage footprint. Furthermore, the proposed rate-1/2 NB-SC-QC-LDPC code having length n = 4608 achieve 0.1 dB coding gain compared to existing protograph constructions while requiring a significantly smaller parity-check matrix storage footprint, i.e., around a 192× reduction.

•Oct 15, 2025•0 citations

Design of Quasi-Cyclic Cycle LDPC Codes over GF(q)

HU Shu-kai, Chao Chen, Rong Xia Sun +1 more

Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j=2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.

IEICE Transactions on Communications•Jan 1, 2012•0 citations

Design of non-binary quasi-cyclic LDPC codes by absorbing set removal

Behzad Amiri, Jorge Arturo Flores Castro, Lara Dolecek

Non-binary quasi-cyclic (NB-QC) codes are a class of graph-based codes with high performance and implementation-friendly structure. In this paper, we introduce a new method for designing NB-QC codes with improved performance in the low error-rate region. Specifically, we propose a construction which reduces the number of non-binary absorbing sets, which are known to cause errors when decoding non-binary LDPC codes. Our construction is based on a careful selection of the code design parameters. Simulation results demonstrate the superior performance of codes designed according to our technique compared to existing state-of-the-art NB-QC codes.

IEEE Information Theory Workshop (ITW)•Nov 1, 2014•2 citations

Irregular Generalized LDPC codes in Practical Communication Scenarios

Irina E. Bocharova, Boris D. Kudryashov, Sander Mikelsaar

High-rate irregular Generalized LDPC (GLDPC) codes with low-complexity constituent codes are studied. The main area of focus is the optimization of the underlying irregular binary LDPC codes and their matching with constituent codes. Finite length random coding bound on the maximum-likelihood decoding error probability of a random ensemble of irregular GLDPC codes is derived and compared with a similar bound for non-binary (NB) LDPC codes over small alphabets.A new algorithm for assigning columns of the parity-check matrix of a constituent code to nonzero elements of a base matrix of the quasi-cyclic (QC)-GLDPC code is presented. Examples of the constructed QC-GLDPC codes are given. The simulation results for frame error rate (FER) performance of the belief-propagation (BP) decoding for the QC-GLDPC codes are presented and compared with the same performance of NB QC-LDPC codes over small alphabets and binary LDPC codes in the WiFi and 5G standards.Both GLDPC codes and NB LDPC codes with sufficiently low decoding complexity are shown to outperform their binary LDPC counterparts, while GLDPC codes appear to be more advantageous in terms of decoding complexity.

IEEE Information Theory Workshop (ITW)•Nov 1, 2022•1 citation

Optimization of NB QC-LDPC Block Codes and Their Performance Analysis

Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov +2 more

We propose an approach for optimizing nonbinary (NB) quasi-cyclic (QC) LDPC codes. This approach combines constructing of base parity-check matrices by simulated annealing and labeling the obtained base matrices aimed at maximizing the so-called generalized girth of the NB LDPC code Tanner graph. Tightened random coding bounds based on the average binary spectra for ensembles of "almost regular" NB LDPC codes of finite lengths over extensions of the binary Galois field are derived. The simulated FER performance of the sum-product BP decoding of "almost regular" NB QC-LDPC block codes are presented and compared with the derived finite-length random coding bounds as well as with the same performance of the optimized binary QC-LDPC block code in the 5G standard. In the waterfall region our finite-length bounds on the error probability of ML decoding are about 0.1--0.2 dB away from the simulated FER performance of BP decoding.

arXiv:2006.12147•Jun 22, 2020•5 citations

Construction of quasi-cyclic low-density parity-check codes using Hamming codewords

Haijing Zhong, Shancheng Zhao, Li Chen +1 more

In this paper, we propose a new approach to construct quasi-cyclic low-density parity-check (QC-LDPC) codes using Hamming codewords of weight three, namely the HM-QC-LDPC codes. Thanks to the distance property of Hamming codes, length four cycles are avoided from the Tanner graph of the constructed codes, resulting in codes of girth six. This approach can be further extended to construct QC-LDPC codes of girth eight. Our numerical results show that the proposal has a better cycle profile than the progressive-edge-growth (PEG) constructed codes, and consequently prevails in performance. Moreover, the constructed QC-LDPC code prevails the LDPC code of the IEEE802.22 standard by 0.2 dB at the bit error rate (BER) of 10-8when the codeword length is within hundreds of bits, making it a promising candidate for scenarios where strict decoding latency is imposed.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2016•1 citation
The non-binary quasi cyclic low-density parity-check (NB-QC-LDPC) code is a strong candidate code in optical communication. However, the presence of elementary absorbing sets in NB-QC-LDPC codes can degrade the frame error rate (FER) performance of the codes in the error floor region. Additionally, better minimum Hamming distance distribution can improve the FER performance of codes in the waterfall region. In this paper, a joint optimization of absorbing sets and minimum Hamming distance distribution is proposed for NB-QC-LDPC codes with a maximum column weight not exceeding 3. Simulation results show that the constructed codes could achieve comparable or better FER compared to the recently proposed NB-QC-LDPC codes with the same codes parameters.
Non-binary (NB) low-density parity-check (LDPC) codes offer superior error-correcting performance compared to binary LDPC codes, especially for short and medium lengths. Constructing such codes with large girth remains challenging due to various combinatorial constraints. We present a novel algebraic and graph-theoretic construction of non-binary quasi-cyclic (QC) LDPC codes with column weight two and girth 12, which is known to be largest achievable girth for array-based QC-LDPC codes. In constructing girth-12 (2, dc) NB-QC-LDPC codes, our method attains the minimum possible code length for dc < 10. Motivated by the fact that non-binary spatially coupled (SC) QC-LDPC codes achieve optimal performance at column weight three, we further construct NB-SC-QC-LDPC codes with girth ≥ 8 while effectively reducing the number of 8-cycles. Specifically, for (3, dc) codes, our design eliminates dominant absorbing sets such as the (3, 3) and (4, 2), eliminates the (5, 1) elementary absorbing sets (EAS), and eliminates almost all (6, 2) EAS, thereby directly enhancing the error-correction performance. The proposed NB-QC-LDPC codes achieve performance comparable to NB-LDPC codes used in the BeiDou satellite navigation system, while requiring a significantly smaller parity-check matrix storage footprint, for instance, around a 44× reduction in storage requirements with respect to BeiDou rate-1/2 (88, 44) code. Also, the proposed rate-1/2 code with length n = 684 provide a 0.4 dB gain over non-binary near-regular QC-LDPC code with same parameters proposed by Huang et al. [IEEE Trans. Commun.] while requiring a smaller parity-check matrix storage footprint. Furthermore, the proposed rate-1/2 NB-SC-QC-LDPC code having length n = 4608 achieve 0.1 dB coding gain compared to existing protograph constructions while requiring a significantly smaller parity-check matrix storage footprint, i.e., around a 192× reduction.
Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j=2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.
Non-binary quasi-cyclic (NB-QC) codes are a class of graph-based codes with high performance and implementation-friendly structure. In this paper, we introduce a new method for designing NB-QC codes with improved performance in the low error-rate region. Specifically, we propose a construction which reduces the number of non-binary absorbing sets, which are known to cause errors when decoding non-binary LDPC codes. Our construction is based on a careful selection of the code design parameters. Simulation results demonstrate the superior performance of codes designed according to our technique compared to existing state-of-the-art NB-QC codes.
High-rate irregular Generalized LDPC (GLDPC) codes with low-complexity constituent codes are studied. The main area of focus is the optimization of the underlying irregular binary LDPC codes and their matching with constituent codes. Finite length random coding bound on the maximum-likelihood decoding error probability of a random ensemble of irregular GLDPC codes is derived and compared with a similar bound for non-binary (NB) LDPC codes over small alphabets.A new algorithm for assigning columns of the parity-check matrix of a constituent code to nonzero elements of a base matrix of the quasi-cyclic (QC)-GLDPC code is presented. Examples of the constructed QC-GLDPC codes are given. The simulation results for frame error rate (FER) performance of the belief-propagation (BP) decoding for the QC-GLDPC codes are presented and compared with the same performance of NB QC-LDPC codes over small alphabets and binary LDPC codes in the WiFi and 5G standards.Both GLDPC codes and NB LDPC codes with sufficiently low decoding complexity are shown to outperform their binary LDPC counterparts, while GLDPC codes appear to be more advantageous in terms of decoding complexity.
We propose an approach for optimizing nonbinary (NB) quasi-cyclic (QC) LDPC codes. This approach combines constructing of base parity-check matrices by simulated annealing and labeling the obtained base matrices aimed at maximizing the so-called generalized girth of the NB LDPC code Tanner graph. Tightened random coding bounds based on the average binary spectra for ensembles of "almost regular" NB LDPC codes of finite lengths over extensions of the binary Galois field are derived. The simulated FER performance of the sum-product BP decoding of "almost regular" NB QC-LDPC block codes are presented and compared with the derived finite-length random coding bounds as well as with the same performance of the optimized binary QC-LDPC block code in the 5G standard. In the waterfall region our finite-length bounds on the error probability of ML decoding are about 0.1--0.2 dB away from the simulated FER performance of BP decoding.
In this paper, we propose a new approach to construct quasi-cyclic low-density parity-check (QC-LDPC) codes using Hamming codewords of weight three, namely the HM-QC-LDPC codes. Thanks to the distance property of Hamming codes, length four cycles are avoided from the Tanner graph of the constructed codes, resulting in codes of girth six. This approach can be further extended to construct QC-LDPC codes of girth eight. Our numerical results show that the proposal has a better cycle profile than the progressive-edge-growth (PEG) constructed codes, and consequently prevails in performance. Moreover, the constructed QC-LDPC code prevails the LDPC code of the IEEE802.22 standard by 0.2 dB at the bit error rate (BER) of 10-8when the codeword length is within hundreds of bits, making it a promising candidate for scenarios where strict decoding latency is imposed.