Connecting Spatially Coupled LDPC Code Chains

Dmitri Truhachev, David G.M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

139 Downloads (Pure)

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.
Original languageEnglish
Title of host publication2012 IEEE International Conference on Communications (ICC)
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
Pages2176-2180
ISBN (Print)978-1-4577-2052-9
DOIs
Publication statusPublished - 2012
EventIEEE International Conference on Communications, 2012 - Ottawa, Canada
Duration: 2012 Jun 102012 Jun 15

Publication series

Name
ISSN (Print)1550-3607

Conference

ConferenceIEEE International Conference on Communications, 2012
Abbreviated titleICC12
Country/TerritoryCanada
CityOttawa
Period2012/06/102012/06/15

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Free keywords

  • spatial coupling
  • LDPC codes

Fingerprint

Dive into the research topics of 'Connecting Spatially Coupled LDPC Code Chains'. Together they form a unique fingerprint.

Cite this