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.
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.
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.
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