TechRxiv
research_paper_gf_exp.pdf (384.56 kB)

Decoding of NB-LDPC codes over Subfields

Download (384.56 kB)
preprint
posted on 10.07.2020 by V B Wijekoon, Emanuele Viterbo, Yi Hong
In this paper, we present a novel method to expand a graph over a finite field into a larger one over one of
the original field’s subfields. This allows a number of different graph expansions for any given graph.
These expansions can be used in various applications, and we focus specifically on the case of decoding
NB-LDPC codes. Using the novel expanded graphs, it is possible to reduce decoding complexity of NB-
LDPC codes significantly with minimal performance losses.

History

Email Address of Submitting Author

wijekoon.wijekoon@monash.edu

ORCID of Submitting Author

0000-0001-6089-4315

Submitting Author's Institution

Monash University

Submitting Author's Country

Australia

Licence

Exports

Licence

Exports