Approaching capacity at high rates with iterative hard-decision decoding

Published

Conference Paper

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 analyze a class of spatially-coupled generalized LDPC codes and observe that, in the high-rate regime, they can approach capacity under iterative hard-decision decoding. These codes can be seen as generalized product codes and are closely related to braided block codes. © 2012 IEEE.

Full Text

Duke Authors

Cited Authors

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

Published Date

  • October 22, 2012

Published In

  • Ieee International Symposium on Information Theory Proceedings

Start / End Page

  • 2696 - 2700

International Standard Book Number 13 (ISBN-13)

  • 9781467325790

Digital Object Identifier (DOI)

  • 10.1109/ISIT.2012.6284009

Citation Source

  • Scopus