Approaching Capacity at High Rates with Iterative Hard-Decision Decoding
From MaRDI portal
Publication:4589405
DOI10.1109/TIT.2017.2717838zbMATH Open1374.94867arXiv1202.6095OpenAlexW2653587054MaRDI QIDQ4589405FDOQ4589405
Authors: Yung-Yih Jian, Henry David Pfister, Krishna R. Narayanan 
Publication date: 10 November 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their component codes. In this paper, we show that one can approach capacity at high rates using iterative hard-decision decoding (HDD) of generalized product codes. Specifically, a class of spatially-coupled GLDPC codes with BCH component codes is considered, and it is observed that, in the high-rate regime, they can approach capacity under the proposed iterative HDD. These codes can be seen as generalized product codes and are closely related to braided block codes. An iterative HDD algorithm is proposed that enables one to analyze the performance of these codes via density evolution (DE).
Full work available at URL: https://arxiv.org/abs/1202.6095
This page was built for publication: Approaching Capacity at High Rates with Iterative Hard-Decision Decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589405)
