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

IEEE Transactions on Communications

Large-Girth Nonbinary QC-LDPC Codes of Various Lengths

Jie Huang, Lei Liu, Wuyang Zhou, Shengli Zhou

Published Oct 27, 2010• 37 citations
Publisher

Abstract

In this paper, we construct nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes whose parity check matrices consist of an array of square sub-matrices which are either zero matrices or circulant permutation matrices. We propose a novel method to design the shift offset values of the circulant permutation sub-matrices, so that the code length can vary while maintaining a large girth. Extensive Monte Carlo simulations demonstrate that the obtained codes of a wide range of rates (from 1/2 to 8/9) with length from 1000 to 10000 bits have very good performance over both AWGN and Rayleigh fading channels. Furthermore, the proposed method is extended to design multiple nonbinary QC-LDPC codes simultaneously where each individual code can achieve large girth with variable lengths. The proposed codes are appealing to practical adaptive systems where the block length and code rate need to be adaptively adjusted depending on traffic characteristics and channel conditions.

DOI
10.1109/tcomm.2010.101210.090757

Related papers

The Essential Conditions of Quasi-cyclic LDPC Codes without Girth 4

Yang Xiao

The essential conditions for quasi-cyclic low-density parity-check codes(QC-LDPC codes) to have no Girth 4 are given.This solves the problem of designing without-girth-4 QC-LDPC codes of any length.Adjusting the dimension and shift factors of the circulant sub-matrices of the given sparse parity-check matrices according to the proposed theorems,the QC-LDPC codes without girth 4 are constructed.The matrice equation set for girth 4 check is established.Through setting the dimension and shift factors of the circulant sub-matrices,we can check whether the QC-LDPC codes have Girth 4 or not.We can multiply the dimension of the circulant sub-matrices to get the QC-LDPC codes without Girth 4 of different lengths.Our theorems keep the QC-LDPC codes without Girth 4 along with increasing of the code length.Compared to the previous algorithms,the proposed test algorithm decreases computation,shortens the test time and reduces the complexity of structuring the parity-check matrix.Experimental results indicate that the designed QC-LDPC codes achieve good bit error rate(BER) performance.

Journal of the China Railway Society•Jan 1, 2009•0 citations

Design of good quasi-cyclic LDPC codes

Xu Dan

The existing design of quasi-cyclic(QC) low-density parity-check(LDPC) codes has not considered the problems of short length girths and the rows' dependency.The first problem leads to the BER performance of QC LDPC codes to be much poorer than that of randomly constructed LDPC codes,while the second problem leads to the difficulty of construction of generator matrices from parity-check matrices.To solve the first problem,the constraint conditions for designing the QC LDPC codes are proposed,and the dimension and shift factors of the circulant matrices of the given sparse parity-check matrix are adjusted according to the test results of both girth 4 and girth 6.To solve the second problem,an approach of irregular QC LDPC codes is proposed.The proposed approach is to replace some sub-matrices by zero matrices and identity matrices at special positions in the given sparse parity-check matrix so as to get a nonsingular square matrix for the construction of the generator matrix.Though adopting bidiagonal submatrices in parity-check matrix can solve the rows' dependency problem,many code words with low weights will occur,which leads to the BER performance can not be better by increasing code lengths.Examples are provided for the proposed design of QC LDPC codes,and computer simulation results show that the proposed QC LDPC codes achieve good BER performance.

Systems engineering and electronics•Jan 1, 2009•1 citation

Quasi-Cyclic Low-Density Parity-Check Codes Based on Progressive Cycle Growth Algorithm

Yuanhua Liu, Meiling Zhang, Niu Xin-Liang

Short cycles in the Tanner graph of a given LDPC code has negative effect on the performance of iterative decoding. To improve the performance, we presented an approach for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes whose associated Tanner graph has large girth and a small amount of short cycles. Each column block of the parity check matrix was designed by adding circulant permutation sub-matrices one after another, provided the current parity check matrix has minimal number of short cycles. The condition for the proposed QC-LDPC codes to have girth at least 6 was also analyzed. Regular and irregular QC-LDPC codes with various lengths and rates can be constructed. Simulations show that the proposed QC-LDPC codes have less short cycles and better performance than existing progressive edge growth based QC-LDPC codes.

International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)•Jul 1, 2016•1 citation

Construction of Nonbinary LDPC Codes Based on BIBD Circulant Permutation Matrices

Jun Gao

The algebraic method for constructing nonbinary quasi-cyclic(QC) low-density parity-check(LDPC) codes based on balanced incomplete block designs(BIBD) is presented.The generalized nonbinary location vector is proposed on constructions.A nonbinary matrix,which consists of nonbinary circulant submatrices,is formed by generalized two-dimensional matrix dispersion considering the generalized nonbinary location vector and BIBD method.The codes constructed by this method have girths at least 6.Experimental results show that significant coding gains are achieved over Reed-Solomon codes of the same parameters under the Additive White Gaussian Noise(AWGN) channel with iterative decoding Fast Fourier Transform based q-ary Sum-Product Algorithm(FFT-QSPA).And a good performance is also achieved over nonbinary Mackay LDPC codes with almost the same conditions.

Telecommunication Engineering•Jan 1, 2011•0 citations

Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes

Alireza Tasdighi, Amir H. Banihashemi, Mohammad‐Reza Sadeghi

In this paper, we propose new constructions for regular girth-8 quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices (CPM). The constructions assume symmetries in the structure of the parity-check matrix and employ a greedy exhaustive search algorithm to find the permutation shifts of the CPMs. As a result of symmetries, the new codes have a more compact representation compared with their counterparts. In majority of cases, also, they achieve the girth 8 at a shorter block length for the same degree distribution (code rate). Deterministic (explicit) constructions are also presented to expand the proposed parity-check matrices to larger block lengths and higher rates. The proposed long high-rate codes are often substantially shorter than regular girth-8 QC-LDPC codes of similar rate in the literature. Simulation results demonstrate that the proposed symmetric codes have competitive performance in comparison with similar existing QC-LDPC codes that lack symmetry.

IEEE Transactions on Communications•Jan 1, 2016•66 citations

QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns

Mohammad Hesam Tadayon, Mohammad Mohammadi

In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the associated Tanner graph is free of cycle four. Each circulant matrix in H is made by a generator column. The generator columns should be selected in a way that each associated circulant matrix and every two distinct circulant matrices are free of cycle four. The generator columns are made by row distance sets. An algorithm for generating distance sets and obtaining circulant matrices with columns of weight three is presented separately. Simplicity of construction and having a good flexible family of quasi cyclic LDPC codes both in rate and length are the main properties of the proposed method. The performance of the proposed codes is compared with that of the random-like and Array LDPC codes over an AWGN channel. Simulation results show that from the performance perspective, the constructed codes are competitive with random-like and Array LDPC codes.

International Journal of Information & Communication Technology Research•Jun 15, 2016•0 citations
In this paper, we construct nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes whose parity check matrices consist of an array of square sub-matrices which are either zero matrices or circulant permutation matrices. We propose a novel method to design the shift offset values of the circulant permutation sub-matrices, so that the code length can vary while maintaining a large girth. Extensive Monte Carlo simulations demonstrate that the obtained codes of a wide range of rates (from 1/2 to 8/9) with length from 1000 to 10000 bits have very good performance over both AWGN and Rayleigh fading channels. Furthermore, the proposed method is extended to design multiple nonbinary QC-LDPC codes simultaneously where each individual code can achieve large girth with variable lengths. The proposed codes are appealing to practical adaptive systems where the block length and code rate need to be adaptively adjusted depending on traffic characteristics and channel conditions.
The essential conditions for quasi-cyclic low-density parity-check codes(QC-LDPC codes) to have no Girth 4 are given.This solves the problem of designing without-girth-4 QC-LDPC codes of any length.Adjusting the dimension and shift factors of the circulant sub-matrices of the given sparse parity-check matrices according to the proposed theorems,the QC-LDPC codes without girth 4 are constructed.The matrice equation set for girth 4 check is established.Through setting the dimension and shift factors of the circulant sub-matrices,we can check whether the QC-LDPC codes have Girth 4 or not.We can multiply the dimension of the circulant sub-matrices to get the QC-LDPC codes without Girth 4 of different lengths.Our theorems keep the QC-LDPC codes without Girth 4 along with increasing of the code length.Compared to the previous algorithms,the proposed test algorithm decreases computation,shortens the test time and reduces the complexity of structuring the parity-check matrix.Experimental results indicate that the designed QC-LDPC codes achieve good bit error rate(BER) performance.
The existing design of quasi-cyclic(QC) low-density parity-check(LDPC) codes has not considered the problems of short length girths and the rows' dependency.The first problem leads to the BER performance of QC LDPC codes to be much poorer than that of randomly constructed LDPC codes,while the second problem leads to the difficulty of construction of generator matrices from parity-check matrices.To solve the first problem,the constraint conditions for designing the QC LDPC codes are proposed,and the dimension and shift factors of the circulant matrices of the given sparse parity-check matrix are adjusted according to the test results of both girth 4 and girth 6.To solve the second problem,an approach of irregular QC LDPC codes is proposed.The proposed approach is to replace some sub-matrices by zero matrices and identity matrices at special positions in the given sparse parity-check matrix so as to get a nonsingular square matrix for the construction of the generator matrix.Though adopting bidiagonal submatrices in parity-check matrix can solve the rows' dependency problem,many code words with low weights will occur,which leads to the BER performance can not be better by increasing code lengths.Examples are provided for the proposed design of QC LDPC codes,and computer simulation results show that the proposed QC LDPC codes achieve good BER performance.
Short cycles in the Tanner graph of a given LDPC code has negative effect on the performance of iterative decoding. To improve the performance, we presented an approach for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes whose associated Tanner graph has large girth and a small amount of short cycles. Each column block of the parity check matrix was designed by adding circulant permutation sub-matrices one after another, provided the current parity check matrix has minimal number of short cycles. The condition for the proposed QC-LDPC codes to have girth at least 6 was also analyzed. Regular and irregular QC-LDPC codes with various lengths and rates can be constructed. Simulations show that the proposed QC-LDPC codes have less short cycles and better performance than existing progressive edge growth based QC-LDPC codes.
The algebraic method for constructing nonbinary quasi-cyclic(QC) low-density parity-check(LDPC) codes based on balanced incomplete block designs(BIBD) is presented.The generalized nonbinary location vector is proposed on constructions.A nonbinary matrix,which consists of nonbinary circulant submatrices,is formed by generalized two-dimensional matrix dispersion considering the generalized nonbinary location vector and BIBD method.The codes constructed by this method have girths at least 6.Experimental results show that significant coding gains are achieved over Reed-Solomon codes of the same parameters under the Additive White Gaussian Noise(AWGN) channel with iterative decoding Fast Fourier Transform based q-ary Sum-Product Algorithm(FFT-QSPA).And a good performance is also achieved over nonbinary Mackay LDPC codes with almost the same conditions.
In this paper, we propose new constructions for regular girth-8 quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices (CPM). The constructions assume symmetries in the structure of the parity-check matrix and employ a greedy exhaustive search algorithm to find the permutation shifts of the CPMs. As a result of symmetries, the new codes have a more compact representation compared with their counterparts. In majority of cases, also, they achieve the girth 8 at a shorter block length for the same degree distribution (code rate). Deterministic (explicit) constructions are also presented to expand the proposed parity-check matrices to larger block lengths and higher rates. The proposed long high-rate codes are often substantially shorter than regular girth-8 QC-LDPC codes of similar rate in the literature. Simulation results demonstrate that the proposed symmetric codes have competitive performance in comparison with similar existing QC-LDPC codes that lack symmetry.
In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the associated Tanner graph is free of cycle four. Each circulant matrix in H is made by a generator column. The generator columns should be selected in a way that each associated circulant matrix and every two distinct circulant matrices are free of cycle four. The generator columns are made by row distance sets. An algorithm for generating distance sets and obtaining circulant matrices with columns of weight three is presented separately. Simplicity of construction and having a good flexible family of quasi cyclic LDPC codes both in rate and length are the main properties of the proposed method. The performance of the proposed codes is compared with that of the random-like and Array LDPC codes over an AWGN channel. Simulation results show that from the performance perspective, the constructed codes are competitive with random-like and Array LDPC codes.