An Improved Reliability-Based Decoding Algorithm for NB-LDPC Codes

Song, Suwen; Tian, Jing; Lin, Jun; Wang, Zhongfeng

doi:10.1109/lcomm.2021.3049602

Cited by 2 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the residual‐decaying‐based RBP (RD‐RBP) algorithm [17], it achieves excellent convergence performance by weighting the residual of the edges with a factor less than 1. On the other hand, P‐IISRB algorithm [18] introduces a perturbation to solve periodic point problem which is similar to the trapping set. Actually, the perturbation‐injected is analogous to the value of factor in RD‐RBP algorithm.…”

Section: Introductionmentioning

confidence: 99%

LDPC decoding with locally informed dynamic scheduling based on the law of large numbers

et al. 2022

Self Cite

View full text Add to dashboard Cite

The informed dynamic scheduling (IDS) strategies, in which the edge message with the maximum message-residual is updated preferentially, achieve remarkable error-correction performance when applied to low-density parity-check (LDPC) codes. However, the IDS strategies incur inferior convergence in iterative decoding owing to the greedy problem, which is called the update-relayed trend here. In order to solve the greediness, two locally informed dynamic scheduling algorithms based on the law of large numbers are proposed. The proposed decoding algorithms use random select of check nodes over a predefined update range (RSPUR) which effectively suppresses the propagation of the update-relayed trend and accordingly restrains the forming of multi-update cycles. Moreover, the decoding algorithm is further improved based on random select of check nodes over an adjustable update range (RSCAR). The update ranges are selected based on the law of large numbers. Therefore, the computational resources can be allocated more equitably by increasing iterations. Simulation results show that both the proposed algorithms achieve excellent performance in terms of throughput and convergence with low decoding complexity over the Additive White Gaussian Noise (AWGN) and the fading channels compared to the previous IDS strategies. Hence, the proposed algorithms behave excellently over the wireless channels.

show abstract

Section: Introductionmentioning

confidence: 99%

LDPC decoding with locally informed dynamic scheduling based on the law of large numbers

et al. 2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…Moreover, NBLDPC codes have much better performance than binary LDPC codes for the short and moderate code lengths. As much more low-complexity decoding algorithms were proposed [3][4][5][6][7][8], NBLDPC codes provide a promising coding scheme for 6G communications [9].…”

Section: Introductionmentioning

confidence: 99%

“…Based on the prime field GF (31), we can construct an 8 × 16 array HðP 8×16,1 Þ of 31 × 31 CPMs in the form of (13) by choosing the 8 rows and 16 columns from the exponent matrix P in equation(12). The indices of the chosen 8 rows and 16 columns from P are {3, 4, 5, 10, 15, 17, 24, 28} and {1,4,5,6,7,8,9,10,11,15,16,19,26,28,29, 30}, respectively. The row and column selection method is based on the proposed method in…”

mentioning

confidence: 99%

Design of Nonbinary LDPC Cycle Codes with Large Girth from Circulants and Finite Fields

Gao

et al. 2021

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

In this paper, we study a class of nonbinary LDPC (NBLDPC) codes whose parity-check matrices have column weight 2, called NBLDPC cycle codes. We propose a design framework of 2 , ρ -regular binary quasi-cyclic (QC) LDPC codes and then construct NBLDPC cycle codes of large girth based on circulants and finite fields by randomly choosing the nonzero field elements in their parity-check matrices. For enlarging the girth values, our approach is twofold. First, we give an exhaustive search of circulants with column/row weight ρ and design a masking matrix with good cycle distribution based on the edge-node relation in undirected graphs. Second, according to the designed masking matrix, we construct the exponent matrix based on finite fields. The iterative decoding performances of the constructed codes on the additive white Gaussian noise (AWGN) channel are finally provided.

show abstract

An Improved Reliability-Based Decoding Algorithm for NB-LDPC Codes

Cited by 2 publications

References 12 publications

LDPC decoding with locally informed dynamic scheduling based on the law of large numbers

LDPC decoding with locally informed dynamic scheduling based on the law of large numbers

Design of Nonbinary LDPC Cycle Codes with Large Girth from Circulants and Finite Fields

Contact Info

Product

Resources

About