Improving Spatially Coupled LDPC Codes by Connecting Chains

被引：0

作者：

Truhachev, Dmitri ^{[1
]}

Mitchell, David G. M. ^{[1
]}

Lentmaier, Michael ^{[1
]}

Costello, Daniel J., Jr. ^{[1
]}

机构：

[1] Univ Alberta, Dept Comp Sci, Edmonton, AB, Canada

来源：

2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2012年

关键词：

CONVOLUTIONAL-CODES;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we study ensembles of connected spatially coupled low-density parity-check codes (SC-LDPCCs), i.e., ensembles described by graphs in which regular SC-LDPCC chains of various lengths serve as edges. We show that, by carefully connecting individual SC-LDPCC chains, we obtain LDPC code ensembles with improved iterative decoding thresholds compared to those of a single coupled chain, in addition to reducing the decoding complexity required to achieve a specific bit error probability. Moreover, we show that, like the component SC-LDPCC chains, the proposed constructions have a typical minimum distance that grows linearly with block length.

引用

页码：468 / 472

页数：5

共 19 条

[1]

[Anonymous], 2003, 42154 INP JET PROP L

[2]

Divsalar D., 2006, P IEEE INT S INF THE

[3] Time-varying periodic convolutional codes with low-density parity-check matrix [J].