© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Journal of Lightwave Technology

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

Murat Arabaci, Ivan B. Djordjević, Ross Saunders, Roberto M. Marcoccia

Published Aug 7, 2009• 42 citations

Abstract

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.

DOI: 10.1109/jlt.2009.2029062

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

A method for constructing parity-check matrices of non-binary quasi-cyclic LDPC codes

Stanislav Kruglik, Valeriya Potapova, Alexey Frolov

An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). Firstly the algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of the algorithm is demonstrated by means of simulations. In particular, it was shown that NB QC-LDPC codes constructed with use of our algorithm loose less that 0.1 dB in comparison to the best NB LDPC codes.

arXiv:1705.10717•May 30, 2017•0 citations

A novel construction method of quasi-cyclic non-binary LDPC codes in optical communication

Huang Shen

This paper presents a construction method of quasi-cyclic non-binary low density parity-check(NB-LDPC)code based on the finite field three-dimensional construction.After construction of base matrix based on the finite field,a cyclic matrix is constructed with the method of three-dimensional extension.Finally,non-binary parity check matrix with quasi-cyclic feature is constructed.Compared with the GF(29)-based RS(511,305)and NB-LDPC code constructed by the three-dimensional construction can increase 3.3dB net code gain(NCG)at the bit error rate(BER)of 10-7.Compared with the binary QC-LDPC codes constructed by the traditional way,the binary LDPC codes randomly constructed,the32-ary QC-LDPC codes constructed based on finite fields and the 64-ary cyclic LDPC codes constructed based on Euclidean geometry,the NB-LDPC code constructed by the three-dimensional construction can increase 0.56dB,0.56dB,0.03dB and 0.83dB NCGrespectively at the BERof 10-7.Through performance simulation of the NB-LDPC code constructed based on this three-dimensional construction,it shows that such an NB-LDPC code not only has quasi-cyclic feature,conducive to hardware implementation,but also shows better error correction performance in the short code length.

Journal of Optoelectronics·laser•Jan 1, 2014•0 citations

A Method for Constructing Parity-Check Matrices of Quasi-Cyclic LDPC Codes Over GF(q)

Stanislav Kruglik, Valeriya Potapova, Alexey Frolov

Abstract An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). The algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of the algorithm is demonstrated by means of simulations. In order to explain the simulation results we also derive upper bounds on the minimum distance of NB QC-LDPC codes.

Journal of Communications Technology and Electronics•Dec 1, 2018•2 citations

Construction of Structured Nonbinary Low-Density Parity-Check Codes

Wojciech Sułek

Low Density Parity Check (LDPC) codes over nonbinary Galois Fields GF(q) are a generalization of the industrial standard binary LDPC codes for forward error correction in communication and information systems.The nonbinary codes can achieve significantly better performance for short and moderate block lengths.A lot of works concerning "good" LDPC codes parity check matrix construction has been published so far.However, it is well known that efficient partially parallel hardware decoder architectures are allowed only for codes with blockwise partitioned structure of the parity check matrix, called structured codes.In this paper we present a versatile algorithm for construction of codes that are both nonbinary and structured.The proposed algorithm aims at optimizing the code graph (Tanner graph) by reducing the existence of small cycles with low external connectivity, while at the same time selecting appropriate nonzero coefficients from the Galois Field under interest.The algorithm can be used for code construction of any field order, block length and code rate.

International Journal of e-Education e-Business e-Management and e-Learning•Jan 1, 2013•0 citations

The design of structured LDPC codes with algorithmic graph construction

Wojciech Sułek

Low-Density Parity-Check (LDPC) codes are among the most effective modern error-correcting codes due to their excellent correction performance and highly parallel decoding scheme. Moreover, the nonbinary extension of such codes further increases performance in the short-block regime. In this paper, we review the key elements for the construction of implementation-oriented binary and nonbinary codes. These Quasi-Cyclic LDPC (QC-LDPC) codes additionally feature efficient encoder and decoder implementation frameworks. We then present a versatile algorithm for the construction of both binary and nonbinary QC-LDPC codes that have low encoding complexity and an optimized corresponding graph structure. Our algorithm uses a progressive edge growth algorithm, modified for QC-LDPC graph construction, and then performs an iterative global search for optimized cyclic shift values within the QC-LDPC circulants. Strong error correction performance is achieved by minimizing the number of short cycles, and cycles with low external connectivity, within the code graph. We validate this approach via error rate simulations of a transmission system model featuring an LDPC coder-decoder, digital modulation, and additive white Gaussian noise channels. The obtained numerical results validate the effectiveness of the proposed construction algorithm, with a number of constructed codes exhibiting either similar or superior performance to industry standard binary codes and selected nonbinary codes from the literature.

Bulletin of the Polish Academy of Sciences Technical Sciences•May 30, 2022•0 citations

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.

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.

An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). Firstly the algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of the algorithm is demonstrated by means of simulations. In particular, it was shown that NB QC-LDPC codes constructed with use of our algorithm loose less that 0.1 dB in comparison to the best NB LDPC codes.

This paper presents a construction method of quasi-cyclic non-binary low density parity-check(NB-LDPC)code based on the finite field three-dimensional construction.After construction of base matrix based on the finite field,a cyclic matrix is constructed with the method of three-dimensional extension.Finally,non-binary parity check matrix with quasi-cyclic feature is constructed.Compared with the GF(29)-based RS(511,305)and NB-LDPC code constructed by the three-dimensional construction can increase 3.3dB net code gain(NCG)at the bit error rate(BER)of 10-7.Compared with the binary QC-LDPC codes constructed by the traditional way,the binary LDPC codes randomly constructed,the32-ary QC-LDPC codes constructed based on finite fields and the 64-ary cyclic LDPC codes constructed based on Euclidean geometry,the NB-LDPC code constructed by the three-dimensional construction can increase 0.56dB,0.56dB,0.03dB and 0.83dB NCGrespectively at the BERof 10-7.Through performance simulation of the NB-LDPC code constructed based on this three-dimensional construction,it shows that such an NB-LDPC code not only has quasi-cyclic feature,conducive to hardware implementation,but also shows better error correction performance in the short code length.

Abstract An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). The algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of the algorithm is demonstrated by means of simulations. In order to explain the simulation results we also derive upper bounds on the minimum distance of NB QC-LDPC codes.

Low Density Parity Check (LDPC) codes over nonbinary Galois Fields GF(q) are a generalization of the industrial standard binary LDPC codes for forward error correction in communication and information systems.The nonbinary codes can achieve significantly better performance for short and moderate block lengths.A lot of works concerning "good" LDPC codes parity check matrix construction has been published so far.However, it is well known that efficient partially parallel hardware decoder architectures are allowed only for codes with blockwise partitioned structure of the parity check matrix, called structured codes.In this paper we present a versatile algorithm for construction of codes that are both nonbinary and structured.The proposed algorithm aims at optimizing the code graph (Tanner graph) by reducing the existence of small cycles with low external connectivity, while at the same time selecting appropriate nonzero coefficients from the Galois Field under interest.The algorithm can be used for code construction of any field order, block length and code rate.

Low-Density Parity-Check (LDPC) codes are among the most effective modern error-correcting codes due to their excellent correction performance and highly parallel decoding scheme. Moreover, the nonbinary extension of such codes further increases performance in the short-block regime. In this paper, we review the key elements for the construction of implementation-oriented binary and nonbinary codes. These Quasi-Cyclic LDPC (QC-LDPC) codes additionally feature efficient encoder and decoder implementation frameworks. We then present a versatile algorithm for the construction of both binary and nonbinary QC-LDPC codes that have low encoding complexity and an optimized corresponding graph structure. Our algorithm uses a progressive edge growth algorithm, modified for QC-LDPC graph construction, and then performs an iterative global search for optimized cyclic shift values within the QC-LDPC circulants. Strong error correction performance is achieved by minimizing the number of short cycles, and cycles with low external connectivity, within the code graph. We validate this approach via error rate simulations of a transmission system model featuring an LDPC coder-decoder, digital modulation, and additive white Gaussian noise channels. The obtained numerical results validate the effectiveness of the proposed construction algorithm, with a number of constructed codes exhibiting either similar or superior performance to industry standard binary codes and selected nonbinary codes from the literature.