2020
DOI: 10.1109/tcomm.2020.3036073
|View full text |Cite
|
Sign up to set email alerts
|

Decoding of NB-LDPC codes over Subfields

Abstract: The non-binary low-density parity-check (NB-LDPC) codes can offer promising performance advantages but suffer from high decoding complexity. To tackle this challenge, in this paper, we consider NB-LDPC codes over finite fields as codes over subfields as a means of reducing decoding complexity. In particular, our approach is based on a novel method of expanding a non-binary Tanner graph over a finite field into a graph over a subfield. This approach offers several decoding strategies for a single NB-LDPC code, … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 24 publications
0
0
0
Order By: Relevance
“…68 Gb/s. The work in [343] investigated the decoding of nonbinary LDPC codes over subfields by adopting the method of expanding a non-binary Tanner graph over a finite field into a graph over a subfield, resulting in a reduction of decoding complexity. Moreover, the analysis of the trapping set and absorbing set for non-binary protograph LDPC codes is investigated in [344].…”
Section: J Decoding Of Non-binary Ldpc Codesmentioning
confidence: 99%
“…68 Gb/s. The work in [343] investigated the decoding of nonbinary LDPC codes over subfields by adopting the method of expanding a non-binary Tanner graph over a finite field into a graph over a subfield, resulting in a reduction of decoding complexity. Moreover, the analysis of the trapping set and absorbing set for non-binary protograph LDPC codes is investigated in [344].…”
Section: J Decoding Of Non-binary Ldpc Codesmentioning
confidence: 99%