Journal of Changshu Institute of Technology

Irregular LDPC Code Based on Binary Sequence

Bing Wen

Published Jan 1, 2009• 0 citations

Abstract

A new and simple approach to constructed irregular low density parity check(LDPC) code based on the binary sequence was proposed.Experimental results show that constructed irregular LDPC code with iterative decoding performs well over the AWGN channel and has a good code weight distribution with 4-cycle free.

Related papers

Low-density parity-check code based on binary sequence splitting

Zhu Li-yan

A new and simple approach to construct irregular low-density parity-check(LDPC)code based on the binary sequence splitting was proposed.Experimental results show that constructed irregular LDPC code with iterative decoding perform well over the AWGN channel and have a good code weight distribution with 4-cycle free.

Journal of Shandong University of TechnologyJan 1, 20070 citations

A new random construction for low-density parity-check codes

Zhonghu Huang, Shen Lianfeng, Zhihui Ye

This paper gives a new random construction for LDPC codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has low complexity and great flexible choice in LDPC code parameters including code length, code rate, least girth of the graph, and the weight of column and row in the parity-check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Simulations show that the method performs well with iterative decoding.

International Conference on Communications, Circuits and SystemsAug 16, 20050 citations

Irregular low-density parity-check code design based on integer lattices

Wataru Matsumoto, Hirotaka Imai

We propose an irregular low-density parity-check (LDPC) code design scheme by extension of a regular LDPC code using Latin square matrices of random sequence. Our scheme is a deterministic method that enables to easily design good irregular LDPC code for any code rate and degree distributions. We optimize LDPC codes by Gaussian approximation (GA) Chung, S-Y et al., (2001) method and construct irregular LDPC codes based on integer lattices Vasic, B et al., (2002).

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

Low-density parity-check codes based on sparse binary sequences

Ming Jiang

A novel and simple construction of regular LDPC codes was proposed, which used sparse binary sequences, through studying construction methods of LDPC codes. The distribution matrix of ones in parity-check matrix was introduced into the new construction. The cyclic cross correlation function and the cyclic auto correlation function were utilized to ensure that the girth of Tanner graph was eight. The new codes perform well using the sum-product algorithm for iterative decoding. Low encoding complexity can also be achieved due to the inherent quasi-cyclic structure of the LDPC codes.

Journal of China Institute of CommunicationsJan 1, 20052 citations

Joint Iterative Decoding of LDPC Codes and Channels with Memory

Henry D. Pfister, Paul H. Siegel

Introduction Sequences of irregular low-density parity-check (LDPC) codes that achieve the capacity of the binary erasure channel (BEC) under iterative decoding were first constructed by Luby, et al. in [11]. This was followed by the work of Chung, et al., which provided evidence suggesting that sequences of iteratively decoded LDPC codes can also achieve the channel capacity of the binary-input additive white Gaussian noise (AWGN) channel [3]. Since then, density evolution (DE) [13] has been used to optimize irregular LDPC codes for a variety of memoryless channels (e.g., [6]), and the results suggest, for each channel, that sequences of iteratively decoded LDPC codes can indeed achieve the channel capacity. In fact, the discovery of a channel whose capacity cannot be approached by LDPC codes would be more surprising than a proof that iteratively decoded LDPC codes can achieve the capacity of any binary-input symmetric channel (BISC). The idea of decoding a code transmitted over a c

Jan 1, 20074 citations

Lowering Error Floors of Irregular LDPC Codes by Combining Construction and Decoding

Xiaopeng Jiao, Jianjun Mu, Fan FANG +1 more

Irregular low-density parity-check (LDPC) codes generally have good decoding performance in the waterfall region, but they exhibit higher error floors than regular ones. In this letter, we present a hybrid method, which combines code construction and the iterative decoding algorithm, to tackle this problem. Simulation results show that the proposed scheme decreases the error floor significantly for irregular LDPC codes over binary-input additive white Gaussian noise (BIAWGN) channel.

IEICE Transactions on CommunicationsJan 1, 20121 citation