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 Wireless Communications and Signal Processing (WCSP)

An algebraic approach to design low rate low density parity check code

Zhe Zhang, Liang Zhou, Junyi Du, Shenglong Peng

Published Oct 1, 2017• 1 citation
Publisher

Abstract

In this paper, we propose an algebraic approach to design extremely low rate low-density parity-check (LDPC) codes by employing the primitive polynomials. We first investigate the requirements for the polynomials to construct 4-cycle free LDPC codes and then propose an algebraic approach to design the parity check matrix. To achieve a better decoding performance in the extremely low rate region, we propose an extension method to construct more check nodes and virtual variable nodes to obtain more constraints. Our designed LDPC codes have simple encoding and simple decoding features. Simulation results show that our proposed rate-0.03 LDPC code can achieve 2.2 dB gain, compared to the LDPC code designed by the progressive edge growth algorithm with the optimized edge degree distributions described in [7].

DOI
10.1109/wcsp.2017.8171065

Related papers

An Algebraic Construction of Quasi-Cyclic LDPC Codes Based on the Conjugates of Primitive Elements over Finite Fields

Muhammad Asif, Wuyang Zhou, Juma Saidi Ally +2 more

Recently, there have been major developments in utilizing the finite fields to construct Low-density Parity-check (LDPC) codes. In this correspondence, an algebraic approach based on the conjugates of primitive elements over finite fields to construct Quasi-Cyclic (QC) Low-Density Parity-Check codes is presented. Proposed QC-LDPC codes provide an excellent error performance with Belief Propagation (BP) decoding over an Additive White Gaussian Noise (AWGN) channel. Based on numerical results, the performance analysis shows that the proposed QC-LDPC codes perform as well as the randomly constructed Progressive edge growth (PEG) LDPC codes and algebraic QC-LDPC in the lower signal-to-noise ratio (SNR) region but outperform their counterparts in the higher SNR region. Also, the codes constructed are QC in nature, so the encoding can be done with shift register circuits having linear complexity.

IEEE International Conference on Communication Technology (ICCT)•Oct 1, 2018•3 citations

Construction of LDPC Codes Based on Narrow-Sense-Primitive BCH Codes

Yi Yu, Liu Shaobo, Huang Dawei

In this paper, we present an algebraic method for constructing regular low-density parity-check (LDPC) codes based on narrow-sense-primitive BCH codes. The construction method results in a class of high rate LDPC codes in Gallager's original form. Codes in this class are free of cycles of length 4 in their Tanner graph and have good minimum distances. They can perform well with the iterative decoding. Also, proposed algebra LDPC codes can be designed for a new class of irregular codes based on a semi-algebraic structure for various code rates. It is shown that, with the proposed construction algorithms, fast construction time and reduced memory without the performance degradation can be achieved.

IEEE Vehicular Technology Conference•Dec 10, 2005•5 citations

The Design of Structured Low-Density Parity-Check Codes With Large Girth

Jing Long

This paper,based on algebra and graph,proposes a method for constructing structured low-density parity-check(LDPC) codes.In this method,the authors design a connected graph with three kinds of special path to ensure that the Tanner graph of the parity check matrix mapped from the connected graph is without short cycles.The construction method results in two classes of(3,k)-regular quasi-cyclic LDPC codes with girth 8 and 12 respectively.Furthermore,by extending this construction method,two classes of LDPC codes with column weight 2,whose girths are respectively 16 and 24,can be obtained.The simulation studies show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels with iterative decoding.At the BER of 10-5,the new proposed(3,6)-regular(4356,2205) QC-LDPC code performs 1.48dB from the Shannon limit.Moreover,it outperforms the random regular LDPC code of comparable parameters by 0.1dB.For the new proposed structured LDPC codes with column weight 2,they can achieve about 2dB coding gains with respect to the random regular LDPC codes with similar block lengths and code rates.

Chinese Journal of Computers•Jan 1, 2007•1 citation

Efficient Design of Structured LDPC Codes

Biwoong Chung, Joon-Sung Kim, Song Hong-Yeop

The high encoding complexity of LDPC codes can be solved by designing structured parity-check matrix. If the parity-check matrix of LDPC codes is composed of same type of blocks, decoder implementation can be simple, this structure allow structured decoding and required memory for storing the parity-check matrix can be reduced largely. In this paper, we propose a construction algorithm for short block length structured LDPC codes based on girth condition, PEG algorithm and variable node connectivity. The code designed by this algorithm shows similar performance to other codes without structured constraint in low SNR and better performance in high SNR than those by simulation

한국통신학회논문지•Jan 1, 2006•1 citation

LDPC 부호의 경판정 복호를 위한 전처리

양대열, 양경철

Low-density parity-check (LDPC) codes achieve the performance near to the Shannon limit by iterative decoding. They are extensively employed in communication system standards because of their capacity-approaching performance and low decoding complexity. \nThe composition of this thesis can be divided into two parts. Firstly, we design LDPC codes that perform at rates close to the Shannon capacity. For this we summarize three techniques for analyzing LDPC code ensembles and calculate the noise threshold of regular LDPC codes in the BIAWGN channel. And then we optimize degree distributions using the differential evolution and construct the parity-check matrix using the progressive edgegrowth \n(PEG) algorithm. \nSecondly, we examine the structure of LDPC codes in the layered division multiplexing (LDM) system. And we propose the low-complexity decoding algorithm with the simple preprocessing which is applicable in some situations. We also propose the good puncturing criterion to generate rate-compatible LDPC codes. Simulation results show that the punctured codes using the proposed method have better performance compared to randomly punctured one.

한국통신학회 학술대회논문집•Nov 1, 2015•0 citations

Low-Density Parity-Check Lattices: Construction and Decoding Analysis

Mohammad‐Reza Sadeghi, Amir H. Banihashemi, Daniel Panario

Low-density parity-check codes (LDPC) can have an impressive performance under iterative decoding algorithms. In this paper we introduce a method to construct high coding gain lattices with low decoding complexity based on LDPC codes. To construct such lattices we apply Construction D', due to Bos, Conway, and Sloane, to a set of parity checks defining a family of nested LDPC codes. For the decoding algorithm, we generalize the application of max-sum algorithm to the Tanner graph of lattices. Bounds on the decoding complexity are derived and our analysis shows that using LDPC codes results in low decoding complexity for the proposed lattices. The progressive edge growth (PEG) algorithm is then extended to construct a class of nested regular LDPC codes which are in turn used to generate low density parity check lattices. Using this approach, a class of two-level lattices is constructed. The performance of this class improves when the dimension increases and is within 3 dB of the Shannon limit for error probabilities of about 10-6. This is while the decoding complexity is still quite manageable even for dimensions of a few thousands

IEEE Transactions on Information Theory•Sep 29, 2006•89 citations
In this paper, we propose an algebraic approach to design extremely low rate low-density parity-check (LDPC) codes by employing the primitive polynomials. We first investigate the requirements for the polynomials to construct 4-cycle free LDPC codes and then propose an algebraic approach to design the parity check matrix. To achieve a better decoding performance in the extremely low rate region, we propose an extension method to construct more check nodes and virtual variable nodes to obtain more constraints. Our designed LDPC codes have simple encoding and simple decoding features. Simulation results show that our proposed rate-0.03 LDPC code can achieve 2.2 dB gain, compared to the LDPC code designed by the progressive edge growth algorithm with the optimized edge degree distributions described in [7].
Recently, there have been major developments in utilizing the finite fields to construct Low-density Parity-check (LDPC) codes. In this correspondence, an algebraic approach based on the conjugates of primitive elements over finite fields to construct Quasi-Cyclic (QC) Low-Density Parity-Check codes is presented. Proposed QC-LDPC codes provide an excellent error performance with Belief Propagation (BP) decoding over an Additive White Gaussian Noise (AWGN) channel. Based on numerical results, the performance analysis shows that the proposed QC-LDPC codes perform as well as the randomly constructed Progressive edge growth (PEG) LDPC codes and algebraic QC-LDPC in the lower signal-to-noise ratio (SNR) region but outperform their counterparts in the higher SNR region. Also, the codes constructed are QC in nature, so the encoding can be done with shift register circuits having linear complexity.
In this paper, we present an algebraic method for constructing regular low-density parity-check (LDPC) codes based on narrow-sense-primitive BCH codes. The construction method results in a class of high rate LDPC codes in Gallager's original form. Codes in this class are free of cycles of length 4 in their Tanner graph and have good minimum distances. They can perform well with the iterative decoding. Also, proposed algebra LDPC codes can be designed for a new class of irregular codes based on a semi-algebraic structure for various code rates. It is shown that, with the proposed construction algorithms, fast construction time and reduced memory without the performance degradation can be achieved.
This paper,based on algebra and graph,proposes a method for constructing structured low-density parity-check(LDPC) codes.In this method,the authors design a connected graph with three kinds of special path to ensure that the Tanner graph of the parity check matrix mapped from the connected graph is without short cycles.The construction method results in two classes of(3,k)-regular quasi-cyclic LDPC codes with girth 8 and 12 respectively.Furthermore,by extending this construction method,two classes of LDPC codes with column weight 2,whose girths are respectively 16 and 24,can be obtained.The simulation studies show that these codes can achieve better performance than randomly constructed regular LDPC codes over AWGN channels with iterative decoding.At the BER of 10-5,the new proposed(3,6)-regular(4356,2205) QC-LDPC code performs 1.48dB from the Shannon limit.Moreover,it outperforms the random regular LDPC code of comparable parameters by 0.1dB.For the new proposed structured LDPC codes with column weight 2,they can achieve about 2dB coding gains with respect to the random regular LDPC codes with similar block lengths and code rates.
The high encoding complexity of LDPC codes can be solved by designing structured parity-check matrix. If the parity-check matrix of LDPC codes is composed of same type of blocks, decoder implementation can be simple, this structure allow structured decoding and required memory for storing the parity-check matrix can be reduced largely. In this paper, we propose a construction algorithm for short block length structured LDPC codes based on girth condition, PEG algorithm and variable node connectivity. The code designed by this algorithm shows similar performance to other codes without structured constraint in low SNR and better performance in high SNR than those by simulation
Low-density parity-check (LDPC) codes achieve the performance near to the Shannon limit by iterative decoding. They are extensively employed in communication system standards because of their capacity-approaching performance and low decoding complexity. \nThe composition of this thesis can be divided into two parts. Firstly, we design LDPC codes that perform at rates close to the Shannon capacity. For this we summarize three techniques for analyzing LDPC code ensembles and calculate the noise threshold of regular LDPC codes in the BIAWGN channel. And then we optimize degree distributions using the differential evolution and construct the parity-check matrix using the progressive edgegrowth \n(PEG) algorithm. \nSecondly, we examine the structure of LDPC codes in the layered division multiplexing (LDM) system. And we propose the low-complexity decoding algorithm with the simple preprocessing which is applicable in some situations. We also propose the good puncturing criterion to generate rate-compatible LDPC codes. Simulation results show that the punctured codes using the proposed method have better performance compared to randomly punctured one.
Low-density parity-check codes (LDPC) can have an impressive performance under iterative decoding algorithms. In this paper we introduce a method to construct high coding gain lattices with low decoding complexity based on LDPC codes. To construct such lattices we apply Construction D', due to Bos, Conway, and Sloane, to a set of parity checks defining a family of nested LDPC codes. For the decoding algorithm, we generalize the application of max-sum algorithm to the Tanner graph of lattices. Bounds on the decoding complexity are derived and our analysis shows that using LDPC codes results in low decoding complexity for the proposed lattices. The progressive edge growth (PEG) algorithm is then extended to construct a class of nested regular LDPC codes which are in turn used to generate low density parity check lattices. Using this approach, a class of two-level lattices is constructed. The performance of this class improves when the dimension increases and is within 3 dB of the Shannon limit for error probabilities of about 10-6. This is while the decoding complexity is still quite manageable even for dimensions of a few thousands