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

MATEC Web of Conferences

Optimized Puncturing of the Check Matrix for Rate-Compatible LDPC Codes

Liang Zhang, Jiahui Meng, Danfeng Zhao

Published Jan 1, 2018• 0 citations
Publisher

Abstract

In the wireless communication system, it is necessary to change the transmitted code word or code rate in real time according to the channel environment, designing and implementing rate compatible codes is of great practical significance. In allusion to the defects of algebraically constructed QC-LDPC codes algorithm and the time-varying characteristics of wireless channel, we propose an algorithm based on check matrix optimization puncturing technique to construct QC-LDPC codes in this paper. The algorithm selects a high rate matrix with excellent performance as the parent matrix, and then uses the backward node puncturing method to puncture the information bits in the code word from the last column of the check matrix by a multiple of the number of rows to obtain a low rate matrix. The simulation results show that the rate-compatible non-binary LDPC codes constructed by this algorithm not only reduces the complexity of hardware implementation, but also improves the error correction performance of the non-binary LDPC codes, realizes the rate-compatible coding at the same time, and improves the average effectiveness and reliability of the communication system.

DOI
10.1051/matecconf/201821401002

Related papers

A New Nonbinary Quasi-cyclic LDPC Codes Construction Algorithm

Tong Ningning -, WU Yu-ping

An algorithm for constructing nonbinary Quasi-cyclic LDPC (QC-LDPC) codes on the basis of masking and puncturing techniques in consideration of the shortage of algebraic construction algorithm and time-varying performance of wireless channels is proposed . This scheme can reduce the complexity of the hardware implementation, enhance the error correction performance of the LDPC codes constructed by structure algorithm based on masking technology, and improve the average effectiveness of the communication system by realizing a rate-compatible encoding based on puncturing technology. The simulation results show that the nonbinary LDPC codes constructed with masking and puncturing techniques can provide significantly stronger error correction capabilities as compared with those constructed with algebraic method which are used directly.

International Journal of Advancements in Computing Technology•Apr 30, 2013•3 citations

On Several Kinds of Non-binary Rate-compatible LDPC Codes

XU Jia-pin

Several kinds of non-binary rate-compatible LDPC codes with strong error-detecting ability and low complexity in encoding and decoding are studied and constructed.An efficient punctured encoding algorithm of parity bit is proposed,thus to get high-performance non-binary RC-LDPC codes.The punctured algorithm,based on the non-binary mother code with high performance and medium bit rate(1/2 rate),adopts efficient structured punctured algorithm and designs the high-performance error correction codes in a wide rate range(for example,from 1/10 to 9/10).The simulation results indicate that this algorithm is better in performance than the conventional random puncturing algorithm and the puncturing algorithm based on node grouping and sorting.

Communications technology•Jan 1, 2012•0 citations

Hybrid of check matrix construction algorithm based on iteration coding algorithm

Jiahui Meng, Zhao Danfeng, Liang Zhang

In order to ensure the reliability, stability and high transmission rate of fifth-generation mobile communication technology(5G), this paper proposes a hybrid check matrix construction algorithm based on iterative coding algorithm with linear coding complexity. Firstly, this paper improves the traditional iterative coding algorithm and makes it suitable for non-binary low density parity check(NB-LDPC) codes. Then it adopts backward iterative method to change the coding scheme and the structure of the check matrix so that the progressive edge growth(PEG) algorithm has a lower triangular structure and uses it as the base matrix. Finally, a QC-LDPC algorithm with a lower triangular structure is used to generate a cyclic shift matrix and a finite field coefficient matrix. At the same time, the effect of the short loop is eliminated, and an optimal check matrix is selected from the algorithm. Simulation results show that the non-binary LDPC code constructed by the hybrid construction algorithm not only has linear coding and storage complexity, but also has strong error correction capability.

•Sep 1, 2018•0 citations

A non-greedy puncturing method for rate-compatible LDPC codes

Lin Zhou, Wei‐Cheng Huang, Rui Zhao +1 more

In this paper, we propose a non-greedy punctur- ing method for constructing binary rate-compatible low-density parity-check codes. First, we show that the recovery error prob- ability for a punctured variable node can be reduced by allocat- ing a small number of unpunctured variable nodes in the recovery tree. Then, we redefine the recovery tree according to the princi- ple of iterative decoding with the sum-product algorithm. The pro- posed non-greedy puncturing algorithm lies mainly in the dynam- ical minimization of the number of unpunctured variable nodes in the redefined recovery tree for the punctured variable nodes. Fi- nally, simulation results show that the proposed puncturing algo- rithm outperforms the existing best puncturing algorithms in bit error rate performances of iterative decoding.

Journal of Communications and Networks•Feb 1, 2017•5 citations

Design of rate-compatible protograph LDPC codes

Lin Wang

Over time-varying wireless channel,it is necessary for error-correction codes to be rate-compatible.Protograph LDPC codes can achieve rate-compatibility through and extending;and solve the problem that the encoders of tradition LDPC codes are more complex.With the AR4JA code which can be represented by protograph,we construct a rate-compatible family of AR4JA codes with rates ranging from 0.5 to 0.8 using the algorithm of puncturing node by node.To obtain the lower rates from 0.5 to 0.25,matrix expansion is also used.Simulation results over AWGN channel show that using both and extending we can construct rate-compatible family of AR4JA codes which do not suffer from error floor when BER is 10-6.

Journal of Chongqing University of Posts and Telecommunications•Jan 1, 2012•0 citations

Optimized Construction of Short and High Rate Protograph QC-LDPC Codes

Jianrong Bao, Xiaorong Xu, Chao Liu +2 more

To obtain efficient and pragmatic channel codes high signal-to-noise ratios (SNRs), an optimized construction of short and high rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is presented. Based on an optimized protograph template, the code framework is firstly produced by the extensions of the variable nodes. By enlarging the dimension of the sub-matrices related to the protograph framework, the base quasi-cyclic (QC) matrix is generated with required code rate and length. Then, the elements in the base matrix are split with even smaller square sub-matrices of the same row and column weights. In this procedure, a progressive edge growth (PEG) algorithm is employed to find the optimized positions of the QC submatrices, which brings larger girth for better code performance. Also the circulant offsets in all QC sub-matrices are optimally searched by a QC improved approximated cycle extrinsic message degree (QCI-ACE) algorithm, which improves the relationship of the unavoidable loops in the code's Tanner graph and thus it improves the error floor. Simulation results show that the codes produced by the proposed method demonstrate quite good bit error rate (BER) performance. In addition, they exhibit good properties of high spectrum efficiency by the high code rate, as well as the low complexity by the short code length. Therefore, the proposed code construction can be efficiently applied in the design of short and high rate protograph QC-LDPC codes with high rate and rational complexity.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 20, 2021•1 citation
In the wireless communication system, it is necessary to change the transmitted code word or code rate in real time according to the channel environment, designing and implementing rate compatible codes is of great practical significance. In allusion to the defects of algebraically constructed QC-LDPC codes algorithm and the time-varying characteristics of wireless channel, we propose an algorithm based on check matrix optimization puncturing technique to construct QC-LDPC codes in this paper. The algorithm selects a high rate matrix with excellent performance as the parent matrix, and then uses the backward node puncturing method to puncture the information bits in the code word from the last column of the check matrix by a multiple of the number of rows to obtain a low rate matrix. The simulation results show that the rate-compatible non-binary LDPC codes constructed by this algorithm not only reduces the complexity of hardware implementation, but also improves the error correction performance of the non-binary LDPC codes, realizes the rate-compatible coding at the same time, and improves the average effectiveness and reliability of the communication system.
An algorithm for constructing nonbinary Quasi-cyclic LDPC (QC-LDPC) codes on the basis of masking and puncturing techniques in consideration of the shortage of algebraic construction algorithm and time-varying performance of wireless channels is proposed . This scheme can reduce the complexity of the hardware implementation, enhance the error correction performance of the LDPC codes constructed by structure algorithm based on masking technology, and improve the average effectiveness of the communication system by realizing a rate-compatible encoding based on puncturing technology. The simulation results show that the nonbinary LDPC codes constructed with masking and puncturing techniques can provide significantly stronger error correction capabilities as compared with those constructed with algebraic method which are used directly.
Several kinds of non-binary rate-compatible LDPC codes with strong error-detecting ability and low complexity in encoding and decoding are studied and constructed.An efficient punctured encoding algorithm of parity bit is proposed,thus to get high-performance non-binary RC-LDPC codes.The punctured algorithm,based on the non-binary mother code with high performance and medium bit rate(1/2 rate),adopts efficient structured punctured algorithm and designs the high-performance error correction codes in a wide rate range(for example,from 1/10 to 9/10).The simulation results indicate that this algorithm is better in performance than the conventional random puncturing algorithm and the puncturing algorithm based on node grouping and sorting.
In order to ensure the reliability, stability and high transmission rate of fifth-generation mobile communication technology(5G), this paper proposes a hybrid check matrix construction algorithm based on iterative coding algorithm with linear coding complexity. Firstly, this paper improves the traditional iterative coding algorithm and makes it suitable for non-binary low density parity check(NB-LDPC) codes. Then it adopts backward iterative method to change the coding scheme and the structure of the check matrix so that the progressive edge growth(PEG) algorithm has a lower triangular structure and uses it as the base matrix. Finally, a QC-LDPC algorithm with a lower triangular structure is used to generate a cyclic shift matrix and a finite field coefficient matrix. At the same time, the effect of the short loop is eliminated, and an optimal check matrix is selected from the algorithm. Simulation results show that the non-binary LDPC code constructed by the hybrid construction algorithm not only has linear coding and storage complexity, but also has strong error correction capability.
In this paper, we propose a non-greedy punctur- ing method for constructing binary rate-compatible low-density parity-check codes. First, we show that the recovery error prob- ability for a punctured variable node can be reduced by allocat- ing a small number of unpunctured variable nodes in the recovery tree. Then, we redefine the recovery tree according to the princi- ple of iterative decoding with the sum-product algorithm. The pro- posed non-greedy puncturing algorithm lies mainly in the dynam- ical minimization of the number of unpunctured variable nodes in the redefined recovery tree for the punctured variable nodes. Fi- nally, simulation results show that the proposed puncturing algo- rithm outperforms the existing best puncturing algorithms in bit error rate performances of iterative decoding.
Over time-varying wireless channel,it is necessary for error-correction codes to be rate-compatible.Protograph LDPC codes can achieve rate-compatibility through and extending;and solve the problem that the encoders of tradition LDPC codes are more complex.With the AR4JA code which can be represented by protograph,we construct a rate-compatible family of AR4JA codes with rates ranging from 0.5 to 0.8 using the algorithm of puncturing node by node.To obtain the lower rates from 0.5 to 0.25,matrix expansion is also used.Simulation results over AWGN channel show that using both and extending we can construct rate-compatible family of AR4JA codes which do not suffer from error floor when BER is 10-6.
To obtain efficient and pragmatic channel codes high signal-to-noise ratios (SNRs), an optimized construction of short and high rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is presented. Based on an optimized protograph template, the code framework is firstly produced by the extensions of the variable nodes. By enlarging the dimension of the sub-matrices related to the protograph framework, the base quasi-cyclic (QC) matrix is generated with required code rate and length. Then, the elements in the base matrix are split with even smaller square sub-matrices of the same row and column weights. In this procedure, a progressive edge growth (PEG) algorithm is employed to find the optimized positions of the QC submatrices, which brings larger girth for better code performance. Also the circulant offsets in all QC sub-matrices are optimally searched by a QC improved approximated cycle extrinsic message degree (QCI-ACE) algorithm, which improves the relationship of the unavoidable loops in the code's Tanner graph and thus it improves the error floor. Simulation results show that the codes produced by the proposed method demonstrate quite good bit error rate (BER) performance. In addition, they exhibit good properties of high spectrum efficiency by the high code rate, as well as the low complexity by the short code length. Therefore, the proposed code construction can be efficiently applied in the design of short and high rate protograph QC-LDPC codes with high rate and rational complexity.