International Congress on Image and Signal Processing (CISP)

Design of Low-Complexity Well-Structured LDPC Codes Based on Iterative-Filled Approach

Wei Zhang, Guangxi Zhu, Li Peng, Qiongxia Shen

Published Jan 1, 2008• 0 citations

Abstract

Low density parity check codes are a popular class of linear block codes for forward error correction in communication channels. Recent years have seen a lot of work towards the hardware-oriented constructions for LDPC codes which have comparable error-correcting performance to random construction codes. This paper proposes a novel method called Iterative-filled (IF) to construct LDPC codes and a new kind of LDPC codes named IF-LDPC codes. Based on the properties of the method proved in this paper, we present a design of regular and quasi-regular IF-LDPC encoders which have linear encoding complexity, simple construction, low memory requirement and are suitable for partly parallel decoding. These advantages make them easy to hardware implementation. The IF-LDPC codes exhibit good performance in computer simulations and some even better than MacKay codes.

DOI: 10.1109/cisp.2008.511

Related papers

The Design of Structured Low-Density Parity-Check Codes With Large Girth

Jing Long

This paper,based on algebra and graph,proposes a method for constructing structured low-density parity-check(LDPC) codes.In this method,the authors design a connected graph with three kinds of special path to ensure that the Tanner graph of the parity check matrix mapped from the connected graph is without short cycles.The construction method results in two classes of(3,k)-regular quasi-cyclic LDPC codes with girth 8 and 12 respectively.Furthermore,by extending this construction method,two classes of LDPC codes with column weight 2,whose girths are respectively 16 and 24,can be obtained.The simulation studies show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels with iterative decoding.At the BER of 10-5,the new proposed(3,6)-regular(4356,2205) QC-LDPC code performs 1.48dB from the Shannon limit.Moreover,it outperforms the random regular LDPC code of comparable parameters by 0.1dB.For the new proposed structured LDPC codes with column weight 2,they can achieve about 2dB coding gains with respect to the random regular LDPC codes with similar block lengths and code rates.

Chinese Journal of ComputersJan 1, 20071 citation

Construction of the cyclic block-type LDPC codes for low complexity hardware implementation

Kuang-Hao Lin, KyungHi Chang, Chien‐Lin Huang +1 more

In this paper, we construct the cyclic block-type low-density parity-check (CB-LDPC) codes for low complexity hardware implementation. The CB-LDPC code, which is a special class of quasi-cyclic LDPC (QC-LDPC), has an efficient encoding algorithm due to the simple structure of their parity-check matrices. A distribution of irregular parity-check matrix for the CB-LDPC is developed so that we can obtain an area-efficient decoder design, good error correction performance, and low complexity architecture implementation. The CB-LDPC code decoding uses the iterative min-sum algorithm (MSA) and the block parallel connection design to improve the hardware architecture complexity and area.

IEEE International Conference on Electronics, Circuits and Systems (ICECS)Aug 1, 20082 citations

Construction of irregular LDPC codes based on Balanced Incomplete Block Designs

Siddarama R. Patil, Sant Saran Pathak

In this paper, we present a method to design irregular structured low-density parity-check (LDPC) codes based on balanced incomplete block designs (BIBD). The problem of designing irregular structured LDPC codes that have good overall error performance for a wide range of code rates and block sizes with attractive storage requirements is attempted. The proposed codes are well structured and unlike random codes can lend themselves to a very low-complexity implementation. The codes constructed by this method have the girth at least 6 and they perform well with the sum-product iterative decoding algorithm. Furthermore, the codes are compared with known random LDPC codes, in order to assess their relative achievable performance. The proposed LDPC codes demonstrate performance that is better than an average random LDPC code of similar block length, code rate and parity check matrix sparsity.

IEEE International Conference on Industrial and Information Systems (ICIIS)Jan 1, 20070 citations

Regular LDPC Code Construction and Partly Parallel Decoder Design

Xizheng Zhang

Recently,LDPC(Low Density Parity Check) codes have attracted a lot of attention.However,because of the lack of efficient decoder hardware design approaches,the real-world applications of LDPC codes are limited.In this paper,it presents a joint code and decoder design approach to construct a class of(j,k) regular LDPC codes that not only have good error-correcting performance but also have high-speed partly parallel decoder.

Journal of Hunan Institute of EngineeringJan 1, 20070 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

Design and performance evaluation of low complexity encoding methods for LDPC codes

Ambar Bajpai, Lunchakorn Wuttisittikulkij, Piya Kovintavewat

There is an important breakthrough in the field of forward error correction techniques, low-density parity-check (LDPC) codes. These codes have potential to approach the Shannon limit with reliable performance on a given channel, known as the channel capacity. Recently, researchers pay much more attention towards LDPC codes because its performance is better than Turbo codes. However, the LDPC code is the best when it is an irregular code and uses with a very large block-length. Although, the short block-length LDPC codes perform not so well, they are easy to implement in various practical applications. Therefore, there is still a demand of new development on the encoding side of LDPC codes for various ranges of code rate and code length so as to capable of using in many applications.This thesis proposes the development of quasi-cyclic (QC) LDPC codes for column weight 3. In the first part of this thesis, we propose a new construction algorithm of QC-LDPC codes for medium to large block-length by combining QC-LDPC codes of small block-length as their component codes, via Chinese remainder theorem (CRT). Such component codes were constructed by permuting each column block sequentially to attain the desire local girth. After combining all component codes to generate an expanded parity-check matrix, the resulting girth is greater than or at least equal to the maximum girth of the component codes. Simulation results show that our proposed construction method of the parity-check matrix significantly outperforms the other well-known existing methods in terms of low error-floor, simple structure, high performance, and can reduce encoding complexity.In addition, this thesis also proposes two new construction methods for QC-LDPC codes, namely a base matrix method and a subtraction based method. A base matrix based method is a simple, less computational complexity method for constructing the exponent matrix (3, K) of girth 8, 10 and 12 of QC-LDPC codes. Another method is a subtraction method, which has a similar exponent matrix as a base matrix method and has a girth at least 8. Results indicate that the LDPC codes constructed from these two methods have flexibility for arbitrary block-column length K and have a similar BER performance if compared to existing methods.

Jan 1, 20150 citations