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

Jisuanji gongcheng

Construction of Quasi-cycle Low-density Parity-check Codes with Low Complexity Degree

Haiyan Cao

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

Based on the structure of parity-check matrix of RU algorithm,a class of Quasi-cycle Low-density Parity-check(QC-LDPC) codes with complexity is constructed by selecting sub-matrices reasonably to restrict and consisting of lower dual diagonal matrices.Simulation results show that not only the proposed codes have lower complexity,but also the error-correcting performance is better than QC-LDPC codes randomly constructed and practical Block-LDPC codes in the additive white Gaussion noise channel.It can get 0.3 dB Signal to Noise Ratio(SNR) gain at a Bit Error Rate(BRE) of 10-6.

Related papers

Quasi-cyclic LDPC codes for fast encoding

Seho Myung, Kyeongcheol Yang, Jaeyoel Kim

In this correspondence we present a special class of quasi-cyclic low-density parity-check (QC-LDPC) codes, called block-type LDPC (B-LDPC) codes, which have an efficient encoding algorithm due to the simple structure of their parity-check matrices. Since the parity-check matrix of a QC-LDPC code consists of circulant permutation matrices or the zero matrix, the required memory for storing it can be significantly reduced, as compared with randomly constructed LDPC codes. We show that the girth of a QC-LDPC code is upper-bounded by a certain number which is determined by the positions of circulant permutation matrices. The B-LDPC codes are constructed as irregular QC-LDPC codes with parity-check matrices of an almost lower triangular form so that they have an efficient encoding algorithm, good noise threshold, and low error floor. Their encoding complexity is linearly scaled regardless of the size of circulant permutation matrices.

IEEE Transactions on Information Theory•Jul 19, 2005•282 citations

Construction of Quasi-Cyclic Low-Density Parity-Check Codes based on Quadratic Residue Codes

Yong Li, Hao Yan, Rui Liu +2 more

Motivated by the success of constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on Reed-Solomon codes, a construction method for QC-LDPC codes is presented in this paper, using the check matrices of quadratic residues codes. Three QC-LDPC codes are obtained by utilizing two quadratic residues codes of lengths less than 100, and the resultant QC-LDPC codes are regular, high-rate and free of length-4 cycles. Simulation results show that the proposed QC-LDPC codes achieves similar performance as the random LDPC codes, but they have less short cycles. In addition, the proposed (279, 158) QC-LDPC code outperforms its counterpart constructed from Reed-Solomon codes at high signal-to-noise ratios.

International Symposium on Medical Information and Communication Technology•Apr 14, 2021•3 citations

Construction of QC LDPC codes Based on Cyclic Subgroup over GF(q)

Xiaotao Deng, Jun Gao, Gaoqi Dou

In this paper, we proposed a novel method for constructing quasi-cyclic low-density parity-check (QC LDPC) codes based on cyclic subgroup over GF(q) . LDPC codes constructed by this method are quasi-cyclic (QC) and they perform very well over the additive white Gaussian noise (AWGN) with sum product algorithm (SPA). The main advantage is that QC LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths. Since the codes are QC, they can be encoded using simple shift registers with linear complexity.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2009•0 citations

An Efficient Method of Constructing Quasi-Cyclic Low-Density Parity-Check Codes

Zhanji Wu, Jiao Cheng

An efficient method of constructing irregular quasi-cyclic (QC) low-density parity-check (LDPC) codes is proposed. In order to find the degree distribution with low convergence threshold, the extrinsic information transfer (EXIT) chart is utilized to optimize the degree distribution of LDPC codes. Then, a modified progressive edge growth (PEG) algorithm is used to get the mask matrix with the optimal degree distribution. Finally, the parity-check matrix of QC LDPC code is constructed based on the mask matrix, and the shift values are optimized to eliminate short cycles. Simulation results show that the constructed irregular QC LDPC codes with optimized degree distribution significantly outperform the regular QC LDPC codes in the additive white Gaussion noise (AWGN) channel.

IEEE Vehicular Technology Conference•Sep 1, 2012•0 citations

On the use of QC-LDPC code for data transfer using short and medium block length

Mohammad Rakibul Islam, Jinsang Kim

Quasi Cyclic Low Density Parity Check codes (QC-LDPC) is proposed to reduce the complexity of the Low Density Parity Check codes (LDPC) further while obtaining the similar performance. Our proposed QC-LDPC presents an improved construction of circulant sub-matrices based QC-LDPC at high SNR. The proposed construction yields a performance gain of about 1 dB at a 0.0003 bit error rate (BER). Proposed code is tested on 4 types of decoding algorithm and compared. Proposed algorithm is also compared with the existing QC-LDPC and the proposed approach outperforms the existing one at high SNR. Simulation is also performed varying the number of horizontal submatrix and the result shows that the parity check matrix with smaller horizontal concatenation shows better performance.

International Conference on Advanced Communication Technology•Feb 15, 2009•3 citations

A Construction of High Performance Quasicyclic LDPC Codes: A Combinatoric Design Approach

Muhammad Asif, Wuyang Zhou, Muhammad Ajmal +2 more

This correspondence presents a construction of quasicyclic (QC) low-density parity-check (LDPC) codes based on a special type of combinatorial designs known as block disjoint difference families (BDDFs). The proposed construction of QC-LDPC codes gives parity-check matrices with column weight three and Tanner graphs having a girth lower-bounded by 6. The proposed QC-LDPC codes provide an excellent performance with iterative decoding over an additive white Gaussian-noise (AWGN) channel. Performance analysis shows that the proposed short and moderate length QC-LDPC codes perform as well as their competitors in the lower signal-to-noise ratio (SNR) region but outperform in the higher SNR region. Also, the codes constructed are quasicyclic in nature, so the encoding can be done with simple shift-register circuits with linear complexity.

Wireless Communications and Mobile Computing•Feb 3, 2019•12 citations
Based on the structure of parity-check matrix of RU algorithm,a class of Quasi-cycle Low-density Parity-check(QC-LDPC) codes with complexity is constructed by selecting sub-matrices reasonably to restrict and consisting of lower dual diagonal matrices.Simulation results show that not only the proposed codes have lower complexity,but also the error-correcting performance is better than QC-LDPC codes randomly constructed and practical Block-LDPC codes in the additive white Gaussion noise channel.It can get 0.3 dB Signal to Noise Ratio(SNR) gain at a Bit Error Rate(BRE) of 10-6.
In this correspondence we present a special class of quasi-cyclic low-density parity-check (QC-LDPC) codes, called block-type LDPC (B-LDPC) codes, which have an efficient encoding algorithm due to the simple structure of their parity-check matrices. Since the parity-check matrix of a QC-LDPC code consists of circulant permutation matrices or the zero matrix, the required memory for storing it can be significantly reduced, as compared with randomly constructed LDPC codes. We show that the girth of a QC-LDPC code is upper-bounded by a certain number which is determined by the positions of circulant permutation matrices. The B-LDPC codes are constructed as irregular QC-LDPC codes with parity-check matrices of an almost lower triangular form so that they have an efficient encoding algorithm, good noise threshold, and low error floor. Their encoding complexity is linearly scaled regardless of the size of circulant permutation matrices.
Motivated by the success of constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on Reed-Solomon codes, a construction method for QC-LDPC codes is presented in this paper, using the check matrices of quadratic residues codes. Three QC-LDPC codes are obtained by utilizing two quadratic residues codes of lengths less than 100, and the resultant QC-LDPC codes are regular, high-rate and free of length-4 cycles. Simulation results show that the proposed QC-LDPC codes achieves similar performance as the random LDPC codes, but they have less short cycles. In addition, the proposed (279, 158) QC-LDPC code outperforms its counterpart constructed from Reed-Solomon codes at high signal-to-noise ratios.
In this paper, we proposed a novel method for constructing quasi-cyclic low-density parity-check (QC LDPC) codes based on cyclic subgroup over GF(q) . LDPC codes constructed by this method are quasi-cyclic (QC) and they perform very well over the additive white Gaussian noise (AWGN) with sum product algorithm (SPA). The main advantage is that QC LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths. Since the codes are QC, they can be encoded using simple shift registers with linear complexity.
An efficient method of constructing irregular quasi-cyclic (QC) low-density parity-check (LDPC) codes is proposed. In order to find the degree distribution with low convergence threshold, the extrinsic information transfer (EXIT) chart is utilized to optimize the degree distribution of LDPC codes. Then, a modified progressive edge growth (PEG) algorithm is used to get the mask matrix with the optimal degree distribution. Finally, the parity-check matrix of QC LDPC code is constructed based on the mask matrix, and the shift values are optimized to eliminate short cycles. Simulation results show that the constructed irregular QC LDPC codes with optimized degree distribution significantly outperform the regular QC LDPC codes in the additive white Gaussion noise (AWGN) channel.
Quasi Cyclic Low Density Parity Check codes (QC-LDPC) is proposed to reduce the complexity of the Low Density Parity Check codes (LDPC) further while obtaining the similar performance. Our proposed QC-LDPC presents an improved construction of circulant sub-matrices based QC-LDPC at high SNR. The proposed construction yields a performance gain of about 1 dB at a 0.0003 bit error rate (BER). Proposed code is tested on 4 types of decoding algorithm and compared. Proposed algorithm is also compared with the existing QC-LDPC and the proposed approach outperforms the existing one at high SNR. Simulation is also performed varying the number of horizontal submatrix and the result shows that the parity check matrix with smaller horizontal concatenation shows better performance.
This correspondence presents a construction of quasicyclic (QC) low-density parity-check (LDPC) codes based on a special type of combinatorial designs known as block disjoint difference families (BDDFs). The proposed construction of QC-LDPC codes gives parity-check matrices with column weight three and Tanner graphs having a girth lower-bounded by 6. The proposed QC-LDPC codes provide an excellent performance with iterative decoding over an additive white Gaussian-noise (AWGN) channel. Performance analysis shows that the proposed short and moderate length QC-LDPC codes perform as well as their competitors in the lower signal-to-noise ratio (SNR) region but outperform in the higher SNR region. Also, the codes constructed are quasicyclic in nature, so the encoding can be done with simple shift-register circuits with linear complexity.