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

NB-LDPC Codes with High Rates Achieving Low BER over the AWGN Channel with QAM Signaling

Gada Rezgui, Asma Maaloui, Iryna Andriyanova, Charly Poulliat, Cyril Méasson

Published Oct 24, 2020• 2 citations
OpenAlex

Abstract

The paper investigates high-rate Low-Density-Parity-Check (LDPC) codes, able to achieve a low bit error rate (BER). Such an operational regime of LDPC codes finds its application in optical transmissions. For this reason the considered transmission model is the one close to optical communications: it is a M-ary Quadrature-Amplitude Modulation (QAM) signaling over the M-ary input additive Gaussian channel.We study three main points: a) which LDPC codes of fixed codelength can achieve low BER for a code rate R ≥ 0.8; b) whether non-binary LDPC (NB-LDPC) codes, defined over GF(Q), are efficient in this setting; c) how to keep a reasonable decoding complexity for a given modulation order. Our performance analysis is complete and it is based on the calculation of the average bit error rate of a given ensemble, by using both asymptotic and finite-length tools of sparse-graph codes.Our results show that NB-LDPC codes with moderate values of Q, together with a Symbol Interleaved Coded Modulation (SICM) approach, offer the best performance at low BER.

Related papers

Performance Analysis of NB-QC-LDPC Code for High-Speed Optical Communication Systems

Zhiqiang Lin, Jianyong Zhang

In the paper, we construct the non-binary quasi-cyclic low-density parity check (NB-QC-LDPC) code from the quasi-cyclic low-density parity check (QC-LDPC) code. The NB-QC-LDPC code over the Galois field GF(4) is suitable for 100Gb/s optical communication systems with QPSK or DQPSK modulation formats. We also study the bit error ratio (BER) performance of the NB-QC-LDPC code by using the Log-Fourier Sum and Product decoding algorithm (LFSPA). The numerical results show that the NB-QC-LDPC code with code length 500 can provide approximately 5.5dB coding gain at the BER of 910- and outperform QC-LDPC code by 0.7dB.

International Conference on Electronics, Communications and Control•Oct 16, 2012•0 citations

Research of Multi-Rate LDPC Decoding in Optical Communication System

Wenhao Jin, Chunwu Liu

Low-density parity-check code (LDPC) not only has good performance approaching the Shannon limit, but also has low decoding complexity and flexible structure. It is a research hot-spot in the field of channel coding in recent years and has a wide range of application prospects in optical communication systems. In this paper, the decoding aspects and performance of LDPC codes are analyzed and compared according to the bit error rate (BER) of LDPC codes. The computer simulation was carried out under additive white Gaussian noise (AWGN) channel and binary phase shift keying (BPSK) modulation. Through theoretical analysis and simulation results, this paper explores the way of multi-rate LDPC decoding.

Optics and Photonics Journal•Jan 1, 2020•1 citation

Performance study of non-binary LDPC Codes over GF(q)

V. S. Ganepola, R.A. Carrasco, Ian James Wassell +1 more

Low-density parity check (LDPC) codes are known to perform well in the presence of additive white Gaussian noise (AWGN) but for very large block lengths. It has been proposed to define the codes over high order Galois fields to overcome this limitation. In this paper we construct new quasi-cyclic non-binary LDPC codes with moderate code lengths from Reed-Solomon codes with two message symbols proposed by Lin et al defined over large finite fields. We evaluate the performance of these codes on the AWGN channel by computer simulation and show that they outperform binary LDPC codes of the same length in binary bits.

International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)•Jul 1, 2008•21 citations

High-Rate Nonbinary Regular Quasi-Cyclic LDPC Codes for Optical Communications

Murat Arabaci, Ivan B. Djordjević, Ross Saunders +1 more

The parity-check matrix of a nonbinary (NB) low-density parity-check (LDPC) code over Galois field GF(q) is constructed by assigning nonzero elements from GF(q) to the 1s in corresponding binary LDPC code. In this paper, we state and prove a theorem that establishes a necessary and sufficient condition that an NB matrix over GF(q), constructed by assigning nonzero elements from GF(q) to the 1s in the parity-check matrix of a binary quasi-cyclic (QC) LDPC code, must satisfy in order for its null-space to define a nonbinary QC-LDPC (NB-QC-LDPC) code. We also provide a general scheme for constructing NB-QC-LDPC codes along with some other code construction schemes targeting different goals, e.g., a scheme that can be used to construct codes for which the fast-Fourier-transform-based decoding algorithm does not contain any intermediary permutation blocks between bit node processing and check node processing steps. Via Monte Carlo simulations, we demonstrate that NB-QC-LDPC codes can achieve a net effective coding gain of 10.8 dB at an output bit error rate of 10-12. Due to their structural properties that can be exploited during encoding/decoding and impressive error rate performance, NB-QC-LDPC codes are strong candidates for application in optical communications.

Journal of Lightwave Technology•Aug 7, 2009•41 citations

Density Evolution for Nonbinary LDPC Codes Under Gaussian Approximation

Ge Li, I.J. Fair, Witold A. Krzymień

This paper extends the work on density evolution for binary low-density parity-check (LDPC) codes with Gaussian approximation to LDPC codes over GF(q) . We first generalize the definition of channel symmetry for nonbinary inputs to include q-ary phase-shift keying (PSK) modulated channels for prime q and binary-modulated channels for q that is a power of 2. For the well-defined q-ary-input symmetric-output channel, we prove that under the Gaussian assumption, the density distribution for messages undergoing decoding is fully characterized by (q-1) quantities. Assuming uniform edge weights, we further show that the density of messages computed by the check node decoder (CND) is fully defined by a single number. We then present the approximate density evolution for regular and irregular LDPC codes, and show that the (q-1) -dimensional integration involved can be simplified using a dimensionality reduction algorithm for the important case of q=2p. Through application of approximate density evolution and linear programming, we optimize the degree distribution of LDPC codes over GF(3) and GF(4). The optimized irregular LDPC codes demonstrate performance close to the Shannon capacity for long codewords. We also design GF(q) codes for high-order modulation by using the idea of a channel adapter. We find that codes designed in this fashion outperform those optimized specifically for the binary additive white Gaussian noise (AWGN) channel for a short codewords and a spectral efficiency of 2 bits per channel use (b/cu).

IEEE Transactions on Information Theory•Feb 26, 2009•82 citations

On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels

Amir Bennatan, David Burshtein

We discuss three structures of modified low-density parity-check (LDPC) code ensembles designed for transmission over arbitrary discrete memoryless channels. The first structure is based on the well-known binary LDPC codes following constructions proposed by Gallager and McEliece, the second is based on LDPC codes of arbitrary (q-ary) alphabets employing modulo-q addition, as presented by Gallager, and the third is based on LDPC codes defined over the field GF(q). All structures are obtained by applying a quantization mapping on a coset LDPC ensemble. We present tools for the analysis of nonbinary codes and show that all configurations, under maximum-likelihood (ML) decoding, are capable of reliable communication at rates arbitrarily close to the capacity of any discrete memoryless channel. We discuss practical iterative decoding of our structures and present simulation results for the additive white Gaussian noise (AWGN) channel confirming the effectiveness of the codes.

IEEE Transactions on Information Theory•Mar 1, 2004•136 citations
The paper investigates high-rate Low-Density-Parity-Check (LDPC) codes, able to achieve a low bit error rate (BER). Such an operational regime of LDPC codes finds its application in optical transmissions. For this reason the considered transmission model is the one close to optical communications: it is a M-ary Quadrature-Amplitude Modulation (QAM) signaling over the M-ary input additive Gaussian channel.We study three main points: a) which LDPC codes of fixed codelength can achieve low BER for a code rate R ≥ 0.8; b) whether non-binary LDPC (NB-LDPC) codes, defined over GF(Q), are efficient in this setting; c) how to keep a reasonable decoding complexity for a given modulation order. Our performance analysis is complete and it is based on the calculation of the average bit error rate of a given ensemble, by using both asymptotic and finite-length tools of sparse-graph codes.Our results show that NB-LDPC codes with moderate values of Q, together with a Symbol Interleaved Coded Modulation (SICM) approach, offer the best performance at low BER.
In the paper, we construct the non-binary quasi-cyclic low-density parity check (NB-QC-LDPC) code from the quasi-cyclic low-density parity check (QC-LDPC) code. The NB-QC-LDPC code over the Galois field GF(4) is suitable for 100Gb/s optical communication systems with QPSK or DQPSK modulation formats. We also study the bit error ratio (BER) performance of the NB-QC-LDPC code by using the Log-Fourier Sum and Product decoding algorithm (LFSPA). The numerical results show that the NB-QC-LDPC code with code length 500 can provide approximately 5.5dB coding gain at the BER of 910- and outperform QC-LDPC code by 0.7dB.
Low-density parity-check code (LDPC) not only has good performance approaching the Shannon limit, but also has low decoding complexity and flexible structure. It is a research hot-spot in the field of channel coding in recent years and has a wide range of application prospects in optical communication systems. In this paper, the decoding aspects and performance of LDPC codes are analyzed and compared according to the bit error rate (BER) of LDPC codes. The computer simulation was carried out under additive white Gaussian noise (AWGN) channel and binary phase shift keying (BPSK) modulation. Through theoretical analysis and simulation results, this paper explores the way of multi-rate LDPC decoding.
Low-density parity check (LDPC) codes are known to perform well in the presence of additive white Gaussian noise (AWGN) but for very large block lengths. It has been proposed to define the codes over high order Galois fields to overcome this limitation. In this paper we construct new quasi-cyclic non-binary LDPC codes with moderate code lengths from Reed-Solomon codes with two message symbols proposed by Lin et al defined over large finite fields. We evaluate the performance of these codes on the AWGN channel by computer simulation and show that they outperform binary LDPC codes of the same length in binary bits.
The parity-check matrix of a nonbinary (NB) low-density parity-check (LDPC) code over Galois field GF(q) is constructed by assigning nonzero elements from GF(q) to the 1s in corresponding binary LDPC code. In this paper, we state and prove a theorem that establishes a necessary and sufficient condition that an NB matrix over GF(q), constructed by assigning nonzero elements from GF(q) to the 1s in the parity-check matrix of a binary quasi-cyclic (QC) LDPC code, must satisfy in order for its null-space to define a nonbinary QC-LDPC (NB-QC-LDPC) code. We also provide a general scheme for constructing NB-QC-LDPC codes along with some other code construction schemes targeting different goals, e.g., a scheme that can be used to construct codes for which the fast-Fourier-transform-based decoding algorithm does not contain any intermediary permutation blocks between bit node processing and check node processing steps. Via Monte Carlo simulations, we demonstrate that NB-QC-LDPC codes can achieve a net effective coding gain of 10.8 dB at an output bit error rate of 10-12. Due to their structural properties that can be exploited during encoding/decoding and impressive error rate performance, NB-QC-LDPC codes are strong candidates for application in optical communications.
This paper extends the work on density evolution for binary low-density parity-check (LDPC) codes with Gaussian approximation to LDPC codes over GF(q) . We first generalize the definition of channel symmetry for nonbinary inputs to include q-ary phase-shift keying (PSK) modulated channels for prime q and binary-modulated channels for q that is a power of 2. For the well-defined q-ary-input symmetric-output channel, we prove that under the Gaussian assumption, the density distribution for messages undergoing decoding is fully characterized by (q-1) quantities. Assuming uniform edge weights, we further show that the density of messages computed by the check node decoder (CND) is fully defined by a single number. We then present the approximate density evolution for regular and irregular LDPC codes, and show that the (q-1) -dimensional integration involved can be simplified using a dimensionality reduction algorithm for the important case of q=2p. Through application of approximate density evolution and linear programming, we optimize the degree distribution of LDPC codes over GF(3) and GF(4). The optimized irregular LDPC codes demonstrate performance close to the Shannon capacity for long codewords. We also design GF(q) codes for high-order modulation by using the idea of a channel adapter. We find that codes designed in this fashion outperform those optimized specifically for the binary additive white Gaussian noise (AWGN) channel for a short codewords and a spectral efficiency of 2 bits per channel use (b/cu).
We discuss three structures of modified low-density parity-check (LDPC) code ensembles designed for transmission over arbitrary discrete memoryless channels. The first structure is based on the well-known binary LDPC codes following constructions proposed by Gallager and McEliece, the second is based on LDPC codes of arbitrary (q-ary) alphabets employing modulo-q addition, as presented by Gallager, and the third is based on LDPC codes defined over the field GF(q). All structures are obtained by applying a quantization mapping on a coset LDPC ensemble. We present tools for the analysis of nonbinary codes and show that all configurations, under maximum-likelihood (ML) decoding, are capable of reliable communication at rates arbitrarily close to the capacity of any discrete memoryless channel. We discuss practical iterative decoding of our structures and present simulation results for the additive white Gaussian noise (AWGN) channel confirming the effectiveness of the codes.