New codes on graphs constructed by connecting spatially coupled chains

Abstract

A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) code chains is presented. The proposed code ensembles are described by graphs in which individual SC-LDPC code chains of various lengths serve as edges. We demonstrate that connecting several appropriately chosen SC-LDPC code chains results in 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.

DOI: 10.1109/ITA.2012.6181771

Extracted Key Phrases

14 Figures and Tables

Cite this paper

@article{Truhachev2012NewCO, title={New codes on graphs constructed by connecting spatially coupled chains}, author={Dmitri V. Truhachev and David G. M. Mitchell and Michael Lentmaier and Daniel J. Costello}, journal={2012 Information Theory and Applications Workshop}, year={2012}, pages={392-397} }