pith. sign in

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

Connecting Spatially Coupled LDPC Code Chains

classification 💻 cs.IT cs.DMmath.IT
keywords chainscoupledcodeconnectingconstructeddecodingiterativeproposed
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.