The objective of this thesis is to develop schemes to construct algebraically structured low-density parity-check (LDPC) codes for improving their performance and memory efficiency. It is well-known that the sum-product algorithm provides optimum decoding for LDPC codes with no cycles. However, short cycles in the Tanner graph of LDPC codes may induce a serious performance degradation. Several researchers made an effort to obtain the LDPC codes with no short cycles. Quasi-cyclic LDPC (QC-LDPC) code is a type of LDPC codes, based on circulant permutation matrices. It required a smaller size of memory for encoding and/or decoding and are easier to analyze their algebraic properties than random LDPC codes. This motivates us to take an intensive interest in constructing nonbinary QC-LDPC codes without short cycles. In this thesis, we propose a construction method of nonbinary QC-LDPC codes without short cycles. We present the mathematical proof for girth and cycle properties of proposed design method. As a result, we present the constructing method for nonbinary QC-LDPC codes without short cycles and show it performs well.
The objective of this thesis is to develop schemes to construct algebraically structured low-density parity-check (LDPC) codes for improving their performance and memory efficiency. It is well-known that the sum-product algorithm provides optimum decoding for LDPC codes with no cycles. However, short cycles in the Tanner graph of LDPC codes may induce a serious performance degradation. Several researchers made an effort to obtain the LDPC codes with no short cycles. Quasi-cyclic LDPC (QC-LDPC) code is a type of LDPC codes, based on circulant permutation matrices. It required a smaller size of memory for encoding and/or decoding and are easier to analyze their algebraic properties than random LDPC codes. This motivates us to take an intensive interest in constructing nonbinary QC-LDPC codes without short cycles. In this thesis, we propose a construction method of nonbinary QC-LDPC codes without short cycles. We present the mathematical proof for girth and cycle properties of proposed design method. As a result, we present the constructing method for nonbinary QC-LDPC codes without short cycles and show it performs well.
Encoding of computer-generated random low-density parity-check(LDPC) codes can be rather complex.QC-LDPC codes have encoding advantage over random LDPC codes.Encoding of an QC-LDPC code can be implemented using shift-registers with linear complexity.The usual algorithm for the decoding of LDPC codes is the iterative sum-product algorithm(SPA),operating on a Tanner graph of the code.It is well known that cycle-free Tanner graph with SPA algorithm yeilds optimal decoding.The girth of the cycle -free Tanner graph is infinite.In this paper,we present an algebraic method for constructing binary QC-LDPC codes based on the rowcolumn constraint.The codes constructed by this method have girths at least 6.Experimental results show that the constructed LDPC codes decoded with SPA over the AWGN channel can perform as well as standard LDPC codes in terms of bit-error probability and block error probability.
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.
Short cycles in the Tanner graph of a given LDPC code has negative effect on the performance of iterative decoding. To improve the performance, we presented an approach for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes whose associated Tanner graph has large girth and a small amount of short cycles. Each column block of the parity check matrix was designed by adding circulant permutation sub-matrices one after another, provided the current parity check matrix has minimal number of short cycles. The condition for the proposed QC-LDPC codes to have girth at least 6 was also analyzed. Regular and irregular QC-LDPC codes with various lengths and rates can be constructed. Simulations show that the proposed QC-LDPC codes have less short cycles and better performance than existing progressive edge growth based QC-LDPC codes.
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.
Low Density Parity Check (LDPC) codes are specified by the parity check matrix H. Smaller girths in the Tanner graphs of LDPC codes prevent the sum-product algorithm from converging, i.e., short cycles in H-matrix degrade the performance of LDPC decoder. In this paper, we present an algorithm for constructing LDPC codes without short cycles. The H-matrix must be sufficiently sparse to increase the girth of a code. In this work, we present a simple method to increase the sparsity of matrix and provide lemmas to avoid short cycles of lengths 4 and 6. We design sub-matrices for column-weight two and column-weight three codes. This design makes use of a simple shifting function given by the proposed scheme. These are then combined into a final H-matrix using Gray code representations. The proposed method provides structured, regular codes with flexibility in code rates and code lengths. The regularity of these codes gives the advantages like simplicity of hardware implementation and fast encoding. Key words LDPC codes, Tanner Graph, Girth, Gray codes
In this paper, we propose a novel method for constructing low-density parity-check (LDPC) codes that relies on circulant permutation matrices as the main principal elements. A key feature of this construction is the intentional avoidance of short cycles, particularly those of length four, which are known to degrade decoding performance. By eliminating these cycles, the approach contributes to lowering both encoding and decoding complexity, making the codes more efficient to implement. To assess their effectiveness, the proposed LDPC codes are evaluated and compared with uncoded binary phase shift keying (BPSK) transmission over an additive white Gaussian noise (AWGN) channel. The simulation outcomes demonstrate that the structured codes deliver competitive results, achieving error-rate performance similar to, and in some instances exceeding, well-known designs such as progressive edge growth (PEG) and quasi-cyclic (QC) codes.