On hard-decision decoding of product codes

Ferdinand Blomqvist*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

Abstract

In this paper we review existing hard-decision decoding algorithms for product codes along with different post-processing techniques used in conjunction with the iterative decoder for product codes. We improve the decoder by Reddy and Robinson and use it to create a new post-processing technique. The performance of this new post-processing technique is evaluated through simulations, and these suggest that our new post-processing technique outperforms previously known post-processing techniques which are not tailored for specific codes. The cost of using the new post-processing technique is that the algorithm becomes more complex. However, the post-processing is applied very rarely unless the channel is very noisy, and hence the increase in computational complexity is negligible for most choices of parameters. Finally, we propose a new algorithm that combines existing techniques in a way that avoids the error floor with short relatively high rate codes. The algorithm should also avoid the error floor with long high rate codes, but further work is needed to confirm this.

Original languageEnglish
Number of pages18
JournalApplicable Algebra in Engineering, Communications and Computing
DOIs
Publication statusE-pub ahead of print - 2021
MoE publication typeA1 Journal article-refereed

Keywords

  • Concatenated codes
  • Decoding
  • Linear codes
  • Product codes

Fingerprint

Dive into the research topics of 'On hard-decision decoding of product codes'. Together they form a unique fingerprint.

Cite this