The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Connecting Spatially Coupled LDPC Code Chains

På svenska

Author

Summary, in English

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.

Publishing year

2012

Language

English

Pages

2176-2180

Publication/Series

2012 IEEE International Conference on Communications (ICC)

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • spatial coupling
  • LDPC codes

Conference name

IEEE International Conference on Communications, 2012

Conference date

2012-06-10 - 2012-06-15

Conference place

Ottawa, Canada

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISSN: 1550-3607
  • ISBN: 978-1-4577-2052-9