Connecting Spatially Coupled LDPC Code Chains

arxiv: 1111.5668 · v1 · pith:44Q55ZWPnew · submitted 2011-11-24 · 💻 cs.IT · cs.DM· math.IT

Connecting Spatially Coupled LDPC Code Chains

Dmitri Truhachev , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello , jr This is my paper

classification 💻 cs.IT cs.DMmath.IT

keywords chainscoupledcodeconnectingconstructeddecodingiterativeproposed

0 comments p. Extension

pith:44Q55ZWP Add to your LaTeX paper

What is a Pith Number?

\usepackage{pith}
\pithnumber{44Q55ZWP}

Prints a linked pith:44Q55ZWP badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

Codes constructed from connected spatially coupled low-density parity-check code (SC-LDPCC) chains are proposed and analyzed. It is demonstrated that connecting coupled chains results in improved iterative decoding performance. The constructed protograph ensembles have better iterative decoding thresholds compared to an individual SC-LDPCC chain and require less computational complexity per bit when operating in the near-threshold region. In addition, it is shown that the proposed constructions are asymptotically good in terms of minimum distance.

This paper has not been read by Pith yet.

Connecting Spatially Coupled LDPC Code Chains

discussion (0)