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 Conference on Signal Processing

Constructions of irregular nonbinary QC-LDPC codes: Cyclotomic coset approach

Meng Lu, Lijun Zhang

Published Oct 1, 2012• 3 citations
Publisher

Abstract

A cyclotomic coset approach for constructions of irregular nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes of short length is proposed. QC-LDPC codes obtained by this method perform reasonably well over the additive white Gaussian noise (AWGN) channel with iterative decoding in terms of bit-error performance, error-floor, and decoding convergence with low decoding complexity.

DOI
10.1109/icosp.2012.6491852

Related papers

Construction of short binary QC-LDPC codes: Cyclotomic coset approach

Yanjing Zhang, Lijun Zhang

A class of short binary (3, ρ)-regular quasi-cyclic low-density parity-check (QC-LDPC) code called cyclotomic coset (CC) code is constructed on the basis of cyclotomic coset. The length of the CC codes is less than 200 bits. The CC codes perform reasonably well over the additive white Gaussian noise (AWGN) channel with iterative decoding in terms of bit-error rate and decoding convergence.

International Conference on Signal Processing•Oct 1, 2012•2 citations

Construction and Encoding of QC-LDPC Codes Using Group Rings

Hassan Khodaiemehr, Dariush Kiani

Quasi-cyclic (QC) low-density parity-check (LDPC) codes which are known as QC-LDPC codes, have many applications due to their simple encoding implementation by means of cyclic shift registers. In this paper, we construct QC-LDPC codes from group rings. A group ring is a free module (at the same time a ring) constructed in a natural way from any given ring and any given group. We present a structure based on the elements of a group ring for constructing QC-LDPC codes. Some of the previously addressed methods for constructing QC-LDPC codes based on finite fields are special cases of the proposed construction method. The constructed QC-LDPC codes perform very well over the additive white Gaussian noise (AWGN) channel with iterative decoding in terms of bit-error probability and block-error probability. Simulation results demonstrate that the proposed codes have competitive performance in comparison with the similar existing LDPC codes. Finally, we propose a new encoding method for the proposed group ring based QC-LDPC codes that can be implemented faster than the current encoding methods. The encoding complexity of the proposed method is analyzed mathematically, and indicates a significate reduction in the required number of operations, even when compared to the available efficient encoding methods that have linear time and space complexities.

arXiv:1701.00210•Jan 1, 2017•0 citations

Construction of nonbinary LDPC codes: prime difference approach

Xin Zhao, Lijun Zhang, L. L. Cheng

This paper presents an algebraic method for constructing structural nonbinary LDPC codes based on the prime difference over finite field. The approach gives a class of quasi-cyclic (QC)-LDPC codes with girth at least 6. Especially, the approach can construct a class of short length code and the decoding complexity is low. Simulation results show that the constructed codes decoded with iterative decoding perform well over the AWGN channel using BPSK transmission in terms of bit-error probability and rate of decoding convergence, collectively.

IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN)•Jan 1, 2011•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

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

Coset-based Quasi-Cyclic LDPC Code Construction

Yuansheng Tang

This paper proposes a coset-based Quasi-Cyclic Low Density Parity Check(QC LDPC) construction method and similar SFT-LDPC code construction method in order to guarantee the girth under high bitrate.It gives two necessary conditions of girth at least 6 when the size of cyclic permutation matrix is a composite number.This construction method with various lengths,rates and girth at least 6 can be flexiblely constructed.Simulation results show that the code constructed by this method is comparable to random ones in error correction performance over additive white Gaussian noise channel.

Jisuanji gongcheng•Jan 1, 2009•0 citations
A cyclotomic coset approach for constructions of irregular nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes of short length is proposed. QC-LDPC codes obtained by this method perform reasonably well over the additive white Gaussian noise (AWGN) channel with iterative decoding in terms of bit-error performance, error-floor, and decoding convergence with low decoding complexity.
Quasi-cyclic (QC) low-density parity-check (LDPC) codes which are known as QC-LDPC codes, have many applications due to their simple encoding implementation by means of cyclic shift registers. In this paper, we construct QC-LDPC codes from group rings. A group ring is a free module (at the same time a ring) constructed in a natural way from any given ring and any given group. We present a structure based on the elements of a group ring for constructing QC-LDPC codes. Some of the previously addressed methods for constructing QC-LDPC codes based on finite fields are special cases of the proposed construction method. The constructed QC-LDPC codes perform very well over the additive white Gaussian noise (AWGN) channel with iterative decoding in terms of bit-error probability and block-error probability. Simulation results demonstrate that the proposed codes have competitive performance in comparison with the similar existing LDPC codes. Finally, we propose a new encoding method for the proposed group ring based QC-LDPC codes that can be implemented faster than the current encoding methods. The encoding complexity of the proposed method is analyzed mathematically, and indicates a significate reduction in the required number of operations, even when compared to the available efficient encoding methods that have linear time and space complexities.
This paper presents an algebraic method for constructing structural nonbinary LDPC codes based on the prime difference over finite field. The approach gives a class of quasi-cyclic (QC)-LDPC codes with girth at least 6. Especially, the approach can construct a class of short length code and the decoding complexity is low. Simulation results show that the constructed codes decoded with iterative decoding perform well over the AWGN channel using BPSK transmission in terms of bit-error probability and rate of decoding convergence, collectively.
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.
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.
This paper proposes a coset-based Quasi-Cyclic Low Density Parity Check(QC LDPC) construction method and similar SFT-LDPC code construction method in order to guarantee the girth under high bitrate.It gives two necessary conditions of girth at least 6 when the size of cyclic permutation matrix is a composite number.This construction method with various lengths,rates and girth at least 6 can be flexiblely constructed.Simulation results show that the code constructed by this method is comparable to random ones in error correction performance over additive white Gaussian noise channel.