Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding
Information Theory
2019-01-25 v2 math.IT
Abstract
We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between conventional iterative bounded distance decoding (iBDD) and turbo product decoding based on the Chase--Pyndiah algorithm, at the expense of some increase in complexity. Furthermore, the proposed algorithm entails only a limited increase in data flow compared to iBDD.
Cite
@article{arxiv.1901.02914,
title = {Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding},
author = {Alireza Sheikh and Alexandre Graell i Amat and Gianluigi Liva},
journal= {arXiv preprint arXiv:1901.02914},
year = {2019}
}
Comments
Invited paper to the 53rd Annual Conference on Information Sciences and Systems (CISS), Baltimore, MD, March 2019. arXiv admin note: text overlap with arXiv:1806.10903