2007Journal of the China Railway SocietyRequires access

Design of LDPC Codes with Large Girth Based on the Submatrix Shifting Method

Yang Xiao

Open publisher page 0 citations

Abstract

By analyzing the shapes of 4-cycles and 6-cycles of TG in parity check matrix,this paper presents a method of counting the number of 4-cycles and 6-cycles.Considering the cycles,especially the short cycles,degrade the performance of LDPC decoders,this paper then proposes a design of regular check matrix for Low-Density Parity-Check(LDPC) codes with girth 8.The proposed construction algorithm for LDPC codes is to design 3 submatrices with different given shifting functions,then combine them into one matrix,and finally expand the transposed matrix of the combination matrix into a desired parity check matrix using the identity matrix and the cyclic shift matrices of the identity matrix randomly.The simulation results in the AWGN channel show that the BER performance of these codes obtained by the generation matrix derived from the proposed check matrices in encoding the random information bits is as good as that of the random LDPC codes.

About this research paper

What this paper is about

By analyzing the shapes of 4-cycles and 6-cycles of TG in parity check matrix,this paper presents a method of counting the number of 4-cycles and 6-cycles.Considering the cycles,especially the short cycles,degrade the performance of LDPC decoders,this paper then proposes a design of regular check matrix for Low-Density Parity-Check(LDPC) codes with girth 8.The proposed construction algorithm for LDPC codes is to design 3 submatrices with different given shifting functions,then combine them into one matrix,and finally expand the transposed matrix of the combination matrix into a desired parity check matrix using the identity matrix and the cyclic shift matrices of the identity matrix randomly.The simulation results in the AWGN channel show that the BER performance of these codes obtained by the generation matrix derived from the proposed check matrices in encoding the random information bits is as good as that of the random LDPC codes.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

By analyzing the shapes of 4-cycles and 6-cycles of TG in parity check matrix,this paper presents a method of counting the number of 4-cycles and 6-cycles.Considering the cycles,especially the short cycles,degrade the performance of LDPC decoders,this paper then proposes a design of regular check matrix for Low-Density Parity-Check(LDPC) codes with girth 8.The proposed construction algorithm for LDPC codes is to design 3 submatrices with different given shifting functions,then combine them into one matrix,and finally expand the transposed matrix of the combination matrix into a desired parity check matrix using the identity matrix and the cyclic shift matrices of the identity matrix randomly.The simulation results in the AWGN channel show that the BER performance of these codes obtained by the generation matrix derived from the proposed check matrices in encoding the random information bits is as good as that of the random LDPC codes.

Key concepts: Low-density parity-check code, Parity-check matrix, Identity matrix, Block matrix, Mathematics, Matrix (chemical analysis), Additive white Gaussian noise, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Design of LDPC Codes with Large Girth Based on the Submatrix Shifting Method — Research Paper | ScholarLens