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

Procedia Computer Science

A Novel Construction of QC-LDPC Codes Based on Combinatorial Mathematics

Peng Daqin, Zhu Shumin, Song Jing

Published Jan 1, 2018• 4 citations
Publisher

Abstract

In order to solve the problems of high coding complexity and inflexible code length selection in quasi-cyclic low-density Parity-check (QC-LDPC) codes, a deterministic structure is proposed based on the perfect cyclic difference sets. The number of shifts of base matrix can be obtained by a simple addition and subtraction. Because of the special structure of the base matrix and the perfect cyclic difference sets, it saves the storage space and reduces the complexity of the hardware implementation. The girth is at least six and the code-length and code-rate can be selected flexibly. Simulation results demonstrate that the Net Coding Gain of the irregular PCDS-QC-LDPC(2680, 1340) code based on perfect cyclic difference sets has respectively improved 0.13dB and 0.32dB than the code based on PEG-QC-LDPC(2680,1340) and array dispersion and masking AD-MASK-QC-LDPC(2680,1340) with the rate of 0.5 and the bit error rate of 10 -6 by using the sum-product algorithm iterative decoding in the additive white Gaussian channel.

DOI
10.1016/j.procs.2018.04.256

Related papers

Construction of Regular and Irregular QC-LDPC Codes: a Finite Field Approach and Masking

Xiaopeng Chen, Lin Zhou, Rui Zhao +1 more

Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes require less hardware resources due to the quasi-cyclic structure of parity-check matrices.In this paper, two improved methods for constructing QC-LDPC codes are proposed.Firstly, in order to make sure the masked LDPC codes have flexible code rate and code length, an improved construction of masking matrix is presented.The proposed regular masking matrix of QC-LDPC codes have the girth at least 6.Then, the irregular codes are constructed by using improved finite field approach and PEG algorithm, which result in large girth and less short cycles.Simulations demonstrate that the proposed QC-LDPC codes have both lower error floor and good waterfall performance.

International Symposium on Advances in Electrical, Electronics and Computer Engineering (ISAEECE)•Jan 1, 2016•1 citation

An Improved Construction Method of QC-LDPC Codes Based on the PEG Algorithm

Liqun Huang, Yuliang Wang, Ping Gong

Due to quasi-cyclic structure of parity-check matrices, Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes reduce hardware requirements, and thus they have a higher practical value than random LDPC codes. This paper proposes an improved construction method of QC-LDPC based on PEG Algorithm, and the girth of the QC-LDPC codes has an increase of 2. Firstly, a base matrix is generated by the PEG algorithm, and then the base matrix is expanded using the unit circle permutation matrix, at the same time, the short loop of the base matrix is eliminated. This approach has the advantages of the PEG algorithm and the QC-LDPC codes, and simulation results show that bit error rate (BER) performance of the QC-LDPC codes presented in this paper is the same as or exceeds the one of randomly constructed LDPC codes.

Pacific-Asia Conference on Circuits, Communications and Systems•Jul 1, 2011•4 citations

Construction of Irregular QC-LDPC Codes via Masking with ACE Optimization

Guojun Han, Yong Liang Guan, Lingjun Kong

Quasi-cyclic low-density parity-check (QC-LDPC) codes constructed by using algebraic approaches, such as finite geometry and finite field, generally have good structural properties and very low error-floors, and facilitate hardware implementation. Irregular QC-LDPC codes constructed from such QC-LDPC codes by using the masking technique, when decoded with the sum-product algorithm (SPA), have low decoding complexity, but often show early error-floors. In this paper, the relationship of cycle, girth and approximate cycle EMD (ACE) between the masking matrix and masked matrix is investigated, and the ACE algorithm is modified and used to construct the masking matrix for irregular QC-LDPC codes. Simulations demonstrate that the codes constructed by masking with ACE optimization exhibit much improved waterfall performance and lower error floors.

IEEE Communications Letters•Jan 31, 2014•34 citations

Quasi-cyclic low-density parity-check codes based on decoder optimised progressive edge growth for short blocks

Cornelius T. Healy, Rodrigo C. de Lamare

A novel construction for quasi-cyclic (QC) regular and irregular low-density parity-check (LDPC) codes based on a modification of the QC Progressive Edge Growth (PEG) algorithm is presented. Edge placement of the PEG-based algorithm is enhanced by use of the sum-product algorithm in the design of the parity-check matrix. The proposed algorithm is highly flexible in block length and rate, in particular when compared with algebraic constructions. The codes constructed by the proposed methods are tested in the AWGN channel and performance improvements are achieved. The proposed QC-LDPC codes provide an inherent trade-off between code performance and encoding/decoding complexity.

IEEE International Conference on Acoustics Speech and Signal Processing•Mar 1, 2012•3 citations

A Novel Construction Method of QC-LDPC Based on BIBD and Protograph

Sheng Huang, Rui Zhang, Jia Xueting +2 more

A novel construction method of Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) code is proposed in this paper, which is based on protograph and Balanced Block Design (BIBD) in combinational mathematics.The method is to fill the base matrix of protograph with the base set elements of BIBD in accordance with certain mathematical rules.And the base matrix of protograph proposed in the paper has special double diagonal structure, which overcomes the low weight code words in general structure and achieves rapid encoding at the same time.The QC-LDPC code in this paper possesses lower encoding complexity and less memory occupation; therefore it is easy for hardware implementation.In addition, it effectively avoids girth 4. Simulation results show that when the Bit Error Rate (BER) is 10 -7 , QC-LDPC codes based on Protograph and BIBD (PBIBD-LDPC) proposed in this paper has 0.5dB Net Coding Gain (NCG) compared with the protograph QC-LDPC codes that based on Vander monde matrix and PEG algorithm structure, and has 0.15dB NCG compared with the excellent code QC-LDPC that based on the lifting structure.

International Conference on Frontiers of Manufacturing Science and Measuring Technology (FMSMT)•Jan 1, 2017•0 citations

Construction Method of Large Girth QC-LDPC Codes Based on Lucas Sequences

Huang Shen

This paper proposes a construction method of regular(j, k) Lucas quasi-cyclic low-density parity-check(L-QC-LDPC) codes with girth at least eight based on the Lucas sequence. By this method, the girth of L-QC-LDPC codes is large, which can effectively eliminate short cycles. Besides, lower bound of circulant permutation submatrix dimension p is allowed continuous values. In addition, it can save the storage space in terms of hardware implementation which reduces the cost and complexity of hardware realization correspondingly. Simulation results show that the L-QC-LDPC codes have net coding gain(NCG) of about 2d B and 0.8d B compared with one-coincidence sequence quasi-cyclic LDPC(OCS-LDPC) codes and deterministic codes, respectively, at code rate of 1/2, code length of 1302 and bit error rate(BER) of 10?6. At the same condition, the performance of L-QC-LDPC codes is slightly better than that of the quadratic function LDPC(QF-LDPC) codes, which has an NCG improvement of around 0.1d B. Meanwhile, at code rate of 1/2, similar code length and BER of 10~(-6), the NCG of L-QC-LDPC codes outweigh about 0.5d B compared with that of QC-LDPC codes based on cyclic subgroups of finite fields.

Dianzi Ke-ji Daxue xuebao•Jan 1, 2016•0 citations
In order to solve the problems of high coding complexity and inflexible code length selection in quasi-cyclic low-density Parity-check (QC-LDPC) codes, a deterministic structure is proposed based on the perfect cyclic difference sets. The number of shifts of base matrix can be obtained by a simple addition and subtraction. Because of the special structure of the base matrix and the perfect cyclic difference sets, it saves the storage space and reduces the complexity of the hardware implementation. The girth is at least six and the code-length and code-rate can be selected flexibly. Simulation results demonstrate that the Net Coding Gain of the irregular PCDS-QC-LDPC(2680, 1340) code based on perfect cyclic difference sets has respectively improved 0.13dB and 0.32dB than the code based on PEG-QC-LDPC(2680,1340) and array dispersion and masking AD-MASK-QC-LDPC(2680,1340) with the rate of 0.5 and the bit error rate of 10 -6 by using the sum-product algorithm iterative decoding in the additive white Gaussian channel.
Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes require less hardware resources due to the quasi-cyclic structure of parity-check matrices.In this paper, two improved methods for constructing QC-LDPC codes are proposed.Firstly, in order to make sure the masked LDPC codes have flexible code rate and code length, an improved construction of masking matrix is presented.The proposed regular masking matrix of QC-LDPC codes have the girth at least 6.Then, the irregular codes are constructed by using improved finite field approach and PEG algorithm, which result in large girth and less short cycles.Simulations demonstrate that the proposed QC-LDPC codes have both lower error floor and good waterfall performance.
Due to quasi-cyclic structure of parity-check matrices, Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes reduce hardware requirements, and thus they have a higher practical value than random LDPC codes. This paper proposes an improved construction method of QC-LDPC based on PEG Algorithm, and the girth of the QC-LDPC codes has an increase of 2. Firstly, a base matrix is generated by the PEG algorithm, and then the base matrix is expanded using the unit circle permutation matrix, at the same time, the short loop of the base matrix is eliminated. This approach has the advantages of the PEG algorithm and the QC-LDPC codes, and simulation results show that bit error rate (BER) performance of the QC-LDPC codes presented in this paper is the same as or exceeds the one of randomly constructed LDPC codes.
Quasi-cyclic low-density parity-check (QC-LDPC) codes constructed by using algebraic approaches, such as finite geometry and finite field, generally have good structural properties and very low error-floors, and facilitate hardware implementation. Irregular QC-LDPC codes constructed from such QC-LDPC codes by using the masking technique, when decoded with the sum-product algorithm (SPA), have low decoding complexity, but often show early error-floors. In this paper, the relationship of cycle, girth and approximate cycle EMD (ACE) between the masking matrix and masked matrix is investigated, and the ACE algorithm is modified and used to construct the masking matrix for irregular QC-LDPC codes. Simulations demonstrate that the codes constructed by masking with ACE optimization exhibit much improved waterfall performance and lower error floors.
A novel construction for quasi-cyclic (QC) regular and irregular low-density parity-check (LDPC) codes based on a modification of the QC Progressive Edge Growth (PEG) algorithm is presented. Edge placement of the PEG-based algorithm is enhanced by use of the sum-product algorithm in the design of the parity-check matrix. The proposed algorithm is highly flexible in block length and rate, in particular when compared with algebraic constructions. The codes constructed by the proposed methods are tested in the AWGN channel and performance improvements are achieved. The proposed QC-LDPC codes provide an inherent trade-off between code performance and encoding/decoding complexity.
A novel construction method of Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) code is proposed in this paper, which is based on protograph and Balanced Block Design (BIBD) in combinational mathematics.The method is to fill the base matrix of protograph with the base set elements of BIBD in accordance with certain mathematical rules.And the base matrix of protograph proposed in the paper has special double diagonal structure, which overcomes the low weight code words in general structure and achieves rapid encoding at the same time.The QC-LDPC code in this paper possesses lower encoding complexity and less memory occupation; therefore it is easy for hardware implementation.In addition, it effectively avoids girth 4. Simulation results show that when the Bit Error Rate (BER) is 10 -7 , QC-LDPC codes based on Protograph and BIBD (PBIBD-LDPC) proposed in this paper has 0.5dB Net Coding Gain (NCG) compared with the protograph QC-LDPC codes that based on Vander monde matrix and PEG algorithm structure, and has 0.15dB NCG compared with the excellent code QC-LDPC that based on the lifting structure.
This paper proposes a construction method of regular(j, k) Lucas quasi-cyclic low-density parity-check(L-QC-LDPC) codes with girth at least eight based on the Lucas sequence. By this method, the girth of L-QC-LDPC codes is large, which can effectively eliminate short cycles. Besides, lower bound of circulant permutation submatrix dimension p is allowed continuous values. In addition, it can save the storage space in terms of hardware implementation which reduces the cost and complexity of hardware realization correspondingly. Simulation results show that the L-QC-LDPC codes have net coding gain(NCG) of about 2d B and 0.8d B compared with one-coincidence sequence quasi-cyclic LDPC(OCS-LDPC) codes and deterministic codes, respectively, at code rate of 1/2, code length of 1302 and bit error rate(BER) of 10?6. At the same condition, the performance of L-QC-LDPC codes is slightly better than that of the quadratic function LDPC(QF-LDPC) codes, which has an NCG improvement of around 0.1d B. Meanwhile, at code rate of 1/2, similar code length and BER of 10~(-6), the NCG of L-QC-LDPC codes outweigh about 0.5d B compared with that of QC-LDPC codes based on cyclic subgroups of finite fields.