Technical Program

Paper Detail

Paper IDC.4.1
Paper Title A Low Complexity Decoding Algorithm for NB-LDPC Codes over Quadratic Extension Fields
Authors Viduranga Bandara Wijekoon, Emanuele Viterbo, Yi Hong, Monash University, Australia
Session C.4: LDPC Codes
Presentation Lecture
Track Coding for Communications
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract 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.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!