IEEE Communications Letters

Construction of quasi-cyclic LDPC codes based on a two-dimensional MDS code

Chao Chen, Baoming Bai, Xinmei Wang

Published May 1, 2010• 4 citations

Abstract

In this letter, we first propose a general framework for constructing quasi-cyclic low-density parity-check (QCLDPC) codes based on a two-dimensional (2-D) maximum distance separable (MDS) code. Two classes of QC-LDPC codes are defined, whose parity-check matrices are transposes of each other. We then use a 2-D generalized Reed-Solomon (GRS) code to give a concrete construction. The decoding parity-check matrices have a large number of redundant parity-check equations while their Tanner graphs have a girth of at least 6. The minimum distances of the codes are very respectable. Experimental studies show that the constructed QC-LDPC codes perform well with the sum-product algorithm (SPA).

DOI: 10.1109/lcomm.2010.05.100008

Related papers

Two-dimensional generalized Reed-Solomon codes: A unified framework for quasi-cyclic LDPC codes constructed based on finite fields

Chao Chen, Baoming Bai, Xinmei Wang

In this paper, we first propose a general framework for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on a two-dimensional (2-D) maximum distance separable (MDS) code. Two classes of QC-LDPC codes are defined, whose parity-check matrices are transposes of each other. We then use a 2-D generalized Reed-Solomon (GRS) code to give a concrete construction. The decoding parity-check matrices have a large number of redundant parity-check equations while their Tanner graphs have a girth of at least 6. The minimum distances of the codes are very respectable as far as LDPC codes are concerned. We further show that many existing constructions of QC-LDPC codes based on finite fields in the literature can be unified under this construction. Experimental studies show that the constructed QC-LDPC codes perform well with the sum-product algorithm (SPA).

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20103 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 CommunicationsJan 1, 20120 citations

Efficiently Encodable Irregular QC-LDPC Codes Constructed from Self-Reciprocal Generator Polynomials of MDS Codes

Norifumi Kamiya

This letter presents a class of quasi-cyclic (QC) low-density parity-check (LDPC) codes which are efficiently encodable and have better memory efficiency than other randomly constructed QC-LDPC codes. The parity-check matrix of the codes is obtained from a block circulant matrix that is generated from a self-reciprocal generator polynomial of a maximum distance separable (MDS) code by replacing some of its block entries by all zero matrices. We show by simulations that the codes can achieve excellent error performance.

IEEE Communications LettersAug 27, 20106 citations

Construction of Reed-Solomon Based Quasi-Cyclic LDPC Codes Based on Protograph

Inseon Kim, Hong‐Yeop Song

In this paper, we propose construction of Reed-Solomon(RS) based Quasi-Cyclic Low-Density Parity-Check(QC-LDPC) codes using protograph combining two existing QC-LDPC codes construction. One is the construction RS based QC-LDPC codes whose girth is at least 8 and another is protograph based QC-LDPC codes to increase the upper bounds of minimum Hamming distance. We construct the protographs to increase the upper bound of minimum Hamming distance for Proto-RS-QC-LDPC codes and simulate some experiment to show coding gain in sense of BER compare to existing QC-LDPC codes.

Asia-Pacific Conference on Communications (APCC)Nov 1, 20183 citations

High-rate quasi-cyclic low-density parity-check codes derived from finite affine planes

Norifumi Kamiya

This paper shows that several attractive classes of quasi-cyclic (QC) low-density parity-check (LDPC) codes can be obtained from affine planes over finite fields. One class of these consists of duals of one-generator QC codes. Here, for codes contained in this class, the exact minimum-distance and a lower bound on the multiplicity of the minimum-weight codewords are presented. It is shown that the lower bound on the multiplicity provides a very accurate indication of the bit error performance at moderate and high signal-to-noise ratios, and thus error-floor behavior can be easily predicted. Also discussed is a class consisting of codes from circulant permutation matrices. An explicit formula for the rank of the parity-check matrix is presented for these codes. Furthermore, it is shown that each of these codes can be identified as a code constructed from a constacyclic maximum distance separable (MDS) code in a similar manner to the RS-based LDPC codes presented by Chen et al. and Djurdjevic et al. Experimental results show that a number of high rate QC-LDPC codes with excellent error performance are contained in these classes

IEEE International Symposium on Information Theory (ISIT)Jan 1, 20051 citation

Construction of QC-LDPC codes based on generalized RS codes with girth larger than 6

Rong Xia Sun, Yu Min Tian, Jingwei Liu

In this paper, an approach for constructing Quasi-cyclic(QC)-LDPC codes with girth larger than 6 based on Generalized Reed-Solomon(GRS) codes is presented. The proposed construction method in conjunction with masking, results in codes whose Tanner graphs have girth 8 or even larger. Experimental results show that, with iterative decoding algorithms, the constructed QC-LDPC codes perform well.

IEEE International Conference on Communication Systems (ICCS)Dec 1, 20168 citations