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

International Journal of Communication Systems

Construction of quasi‐cyclic low‐density parity‐check codes with low encoding complexity

Hua Xu

Published Nov 7, 2012• 3 citations
Publisher

Abstract

SUMMARY Low encoding complexity is very important for quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes used in wireless communication systems. In this paper, a new scheme is presented to construct QC‐LDPC codes with low encoding complexity. This scheme is called two‐stage particle swarm optimization (TS‐PSO) algorithm, in which both the threshold and girth distribution of QC‐LDPC codes are considered. The proposed scheme is composed of two stages. In the first stage, we construct a binary base matrix of QC‐LDPC code with the best threshold. The matrix is constructed by combining a binary PSO algorithm and the protograph extrinsic information transfer (PEXIT) method. In the second stage, we search an exponent matrix of the QC‐LDPC code with the best girth distribution. This exponent matrix is based on the base matrix obtained in the first stage. Consequently, the parity‐check matrix of the QC‐LDPC code with the best threshold and best girth distribution are constructed. Furthermore, bit error rate performances are compared for the QC‐LDPC codes constructed by proposed scheme, the QC‐LDPC code in 802.16e standard, and the QC‐LDPC code in Tam's study. Simulation results show that the QC‐LDPC codes proposed in this study are superior to both the 802.16e code and the Tam code on the additive white Gaussian noise (AWGN) and Rayleigh channels. Moreover, proposed scheme is easily implemented, and is flexible and effective for constructing QC‐LDPC codes with low encoding complexity. Copyright © 2012 John Wiley & Sons, Ltd.

DOI
10.1002/dac.2465

Related papers

Rate‐compatible QC‐LDPC codes based on PEXIT

Yuanhua Liu

An improved extension method based on protograph extrinsic information transfer (PEXIT) charts is proposed to design rate‐compatible quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes with more flexible rates and better performance. The masking matrix of the highest‐rate code can first be constructed column by column to own the lowest decoding threshold. Then, an extension algorithm is proposed to obtain the masking matrices of lower‐rate codes with flexible rates. Finally, the base matrices with small amount of short cycles are designed and the parity‐check matrices of rate‐compatible QC‐LDPC codes are obtained through matrix extension. Simulations show that compared with the existing codes, the proposed codes have more flexible rates while achieving better performance.

Electronics Letters•Jul 31, 2018•4 citations

Low‐complexity high‐rate irregular QC‐LDPC codes with applications to PR2 and EPR2 channels

Virasit Imtawil, Mongkol Kupimai, A. Kruesubthaworn +2 more

ABSTRACT In this paper, we propose a modified high rate (3,L) quasi‐cyclic low‐density parity‐check (QC‐LDPC) code based on circulant permutation matrices for efficient encoder implementation. The structure of the code is modified from a (3,L) regular QC‐LDPC code to be an approximate lower triangular matrix and a linear independent form. We present two novel efficient encoding techniques for generating redundant parity bits. The complexity of the encoder implementation depends on the number of redundant parity bits of the code for one‐stage encoding and the length of the code for two‐stage encoding. The advantage of both encoding techniques is that few XOR gates are used in encoder implementation. The simulation results show that the proposed codes at code rate 0.884 and 0.953 have good bit error rate performance compared with other LDPC codes over PR2 and EPR2 channels. European Transactions on Telecommunications. Copyright © 2012 John Wiley & Sons, Ltd.

Transactions on Emerging Telecommunications Technologies•Nov 23, 2012•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

Structured quasi‐cyclic low‐density parity‐check codes based on cyclotomic cosets

Morteza Esmaeili, Mehrab Najafian, Aaron Gulliver

This study considers the construction of four‐cycle free quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes. These codes are based on the cyclotomic cosets of q modulo n where q is a prime power, n is a prime and ( n , q ) = 1. If s is the order of q modulo n , then n − 1 = sl for some integer l . Then there are l distinct cyclotomic cosets , 1 ≤ i ≤ l . Concatenation of the l circulant matrices formed using these sets gives an s × sl matrix M co ( n , q ). In addition, the Kronecker product of the transpose of ∪ i with itself modulo n gives an sl × sl matrix M kr ( n , q ). Replacing the entries of these matrices with their associated dispersed binary n × n matrices provides binary QC‐LDPC codes with girth at least six. Furthermore, for any prime power q ′ such that q ′ = n + 1 or q ′ ≥ 2 n , these two matrices can be used to construct q ′‐ary QC‐LDPC codes with girth at least six. These constructions produce large classes of four‐cycle free binary and non‐binary QC‐LDPC codes. Among the structured LDPC codes, the introduced technique, from code‐construction‐complexity perspective, which is an engineering factor, is at least among the best ones if not the best. Performance results are presented which show that the codes obtained perform well over additive white Gaussian noise channel with the iterative sum‐product decoding algorithm.

IET Communications•Jan 30, 2015•6 citations

Construction of Quasi Cyclic LDPC Codes Based on Girth Opt-PSO Algorithm

Hua Xu

The QC(quasi-cyclic) LDPC codes are an important subclass of LDPC codes. The key to improving the performance of QC LDPC codes is how to construct a parity-check matrix H with a girth distribution as good as possible. In this paper, method of girth detection of QC LDPC codes is described first. Furthermore, a novel algorithm, GirthOpt-PSO algorithm, is proposed to construct the QC LDPC codes, which achieves a good girth distribution based on the PSO algorithm. Simulation results show that the performance of the QC LDPC codes constructed by proposed algorithm is better than Tanner code and Array codes. Besides, the proposed algorithm is more flexible for designing the QC LDPC codes with desired block length and rate as well as good girth.

International Conference on Wireless Communications, Networking and Mobile Computing•Oct 1, 2008•0 citations

Construction of LDPC Code with Big Girth and Linear-encoding Complexity

Xiaoming Liu

Based on cycle search algorithm and Progressive Edge Growth(PEG) algorithm,this paper proposes a method to construct quasi-cyclic Low-density Parity Check(LDPC) codes with big girth and linear-encoding complexity.A parity-check matrix with a form of approximate lower triangle structure is designed to achieve iterative encoding with linear-encoding complexity.PEG algorithm is used to construct the base matrix and the cycle search algorithm is used to optimize the cycle distribution.And a fast encoding method is proposed.Experimental results show that the LDPC codes constructed with the proposed method can avoid error floor and achieve better BER performance than Tanner-QC-LDPC codes and equivalent BER performance to the ones of random codes.

Jisuanji gongcheng•Jan 1, 2011•0 citations
SUMMARY Low encoding complexity is very important for quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes used in wireless communication systems. In this paper, a new scheme is presented to construct QC‐LDPC codes with low encoding complexity. This scheme is called two‐stage particle swarm optimization (TS‐PSO) algorithm, in which both the threshold and girth distribution of QC‐LDPC codes are considered. The proposed scheme is composed of two stages. In the first stage, we construct a binary base matrix of QC‐LDPC code with the best threshold. The matrix is constructed by combining a binary PSO algorithm and the protograph extrinsic information transfer (PEXIT) method. In the second stage, we search an exponent matrix of the QC‐LDPC code with the best girth distribution. This exponent matrix is based on the base matrix obtained in the first stage. Consequently, the parity‐check matrix of the QC‐LDPC code with the best threshold and best girth distribution are constructed. Furthermore, bit error rate performances are compared for the QC‐LDPC codes constructed by proposed scheme, the QC‐LDPC code in 802.16e standard, and the QC‐LDPC code in Tam's study. Simulation results show that the QC‐LDPC codes proposed in this study are superior to both the 802.16e code and the Tam code on the additive white Gaussian noise (AWGN) and Rayleigh channels. Moreover, proposed scheme is easily implemented, and is flexible and effective for constructing QC‐LDPC codes with low encoding complexity. Copyright © 2012 John Wiley & Sons, Ltd.
An improved extension method based on protograph extrinsic information transfer (PEXIT) charts is proposed to design rate‐compatible quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes with more flexible rates and better performance. The masking matrix of the highest‐rate code can first be constructed column by column to own the lowest decoding threshold. Then, an extension algorithm is proposed to obtain the masking matrices of lower‐rate codes with flexible rates. Finally, the base matrices with small amount of short cycles are designed and the parity‐check matrices of rate‐compatible QC‐LDPC codes are obtained through matrix extension. Simulations show that compared with the existing codes, the proposed codes have more flexible rates while achieving better performance.
ABSTRACT In this paper, we propose a modified high rate (3,L) quasi‐cyclic low‐density parity‐check (QC‐LDPC) code based on circulant permutation matrices for efficient encoder implementation. The structure of the code is modified from a (3,L) regular QC‐LDPC code to be an approximate lower triangular matrix and a linear independent form. We present two novel efficient encoding techniques for generating redundant parity bits. The complexity of the encoder implementation depends on the number of redundant parity bits of the code for one‐stage encoding and the length of the code for two‐stage encoding. The advantage of both encoding techniques is that few XOR gates are used in encoder implementation. The simulation results show that the proposed codes at code rate 0.884 and 0.953 have good bit error rate performance compared with other LDPC codes over PR2 and EPR2 channels. European Transactions on Telecommunications. Copyright © 2012 John Wiley & Sons, Ltd.
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.
This study considers the construction of four‐cycle free quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes. These codes are based on the cyclotomic cosets of q modulo n where q is a prime power, n is a prime and ( n , q ) = 1. If s is the order of q modulo n , then n − 1 = sl for some integer l . Then there are l distinct cyclotomic cosets , 1 ≤ i ≤ l . Concatenation of the l circulant matrices formed using these sets gives an s × sl matrix M co ( n , q ). In addition, the Kronecker product of the transpose of ∪ i with itself modulo n gives an sl × sl matrix M kr ( n , q ). Replacing the entries of these matrices with their associated dispersed binary n × n matrices provides binary QC‐LDPC codes with girth at least six. Furthermore, for any prime power q ′ such that q ′ = n + 1 or q ′ ≥ 2 n , these two matrices can be used to construct q ′‐ary QC‐LDPC codes with girth at least six. These constructions produce large classes of four‐cycle free binary and non‐binary QC‐LDPC codes. Among the structured LDPC codes, the introduced technique, from code‐construction‐complexity perspective, which is an engineering factor, is at least among the best ones if not the best. Performance results are presented which show that the codes obtained perform well over additive white Gaussian noise channel with the iterative sum‐product decoding algorithm.
The QC(quasi-cyclic) LDPC codes are an important subclass of LDPC codes. The key to improving the performance of QC LDPC codes is how to construct a parity-check matrix H with a girth distribution as good as possible. In this paper, method of girth detection of QC LDPC codes is described first. Furthermore, a novel algorithm, GirthOpt-PSO algorithm, is proposed to construct the QC LDPC codes, which achieves a good girth distribution based on the PSO algorithm. Simulation results show that the performance of the QC LDPC codes constructed by proposed algorithm is better than Tanner code and Array codes. Besides, the proposed algorithm is more flexible for designing the QC LDPC codes with desired block length and rate as well as good girth.
Based on cycle search algorithm and Progressive Edge Growth(PEG) algorithm,this paper proposes a method to construct quasi-cyclic Low-density Parity Check(LDPC) codes with big girth and linear-encoding complexity.A parity-check matrix with a form of approximate lower triangle structure is designed to achieve iterative encoding with linear-encoding complexity.PEG algorithm is used to construct the base matrix and the cycle search algorithm is used to optimize the cycle distribution.And a fast encoding method is proposed.Experimental results show that the LDPC codes constructed with the proposed method can avoid error floor and achieve better BER performance than Tanner-QC-LDPC codes and equivalent BER performance to the ones of random codes.