IEICE Transactions on Communications

The Necessary and Sufficient Condition of a Class of Quasi-Cyclic LDPC Codes without Girth Four

Ying Zhao, Yang Xiao

Published Jan 1, 2009• 8 citations

Abstract

This letter presents a necessary and sufficient condition for a class of quasi-cyclic low-density parity-check (QC LDPC) codes without girth four. Girth-four property of a class of QC LDPC codes is investigated. Good QC LDPC codes without girth four can be constructed by selecting proper shifting factors according to the proposed theorems. Examples are provided to verify the theorems. The simulation results show that the QC LDPC codes without girth four achieve a better BER performance compared with that of randomly constructed LDPC codes.

DOI: 10.1587/transcom.e92.b.306

Related papers

Necessary and sufficient condition for Tanner codes without girth 4

Yang Xiao

To solve the problem of the girth 4 which will lead to a serious decrease in the performance of quasi-cyclic low-density parity-check(QC LDPC) codes,this paper presents the necessary and sufficient conditions of Tanner codes without girth 4 in the form of several theorems.These theorems can be used as the constraint conditions for the construction of Tanner codes.To construct the Tanner codes without girth 4 needs to adjust the dimension and the shift factors of the circulant matrices of the given sparse parity-check matrices according to the proposed theorems.Examples are provided to verify the theorems,and computer simulation results show that the Tanner codes obtained by proposed constructions achieve good BER performance compared with that of randomly constructed LDPC codes.

Systems engineering and electronicsJan 1, 20091 citation

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 SocietyJan 1, 20090 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 electronicsJan 1, 20091 citation

Necessary conditions for quasi-cyclic LDPC codes to have a given girth

Kyung-Joong Kim, Jin-Ho Chung, Kyeongcheol Yang

Short cycles in the Tanner graph of a low-density parity-check (LDPC) code may cause a severe performance degradation. In this paper, we investigate the cycle properties of quasi-cyclic LDPC (QC-LDPC) codes. We first analyze a necessary and sufficient condition for a cycle of a given length to exist, by using the sequence representation of a parity-check matrix for a QC-LDPC code. We then derive bounds which are necessary conditions for a QC-LDPC code to have a given girth in terms of its parameters. Our necessary conditions are applicable to any regular or irregular QC-LDPC codes as well as they improve the existing bounds for many classes of regular QC-LDPC codes.

IEEE International Symposium on Information Theory (ISIT)Jul 1, 20130 citations

Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes

Kyung-Joong Kim, Jin-Ho Chung, Kyeongcheol Yang

In this paper, we investigate the cycle properties of quasi-cyclic low-density parity-check (QC-LDPC) codes. Using the sequence representation of a parity-check matrix for a QC-LDPC code, we analyze a necessary and sufficient condition for a cycle of a given length to exist. We then derive bounds which are necessary conditions for a QC-LDPC code to have a given girth in terms of its parameters. We also give a bound which is a sufficient condition for a QC-LDPC code of a given girth to be constructed by a greedy algorithm. The bounds derived here are applicable to any regular or irregular QC-LDPC codes as well as they improve the existing bounds in many classes of regular LDPC codes.

IEEE Transactions on Information TheoryAug 28, 201315 citations

Constructions of Type-II QC-LDPC Codes With Girth Eight from Sidon Sequence

Guohua Zhang, Yulin Hu, Yi Fang +1 more

In this paper, we consider the constructions of type-II quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight from a Sidon sequence. We first derive the necessary and sufficient conditions guaranteeing a girth-eight type-II QC-LDPC code. By combining these conditions with the concept of the Sidon sequence, three classes of type-II QC-LDPC codes are subsequently proposed with girth eight. To the best of our knowledge, the second and the third classes we proposed are the first series of systematic and algebraic constructions for the girth-eight type-II QC-LDPC codes that have rates being greater than a half and, at the same time, have distance upper bounds being not limited to 12. Via simulations, we show the promising performance of the proposed type-II QC-LDPC codes with girth eight. In addition, a set of general bounds and explicit/random constructions without using a Sidon sequence are also presented for the type-II QC-LDPC codes with girth six or eight. We observe that the proposed codes perform better than or equally well as the random QC-LDPC codes from PEG and quadr.-congr. methods, while the novel codes possess both highly structured parity-check matrices and very flexible choices in circulant size.

IEEE Transactions on CommunicationsFeb 25, 201922 citations