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

IEEE Access

Type-II QC-LDPC Codes From Multiplicative Subgroup of Prime Field

Guohua Zhang, Yulin Hu, Defeng Ren, Yuanhua Liu, Yang Yang

Published Jan 1, 2020• 7 citations
Publisher

Abstract

A quasi-cyclic (QC) low-density parity-check (LDPC) code is called type-II, if the maximum weight over all circulants appearing in the parity-check matrix has the value of two. On the basis of multiplicative subgroup analysis for the prime field, a novel algebraic approach for type-II QC-LDPC codes is proposed from Tanner's method. For column weight of four, the new type-II codes possess girth at least six and include a subset with very small circulant sizes almost attaining the theoretical lower bound. The new approach can yield type-II codes with two times smaller circulant sizes, in comparison with the state-of-the-art method. To enhance the flexibility of circulant sizes, a generalized Chinese-remainder-theorem (gCRT) method is proposed as well for type-II codes. Simulation results show that combining gCRT with the proposed short code yields compound type-II codes with a very promising decoding performance and flexible circulant sizes.

DOI
10.1109/access.2020.3013838

Related papers

Constructions of Type-II QC-LDPC Codes With Girth Eight from Sidon Sequence

Guohua Zhang, Yulin Hu, Yi Fang +1 more

In this paper, we consider the constructions of type-II quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight from a Sidon sequence. We first derive the necessary and sufficient conditions guaranteeing a girth-eight type-II QC-LDPC code. By combining these conditions with the concept of the Sidon sequence, three classes of type-II QC-LDPC codes are subsequently proposed with girth eight. To the best of our knowledge, the second and the third classes we proposed are the first series of systematic and algebraic constructions for the girth-eight type-II QC-LDPC codes that have rates being greater than a half and, at the same time, have distance upper bounds being not limited to 12. Via simulations, we show the promising performance of the proposed type-II QC-LDPC codes with girth eight. In addition, a set of general bounds and explicit/random constructions without using a Sidon sequence are also presented for the type-II QC-LDPC codes with girth six or eight. We observe that the proposed codes perform better than or equally well as the random QC-LDPC codes from PEG and quadr.-congr. methods, while the novel codes possess both highly structured parity-check matrices and very flexible choices in circulant size.

IEEE Transactions on Communications•Feb 25, 2019•22 citations

Construction of Type‐II QC LDPC Codes Based on Perfect Cyclic Difference Set

Lijun Zhang, Bing Li, L. L. Cheng

Quasi-cyclic (QC) Low-density paritycheck (LDPC) codes are constructed from combination of weight-0 (null matrix) and Weight-2 (W2) Circulant matrix (CM), which can be seen as a special case of the general type-II QC LDPC codes. The shift matrix of the codes is built on the basis of one integer sequence, called perfect Cyclic difference set (CDS), which guarantees the girth of the code at least six. Simulation results show that the codes can perform well in comparison with a variety of other LDPC codes. They have excellent error floor and decoding convergence characteristics.

Chinese Journal of Electronics•Jan 1, 2015•10 citations

Explicit Construction of Type-II QC LDPC Codes with Girth at least 6

Kristine Lally

Type-II quasi-cyclic (QC) LDPC codes are constructed from combinations of weight-0, weight-1 and weight-2 circulant matrices. The structure of cycles of length 2nare investigated, and necessary and sufficient conditions for a type-II QC LDPC parity check matrix H to have girth at least 2(n+ 1) are given. An explicit construction of type-II codes which guarantees girth at least 6 is presented. A necessary and sufficient condition for a QC matrix with one or more rows of circulants, to be fullrank is derived.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•18 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

QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns

Mohammad Hesam Tadayon, Mohammad Mohammadi

In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the associated Tanner graph is free of cycle four. Each circulant matrix in H is made by a generator column. The generator columns should be selected in a way that each associated circulant matrix and every two distinct circulant matrices are free of cycle four. The generator columns are made by row distance sets. An algorithm for generating distance sets and obtaining circulant matrices with columns of weight three is presented separately. Simplicity of construction and having a good flexible family of quasi cyclic LDPC codes both in rate and length are the main properties of the proposed method. The performance of the proposed codes is compared with that of the random-like and Array LDPC codes over an AWGN channel. Simulation results show that from the performance perspective, the constructed codes are competitive with random-like and Array LDPC codes.

International Journal of Information & Communication Technology Research•Jun 15, 2016•0 citations

Half Rate Quasi Cyclic Low Density Parity Check Codes Based on Combinatorial Designs

Sina Vafi, Narges Rezvani Majid

This paper presents new half rate Quasi Cyclic Low Density Parity Check (QC- LDPC) codes formed on the basis of combinatorial designs. In these codes, circulant matrices of the parity check matrix are formed on the basis of subsets in which the difference between any two elements of a subset is unique with all differences obtained from the same or different subsets. This structure of circulant matrices guarantees non-existence of cycle-4 in the Tanner graph of QC-LDPC codes. First, an irregular code with girth 6 constituted by two rows of circulant matrices is proposed. Then, more criteria will be considered on the structure of subsets with the mentioned feature aiming to represent a new scheme of regular QC-LPDC codes with girth at least 8. From simulations, it is confirmed that codes have similar to or better performance than other well-known half rate codes, while require lower complexity in their design.

Journal of Computer and Communications•Jan 1, 2016•8 citations
A quasi-cyclic (QC) low-density parity-check (LDPC) code is called type-II, if the maximum weight over all circulants appearing in the parity-check matrix has the value of two. On the basis of multiplicative subgroup analysis for the prime field, a novel algebraic approach for type-II QC-LDPC codes is proposed from Tanner's method. For column weight of four, the new type-II codes possess girth at least six and include a subset with very small circulant sizes almost attaining the theoretical lower bound. The new approach can yield type-II codes with two times smaller circulant sizes, in comparison with the state-of-the-art method. To enhance the flexibility of circulant sizes, a generalized Chinese-remainder-theorem (gCRT) method is proposed as well for type-II codes. Simulation results show that combining gCRT with the proposed short code yields compound type-II codes with a very promising decoding performance and flexible circulant sizes.
In this paper, we consider the constructions of type-II quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight from a Sidon sequence. We first derive the necessary and sufficient conditions guaranteeing a girth-eight type-II QC-LDPC code. By combining these conditions with the concept of the Sidon sequence, three classes of type-II QC-LDPC codes are subsequently proposed with girth eight. To the best of our knowledge, the second and the third classes we proposed are the first series of systematic and algebraic constructions for the girth-eight type-II QC-LDPC codes that have rates being greater than a half and, at the same time, have distance upper bounds being not limited to 12. Via simulations, we show the promising performance of the proposed type-II QC-LDPC codes with girth eight. In addition, a set of general bounds and explicit/random constructions without using a Sidon sequence are also presented for the type-II QC-LDPC codes with girth six or eight. We observe that the proposed codes perform better than or equally well as the random QC-LDPC codes from PEG and quadr.-congr. methods, while the novel codes possess both highly structured parity-check matrices and very flexible choices in circulant size.
Quasi-cyclic (QC) Low-density paritycheck (LDPC) codes are constructed from combination of weight-0 (null matrix) and Weight-2 (W2) Circulant matrix (CM), which can be seen as a special case of the general type-II QC LDPC codes. The shift matrix of the codes is built on the basis of one integer sequence, called perfect Cyclic difference set (CDS), which guarantees the girth of the code at least six. Simulation results show that the codes can perform well in comparison with a variety of other LDPC codes. They have excellent error floor and decoding convergence characteristics.
Type-II quasi-cyclic (QC) LDPC codes are constructed from combinations of weight-0, weight-1 and weight-2 circulant matrices. The structure of cycles of length 2nare investigated, and necessary and sufficient conditions for a type-II QC LDPC parity check matrix H to have girth at least 2(n+ 1) are given. An explicit construction of type-II codes which guarantees girth at least 6 is presented. A necessary and sufficient condition for a QC matrix with one or more rows of circulants, to be fullrank is derived.
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.
In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the associated Tanner graph is free of cycle four. Each circulant matrix in H is made by a generator column. The generator columns should be selected in a way that each associated circulant matrix and every two distinct circulant matrices are free of cycle four. The generator columns are made by row distance sets. An algorithm for generating distance sets and obtaining circulant matrices with columns of weight three is presented separately. Simplicity of construction and having a good flexible family of quasi cyclic LDPC codes both in rate and length are the main properties of the proposed method. The performance of the proposed codes is compared with that of the random-like and Array LDPC codes over an AWGN channel. Simulation results show that from the performance perspective, the constructed codes are competitive with random-like and Array LDPC codes.
This paper presents new half rate Quasi Cyclic Low Density Parity Check (QC- LDPC) codes formed on the basis of combinatorial designs. In these codes, circulant matrices of the parity check matrix are formed on the basis of subsets in which the difference between any two elements of a subset is unique with all differences obtained from the same or different subsets. This structure of circulant matrices guarantees non-existence of cycle-4 in the Tanner graph of QC-LDPC codes. First, an irregular code with girth 6 constituted by two rows of circulant matrices is proposed. Then, more criteria will be considered on the structure of subsets with the mentioned feature aiming to represent a new scheme of regular QC-LPDC codes with girth at least 8. From simulations, it is confirmed that codes have similar to or better performance than other well-known half rate codes, while require lower complexity in their design.