A low complexity decoding algorithm for NB-LDPC codes over quadratic extension fields

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch


NB-LDPC codes, a class of codes well-known for their exceptional error correcting performance, are not yet used widely in practice due to the high complexity of decoding algorithms. In this paper, we propose a low complexity decoder for these codes by means of a novel graph expansion. We view the finite field over which the code is constructed as the quadratic extension of one of its subfields, and then expand the Tanner graph of the code into a graph over that particular field. Decoding algorithm, which is tailored for this larger graph, presents significant complexity gains while the performance loss is minimal.
Original languageEnglish
Title of host publication2020 IEEE International Symposium on Information Theory
Subtitle of host publicationProceedings
EditorsYoung-Han Kim, Frederique Oggier, Greg Wornell, Wei Yu
Place of PublicationPiscataway NJ USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Number of pages6
ISBN (Electronic)9781728164311, 981728164328
ISBN (Print)9781728164335
Publication statusPublished - 2020
EventIEEE International Symposium on Information Theory 2020 - Los Angeles, United States of America
Duration: 21 Jul 202026 Jul 2020
https://ieeexplore.ieee.org/xpl/conhome/9166581/proceeding (Proceedings)


ConferenceIEEE International Symposium on Information Theory 2020
Abbreviated titleISIT 2020
Country/TerritoryUnited States of America
CityLos Angeles
Internet address

Cite this