Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Changshu Institute of Technology

Construction of Cycle-free LDPC Codes

OU Wei-hua

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

The linear block code is called a binary Low Density Parity Check code if its parity-check matrix is a sparse matrix.For the features of parity-check matrix,a LDPC code can be illustrated by a Tanner graph.Cycles,especially short cycles in the Tanner graph,which lead to inefficient decoding and prevent the decoding algorithm from converging to the optimal decoding result.In this paper,we demonstrate that a detection method of short cycle presents generation algorithm of check matrix without cycle 4 and simulates the check-matrix.

Related papers

Construction of Cycle-free LDPC Codes

Fengfan Yang

The linear block code is called a binary Low-Density Parity-Check code if whose parity-check matrix is a sparse matrix. For the features of parity-check matrix, a LDPC code can be illustrated by a Tanner graph. Cycles, especially short cycles in the Tanner graph, lead to inefficient decoding and prevent the decoding algorithm from converging to the optimal decoding result. In this paper, a simple algorithm of constructing four-cycle-free regular A(n,d_v,d_c)LDPC codes, d_v3, is introduced. And we analyse the relationship between the performance and the cycle.

Journal of Yunnan University for Nationalites•Jan 1, 2005•0 citations

Tree Matrix Algorithm of LDPC Codes

Huanming Zhang

LDPC codes are finding increasing use in applications requiring reliable and highly efficient information transfer over bandwidth. An LDPC code is defined by a sparse parity-check matrix and can be described by a bipartite graph called Tanner graph. Loops in Tanner graph prevent the sum-product algorithm from converging. Further, loops, especially short loops, degrade the performance of LDPC decoder, because they affect the independence of the extrinsic information exchanged in the iterative decoding. This paper, by graph theory, deduces cut-node tree graph of LDPC code, and depicts it with matrix. On the basis of tree matrix algorithm, whole depictions of loops can be figured out, providing of foundation for further research of relations between loops and LDPC codes’ performance.

Journal of Signal and Information Processing•Jan 1, 2014•0 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 Systems•Aug 16, 2005•0 citations

Design of Structured Regular LDPC Codes without Short Cycles using Gray Code Representations

Vibha Kulkarni, K. Jaya Sankar

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

•Jan 1, 2013•0 citations

Quasi-Cyclic Low-Density Parity-Check Codes Based on Progressive Cycle Growth Algorithm

Yuanhua Liu, Meiling Zhang, Niu Xin-Liang

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.

International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)•Jul 1, 2016•1 citation

Construction of LDPC Codes with Cycles Hold in Tanner Graph

Binbin Liu, Shunliang Mei, Dong Bai

This paper presents a algebraic method for constructing LDPC codes. It uses a parity-check matrix of a short LDPC code with given degree distribution as mother matrix, upon which a long LDPC code is constructed by circulant permutation matrices. The number of cycles of given length in the Tanner graph of constructed codes is equal to or less than that of the short codes. Simulation results show that the error floor of constructed LDPC codes can be suppressed to a very low level.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2007•0 citations
The linear block code is called a binary Low Density Parity Check code if its parity-check matrix is a sparse matrix.For the features of parity-check matrix,a LDPC code can be illustrated by a Tanner graph.Cycles,especially short cycles in the Tanner graph,which lead to inefficient decoding and prevent the decoding algorithm from converging to the optimal decoding result.In this paper,we demonstrate that a detection method of short cycle presents generation algorithm of check matrix without cycle 4 and simulates the check-matrix.
The linear block code is called a binary Low-Density Parity-Check code if whose parity-check matrix is a sparse matrix. For the features of parity-check matrix, a LDPC code can be illustrated by a Tanner graph. Cycles, especially short cycles in the Tanner graph, lead to inefficient decoding and prevent the decoding algorithm from converging to the optimal decoding result. In this paper, a simple algorithm of constructing four-cycle-free regular A(n,d_v,d_c)LDPC codes, d_v3, is introduced. And we analyse the relationship between the performance and the cycle.
LDPC codes are finding increasing use in applications requiring reliable and highly efficient information transfer over bandwidth. An LDPC code is defined by a sparse parity-check matrix and can be described by a bipartite graph called Tanner graph. Loops in Tanner graph prevent the sum-product algorithm from converging. Further, loops, especially short loops, degrade the performance of LDPC decoder, because they affect the independence of the extrinsic information exchanged in the iterative decoding. This paper, by graph theory, deduces cut-node tree graph of LDPC code, and depicts it with matrix. On the basis of tree matrix algorithm, whole depictions of loops can be figured out, providing of foundation for further research of relations between loops and LDPC codes’ performance.
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.
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
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.