A novel graph expansion and a decoding algorithm for NB-LDPC codes

V. B. Wijekoon, Emanuele Viterbo, Yi Hong, Rino Micheloni, Alessia Marelli

Research output: Contribution to journalArticleResearchpeer-review

10 Citations (Scopus)


Non-binary low-density parity-check (NB-LDPC) codes are known to offer several advantages over their binary counterparts, but the higher complexity, and the resource-hungry nature of decoding algorithms have so far restricted their practical usage. In this paper, we propose a new decoding algorithm for NB-LDPC codes over finite fields of characteristic 2, based on a novel binary expansion of the {Q}-Ary Tanner graph. While it offers substantial complexity gains, simulation results demonstrate that the performance loss of the new algorithm, in comparison to the best known decoder, is quite small. Furthermore, due to being based on a binary graph, it is particularly attractive for hardware implementations. We also suggest a simplified version of the algorithm, which offers even higher gains in complexity.

Original languageEnglish
Pages (from-to)1358-1369
Number of pages12
JournalIEEE Transactions on Communications
Issue number3
Publication statusPublished - Mar 2020


  • graph expansion
  • iterative decoding
  • Non-binary LDPC codes

Cite this