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

Telecommunication Engineering

An Improved Method for Constructing QC-LDPC Codes Based on Chinese Remainder Theorem

Liu Yuan-hu

Published Jan 1, 2014• 0 citations
OpenAlex

Abstract

An improved combining method for designing quasi- cyclic low- density parity- check( QC-LDPC) codes based on Chinese Remainder Theorem( CRT) is proposed to improve the error- correcting performance by increasing the girth and decreasing the number of short cycles. With the CRT combining method,the difficult problem of designing QC- LDPC codes with girth g is translated into a task of designing one component code with girth g. By properly permuting the column blocks of parity- check matrices of other component codes,a lot of QC- LDPC codes with much shorter cycles and better performance can be designed,which are more suitable for communication systems with request of high reliability. Simulations show that compared with existing CRT- based QC- LDPC codes,the proposed QC- LDPC codes have much shorter cycles and obtain 1. 2 d B coding gain at bit error rate( BER) of 10- 6.

Related papers

Quasi-Cyclic LDPC Codes Based on the Improved Combining Method

Yuan Hua Liu, Mei Ling Zhang, Xin Liang Niu

An improved combining method based on the Chinese Remainder Theorem is proposed for constructing much better quasi-cyclic (QC) LDPC codes. By carefully permuting the block columns of the parity check matrices of the component codes, a lot of QC-LDPC codes with much less short cycles and better performance can be designed. Simulation results show that at a BER of 10-6, the constructed QC-LDPC codes outperform those designed by the existing combining methods by about 1.2 dB.

IEEE International Conference on Computer and Information Technology (CIT)•Sep 1, 2014•0 citations

Generalized Combining Method for Design of Quasi-Cyclic LDPC Codes

Yuanhua Liu, Xinmei Wang, Ruwei Chen +1 more

A generalization of the Chinese Remainder Theorem (CRT) combining method is proposed to design much more and better quasi-cyclic (QC) LDPC codes when the parity check matrices of the component codes are given. It can design a much larger class of QC-LDPC codes with similar performance by loosening the condition for determining the intermediate parameters. By permuting the block rows of the parity check matrices of the component codes, a lot of QC-LDPC codes with much less 6-cycles and better performance can be designed. At a BER of 10-6some QC-LDPC codes designed by the generalized combining method outperform those designed by the CRT combining method by 0.5 dB.

IEEE Communications Letters•May 1, 2008•20 citations

Improved combining method for design of quasi‐cyclic LDPC codes

Yuanhua Liu, Meiling Zhang, Xinliang Niu

An improved combining method is proposed for constructing quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes with large girth and few short cycles. Large girth QC‐LDPC codes can be obtained by carefully designing one component code with large girth. By properly designing the other component codes, a lot of QC‐LDPC codes with very few short cycles can be designed. Simulations show that compared with Chinese remainder theorem based QC‐LDPC codes and progressive edge‐growth based QC‐LDPC codes, the proposed QC‐LDPC codes have much less short cycles and better performance.

Electronics Letters•Mar 1, 2014•2 citations

A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem

Seho Myung, Kyeongcheol Yang

In this paper we propose a method of constructing quasi-cyclic low-density parity-check (QC-LDPC) codes of large length by combining QC-LDPC codes of small length as their component codes, via the Chinese remainder theorem. The girth of the QC-LDPC codes obtained by the proposed method is always larger than or equal to that of each component code. By applying the method to array codes, we present a family of high-rate regular QC-LDPC codes with no 4-cycles. Simulation results show that they have almost the same performance as random regular LDPC codes.

IEEE Communications Letters•Sep 1, 2005•48 citations

Large girth quasi-cyclic LDPC codes based on the chinese remainder theorem

Xueqin Jiang, Moon Ho Lee

In this letter, we consider two problems associated with quasi-cyclic low-density parity-check (QC-LDPC) codes. The first is how to extend the code length of a QC-LDPC code without reducing the girth. The second is how to design a QCLDPC code with a prescribed girth easily. We deal with these two problems by using a combining method of QC-LDPC codes via the Chinese Remainder Theorem (CRT). Codes constructed with our proposed method have flexible code lengths, flexible code rates and large girth. Simulation results show that they perform very well with the iterative decoding.

IEEE Communications Letters•May 1, 2009•31 citations

Quasi-Cyclic LDPC Codes with Large Girth and Few Short Cycles

Yuanhua Liu

In this paper, we present an improved method for obtaining quasi-cyclic low-density parity-check (QC-LDPC) codes of larger length by combining some component QC-LDPC codes of smaller length.Large girth can be obtained by carefully designing one large girth component code of smaller length.The other component codes are properly designed to obtain a lot of QC-LDPC codes with much few short cycles.Simulations show that compared with CRT based QC-LDPC codes and PEG based QC-LDPC codes, the proposed QC-LDPC codes have much less short cycles and better performance.

International Conference on Manufacturing Science and Engineering (ICMSE)•Jan 1, 2018•0 citations
An improved combining method for designing quasi- cyclic low- density parity- check( QC-LDPC) codes based on Chinese Remainder Theorem( CRT) is proposed to improve the error- correcting performance by increasing the girth and decreasing the number of short cycles. With the CRT combining method,the difficult problem of designing QC- LDPC codes with girth g is translated into a task of designing one component code with girth g. By properly permuting the column blocks of parity- check matrices of other component codes,a lot of QC- LDPC codes with much shorter cycles and better performance can be designed,which are more suitable for communication systems with request of high reliability. Simulations show that compared with existing CRT- based QC- LDPC codes,the proposed QC- LDPC codes have much shorter cycles and obtain 1. 2 d B coding gain at bit error rate( BER) of 10- 6.
A generalization of the Chinese Remainder Theorem (CRT) combining method is proposed to design much more and better quasi-cyclic (QC) LDPC codes when the parity check matrices of the component codes are given. It can design a much larger class of QC-LDPC codes with similar performance by loosening the condition for determining the intermediate parameters. By permuting the block rows of the parity check matrices of the component codes, a lot of QC-LDPC codes with much less 6-cycles and better performance can be designed. At a BER of 10-6some QC-LDPC codes designed by the generalized combining method outperform those designed by the CRT combining method by 0.5 dB.
An improved combining method is proposed for constructing quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes with large girth and few short cycles. Large girth QC‐LDPC codes can be obtained by carefully designing one component code with large girth. By properly designing the other component codes, a lot of QC‐LDPC codes with very few short cycles can be designed. Simulations show that compared with Chinese remainder theorem based QC‐LDPC codes and progressive edge‐growth based QC‐LDPC codes, the proposed QC‐LDPC codes have much less short cycles and better performance.
In this paper we propose a method of constructing quasi-cyclic low-density parity-check (QC-LDPC) codes of large length by combining QC-LDPC codes of small length as their component codes, via the Chinese remainder theorem. The girth of the QC-LDPC codes obtained by the proposed method is always larger than or equal to that of each component code. By applying the method to array codes, we present a family of high-rate regular QC-LDPC codes with no 4-cycles. Simulation results show that they have almost the same performance as random regular LDPC codes.
In this letter, we consider two problems associated with quasi-cyclic low-density parity-check (QC-LDPC) codes. The first is how to extend the code length of a QC-LDPC code without reducing the girth. The second is how to design a QCLDPC code with a prescribed girth easily. We deal with these two problems by using a combining method of QC-LDPC codes via the Chinese Remainder Theorem (CRT). Codes constructed with our proposed method have flexible code lengths, flexible code rates and large girth. Simulation results show that they perform very well with the iterative decoding.
In this paper, we present an improved method for obtaining quasi-cyclic low-density parity-check (QC-LDPC) codes of larger length by combining some component QC-LDPC codes of smaller length.Large girth can be obtained by carefully designing one large girth component code of smaller length.The other component codes are properly designed to obtain a lot of QC-LDPC codes with much few short cycles.Simulations show that compared with CRT based QC-LDPC codes and PEG based QC-LDPC codes, the proposed QC-LDPC codes have much less short cycles and better performance.