2020 IEEE International Symposium on Information Theory (ISIT) 2020
DOI: 10.1109/isit44484.2020.9174489
|View full text |Cite
|
Sign up to set email alerts
|

A Low Complexity Decoding Algorithm for NB-LDPC Codes over Quadratic Extension Fields

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…12 shows the number of addition and multiplication operations needed for GF(4) and GF(8)-LDPC CND respectively. If more advanced non-binary LDPC decoding algorithm is employed [42]- [46], the decoding complexity of GF(8)-LDPC can be further reduced but is out of the scope of this work.…”
Section: A Ber Simulation Resultsmentioning
confidence: 99%
“…12 shows the number of addition and multiplication operations needed for GF(4) and GF(8)-LDPC CND respectively. If more advanced non-binary LDPC decoding algorithm is employed [42]- [46], the decoding complexity of GF(8)-LDPC can be further reduced but is out of the scope of this work.…”
Section: A Ber Simulation Resultsmentioning
confidence: 99%