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

Very Large Girth Column-weight two Quasi-cyclic LDPC Codes

Gabofetswe Malema, Michael John Liebelt

Published Jan 1, 2006• 1 citation
Publisher

Abstract

In this paper a modified bit-filling algorithm is used for constructing column-weight two quasi-cyclic low-density parity-check codes with large girths. Code rows are divided into groups. A column is connected to two rows from different groups, which are apart by at least a specified minimum length. Rows that meet the minimum length are searched sequentially. Group rows are connected to consecutive columns resulting in a cyclic structure in the code matrix. Larger codes can be obtained by using larger row groups. Compared to other methods, the algorithm provides an easy and fast way to construct codes of a wide range of rates, girths and lengths. Constructed codes show good bit error rate performance. They are also easily implementable in hardware compared to those obtained using the original bit filling algorithm

DOI
10.1109/icosp.2006.345788

Related papers

Quasi-Cyclic LDPC Codes of Column-Weight Two Using a Search Algorithm

Gabofetswe Malema, Michael John Liebelt

This article introduces a search algorithm for constructing quasi-cyclic LDPC codes of column-weight two. To obtain a submatrix structure, rows are divided into groups of equal sizes. Rows in a group are connected in their numerical order to obtain a cyclic structure. Two rows forming a column must be at a specified distance from each other to obtain a given girth. The search for rows satisfying the distance is done sequentially or randomly. Using the proposed algorithm regular and irregular column-weight-two codes are obtained over a wide range of girths, rates, and lengths. The algorithm, which has a complexity linear with respect to the number of rows, provides an easy and fast way to construct quasi-cyclic LDPC codes. Constructed codes show good bit-error rate performance with randomly shifted codes performing better than sequentially shifted ones.

EURASIP Journal on Advances in Signal Processing•Apr 19, 2007•12 citations

Flexible Construction of High-Girth QC-LDPC Codes

Gabofetswe Malema

This article presents a highly flexible method for constructing high-girth quasi-cyclic low-density parity-check (QC-LDPC) codes. The proposed algorithm constructs a Tanner graph formed by connecting groups of rows (check nodes) and columns (variable nodes) of the constructed code. To obtain a sub-matrix structure, rows and columns are divided into groups of equal sizes. Rows and columns in a group are connected in their numerical (positional) order to obtain a cyclic structure. Connected rows and columns must satisfy the desired minimum cycle length. We present conditions that guarantee desired girths. The proposed algorithm is by far more flexible in constructing a wide range (rates and lengths) of regular and irregular QC-LDPC codes compared to existing methods. The algorithm, which has linear complexity with respect to the number of rows or columns, provides an easy and fast way to construct QC-LDPC codes. Constructed codes show good bit error rate performances.

International journal of computer science and applications•Aug 1, 2012•2 citations

Constructing Quasi-Cyclic LDPC codes Using a Search Algorithm

Gabofetswe Malema

This article presents a search algorithm for constructing regular and irregular quasi-cyclic LDPC codes. Code rows and columns are divided into j (column weight) and k (row-weight) or more groups respectively. Rows or columns in a group are connected to the same group and in order of appearance. Grouping of rows and columns forms sub-matrices. The sequential row-column connections order creates a cyclic structure in sub-matrices. The row-column constraint is observed to avoid four-cycles. The proposed algorithm is flexible compared to other methods. It obtains codes over a wide range of girths, rates and lengths. Bit-error rate simulations show that obtained codes have good performance with randomly searched codes performing better that sequentially searched codes.

IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)•Dec 1, 2007•3 citations

Newly Designed Quasi-Cyclic Low Density Parity Check Codes

Abid Yahya, Othman Sidek, Fadzli Mohamed Nazri +2 more

Abstract — This paper presents the construction of large girth Quasi-Cyclic low density parity check (QC-LDPC) codes. The row groups are paired two times the row weight which has cut down hardware implementation cost and complexity as compared to the connection of individual columns and rows. The construction of newly obtained codes gives a class of efficiently encodable quasi-cyclic LDPC codes.

•Jan 1, 2009•0 citations

Row Division Method to Generate QC-LDPC Codes

Abid Yahya, Othman Sidek, Mohd Fadzli Mohd Salleh +1 more

To cut down the hardware implementation cost this paper presents an efficient method to construct large girth Quasi-Cyclic low density parity check (QC-LDPC) codes. The row groups are paired two times the row weight, which has the complexity as compared to the connection of individual columns and rows. The complexity of directing within groups estimates on the transposition employed to connect rows and columns between groups. The newly obtained codes are incorporated with diversity techniques and are employed as a forward error correction codes to cater for some anti-jamming (AJ) competences in the presence of partial band noise jamming (PBNJ). The robustness of two girth-twelve QC-LDPC codes is evidenced by comparing it with randomly constructed LDPC codes and QC-LDPC codes proposed in [14].

International Conference on Internet and Web Applications and Services•Jan 1, 2009•3 citations

A new Quasi-Cyclic low density parity check codes

Abid Yahya, Othman Sidek, Mohd Fadzli Mohd Salleh +1 more

This paper proposes a new technique for constructing the Quasi-Cyclic low density parity check (QC-LDPC) codes based on row division method. The new codes offer more flexibility in term of girth, code rates and codeword length. In this method of code construction, the rows are used to form as the distance graph. Then they are transformed to a parity-check matrix in order to acquire the desired girth. The new QC-LDPC codes show good bit-error rate performance as compared to the renowned Mackay codes for given values of Eb/Noby 0.12 dB at BER of10-7.

IEEE Symposium on Industrial Electronics & Applications (ISIEA)•Oct 1, 2009•5 citations
In this paper a modified bit-filling algorithm is used for constructing column-weight two quasi-cyclic low-density parity-check codes with large girths. Code rows are divided into groups. A column is connected to two rows from different groups, which are apart by at least a specified minimum length. Rows that meet the minimum length are searched sequentially. Group rows are connected to consecutive columns resulting in a cyclic structure in the code matrix. Larger codes can be obtained by using larger row groups. Compared to other methods, the algorithm provides an easy and fast way to construct codes of a wide range of rates, girths and lengths. Constructed codes show good bit error rate performance. They are also easily implementable in hardware compared to those obtained using the original bit filling algorithm
This article introduces a search algorithm for constructing quasi-cyclic LDPC codes of column-weight two. To obtain a submatrix structure, rows are divided into groups of equal sizes. Rows in a group are connected in their numerical order to obtain a cyclic structure. Two rows forming a column must be at a specified distance from each other to obtain a given girth. The search for rows satisfying the distance is done sequentially or randomly. Using the proposed algorithm regular and irregular column-weight-two codes are obtained over a wide range of girths, rates, and lengths. The algorithm, which has a complexity linear with respect to the number of rows, provides an easy and fast way to construct quasi-cyclic LDPC codes. Constructed codes show good bit-error rate performance with randomly shifted codes performing better than sequentially shifted ones.
This article presents a highly flexible method for constructing high-girth quasi-cyclic low-density parity-check (QC-LDPC) codes. The proposed algorithm constructs a Tanner graph formed by connecting groups of rows (check nodes) and columns (variable nodes) of the constructed code. To obtain a sub-matrix structure, rows and columns are divided into groups of equal sizes. Rows and columns in a group are connected in their numerical (positional) order to obtain a cyclic structure. Connected rows and columns must satisfy the desired minimum cycle length. We present conditions that guarantee desired girths. The proposed algorithm is by far more flexible in constructing a wide range (rates and lengths) of regular and irregular QC-LDPC codes compared to existing methods. The algorithm, which has linear complexity with respect to the number of rows or columns, provides an easy and fast way to construct QC-LDPC codes. Constructed codes show good bit error rate performances.
This article presents a search algorithm for constructing regular and irregular quasi-cyclic LDPC codes. Code rows and columns are divided into j (column weight) and k (row-weight) or more groups respectively. Rows or columns in a group are connected to the same group and in order of appearance. Grouping of rows and columns forms sub-matrices. The sequential row-column connections order creates a cyclic structure in sub-matrices. The row-column constraint is observed to avoid four-cycles. The proposed algorithm is flexible compared to other methods. It obtains codes over a wide range of girths, rates and lengths. Bit-error rate simulations show that obtained codes have good performance with randomly searched codes performing better that sequentially searched codes.
To cut down the hardware implementation cost this paper presents an efficient method to construct large girth Quasi-Cyclic low density parity check (QC-LDPC) codes. The row groups are paired two times the row weight, which has the complexity as compared to the connection of individual columns and rows. The complexity of directing within groups estimates on the transposition employed to connect rows and columns between groups. The newly obtained codes are incorporated with diversity techniques and are employed as a forward error correction codes to cater for some anti-jamming (AJ) competences in the presence of partial band noise jamming (PBNJ). The robustness of two girth-twelve QC-LDPC codes is evidenced by comparing it with randomly constructed LDPC codes and QC-LDPC codes proposed in [14].
This paper proposes a new technique for constructing the Quasi-Cyclic low density parity check (QC-LDPC) codes based on row division method. The new codes offer more flexibility in term of girth, code rates and codeword length. In this method of code construction, the rows are used to form as the distance graph. Then they are transformed to a parity-check matrix in order to acquire the desired girth. The new QC-LDPC codes show good bit-error rate performance as compared to the renowned Mackay codes for given values of Eb/Noby 0.12 dB at BER of10-7.