期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 63, 期 9, 页码 5752-5773出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2017.2717838
关键词
GLDPC codes; density evolution; product codes; braided codes; syndrome decoding
资金
- National Science Foundation [0747470, 1320924]
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [0747470, 1320924] Funding Source: National Science Foundation
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 harddecision 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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据