Approaching Capacity at High Rates with Iterative Hard-Decision Decoding Conference Paper

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 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.

name of conference

• 2012 IEEE International Symposium on Information Theory Proceedings

authors

• Narayanan, Krishna

published proceedings

• 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)

author list (cited authors)

• Jian, Y., Pfister, H. D., & Narayanan, K. R.

citation count

• 31

complete list of authors

• Jian, Yung-Yih||Pfister, Henry D||Narayanan, Krishna R

publication date

• July 2012

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

keywords

• Braided Codes
• Density Evolution
• Gldpc Codes
• Product Codes
• Syndrome Decoding

Digital Object Identifier (DOI)

• 10.1109/isit.2012.6284009

International Standard Book Number (ISBN) 13

• 9781467325790

start page

• 2696

end page

• 2700

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fisit.2012.6284009