Approaching Capacity at High Rates with Iterative Hard-Decision Decoding

Published

Journal Article

© 1963-2012 IEEE. 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 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 generalized LDPC codes with Bose-Chaudhuri-Hocquengham 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.

Full Text

Duke Authors

Cited Authors

  • Jian, YY; Pfister, HD; Narayanan, KR

Published Date

  • September 1, 2017

Published In

Volume / Issue

  • 63 / 9

Start / End Page

  • 5752 - 5773

International Standard Serial Number (ISSN)

  • 0018-9448

Digital Object Identifier (DOI)

  • 10.1109/TIT.2017.2717838

Citation Source

  • Scopus