International Conference on Computational Intelligence and Software Engineering (CiSE)

Design of Irregular Quasi-Cyclic LDPC Codes

Jintao Hu, Yongsheng Wang, Ding Wang, Jiadong Xu

Published Sep 1, 2010• 0 citations

Abstract

Abstract-In this paper, a novel methodology for design irregular quasi-cyclic LDPC codes is presented. The quasi-cyclic structure facilitates encoder and decoder implementation through shift-register-based circuits. The irregularity characteristic improves the code performance in waterfall region. The structure imposed on the bipartite graphs together with shifting matrix, Lead to a class of this code suitable for fast iterative decoding. The construction method results in a class of quasi-cyclic LDPC codes with girth of at least 6.The simulation results show, using the Sum Productive Decoder, this kinds of codes having excellent performance on the additive white Gaussian noise channels.

DOI: 10.1109/wicom.2010.5600227

Related papers

Quasi-cyclic generalized ldpc codes with low error floors

Gianluigi Liva, W.E. Ryan, Marco Chiani

In this paper, a novel methodology for designing structured generalized LDPC (G-LDPC) codes is presented. The proposed design results in quasi-cyclic G-LDPC codes for which efficient encoding is feasible through shift-register-based circuits. The structure imposed on the bipartite graphs, together with the choice of simple component codes, leads to a class of codes suitable for fast iterative decoding. A pragmatic approach to the construction of G-LDPC codes is proposed. The approach is based on the substitution of check nodes in the protograph of a low-density parity-check code with stronger nodes based, for instance, on Hamming codes. Such a design approach, which we call LDPC code doping, leads to low-rate quasi-cyclic G-LDPC codes with excellent performance in both the error floor and waterfall regions on the additive white Gaussian noise channel.

IEEE Transactions on CommunicationsJan 1, 2008136 citations

Quasi-Cyclic Generalized LDPC Codes With Low Error Floors

Gianluigi Liva, W.E. Ryan, Marco Chiani

In this paper, a novel methodology for designing structured generalized low-density parity-check (G-LDPC) codes is presented. The proposed design results in quasi-cyclic G-LDPC codes for which efficient encoding is feasible through shift-register-based circuits. The structure imposed on the bipartite graphs, together with the choice of simple component codes, leads to a class of codes suitable for fast iterative decoding. A pragmatic approach to the construction of G-LDPC codes is proposed. The approach is based on the substitution of check nodes in the protograph of a low-density parity-check code with stronger nodes based, for instance, on Hamming codes. Such a design approach, which we call low-density parity-check (LDPC) code doping, leads to low-rate quasi-cyclic G-LDPC codes with excellent performance in both the error floor and waterfall regions on the additive white Gaussian noise channel.

IEEE Transactions on CommunicationsDec 1, 20079 citations

A Novel Construction of QC-LDPC Codes Based on Combinatorial Mathematics

Peng Daqin, Zhu Shumin, Song Jing

In order to solve the problems of high coding complexity and inflexible code length selection in quasi-cyclic low-density Parity-check (QC-LDPC) codes, a deterministic structure is proposed based on the perfect cyclic difference sets. The number of shifts of base matrix can be obtained by a simple addition and subtraction. Because of the special structure of the base matrix and the perfect cyclic difference sets, it saves the storage space and reduces the complexity of the hardware implementation. The girth is at least six and the code-length and code-rate can be selected flexibly. Simulation results demonstrate that the Net Coding Gain of the irregular PCDS-QC-LDPC(2680, 1340) code based on perfect cyclic difference sets has respectively improved 0.13dB and 0.32dB than the code based on PEG-QC-LDPC(2680,1340) and array dispersion and masking AD-MASK-QC-LDPC(2680,1340) with the rate of 0.5 and the bit error rate of 10 -6 by using the sum-product algorithm iterative decoding in the additive white Gaussian channel.

Procedia Computer ScienceJan 1, 20183 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 SciencesMay 30, 20220 citations

Construction of Regular and Irregular LDPC Codes using (n, {k1, k2}, 1) Block Design

Siddarama R. Patil, Sant Saran Pathak

In this paper, we construct regular and irregular LDPC codes using (n, {k1,k2}, 1)block design. The problem of designing regular and irregular structured LDPC codes that have good overall error performance for wide range of code rates and block sizes with attractive storage requirements is attempted. The codes constructed by this method have the girth at least 6 and they perform well with the sum-product iterative decoding algorithm. Further we analyze the constructed codes based on number of short cycles of the corresponding Tanner graph. The analysis shows that codes having small number of short cycles and a cycle structure which is not overly regular in their Tanner graph perform better. The presented codes are well structured and unlike random codes can lend themselves to a very low-complexity encoder and decoder implementation.

International Conference on Signal Processing and Communications (SPCOM)Jan 1, 20070 citations

Design of quasi-cyclic Tanner codes with low error floors

Gianluigi Liva, W.E. Ryan, Marco Chiani

Tanner codes represent a broad class of graph-based coding schemes, including low-density parity-check (LDPC) and turbo codes. Whereas many different classes of LDPC and turbo codes have been proposed and studied in the past decade, very little work has been performed on the broader class of Tanner codes. In this paper we propose a design technique which leads to efficiently encodable quasi-cyclic Tanner codes based on both Hamming and single parity check (SPC) nodes. These codes are characterized by fast message-passing decoders and can be encoded using shift-register-based circuits. The resulting schemes exhibit excellent performance in both the error floor and waterfall regions on the additive white Gaussian noise channel. 1

Apr 3, 200617 citations