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.

Threshold Saturation for Spatially Coupled Turbo-like Codes over the Binary Erasure Channel

På svenska

Author

Summary, in English

In this paper we prove threshold saturation for spatially coupled turbo codes (SC-TCs) and braided convolutional codes (BCCs) over the binary erasure channel. We introduce a compact graph representation for the ensembles of SC-TC and BCC codes which simplifies their description and the analysis of the message passing decoding. We demonstrate that by few assumptions in the ensembles of these codes, it is possible to rewrite their vector recursions in a form which places these ensembles under the category of scalar admissible systems. This allows us to define potential functions and prove threshold saturation using the proof technique introduced by Yedla et al..

Publishing year

2015

Language

English

Publication/Series

Information Theory Workshop - Fall (ITW), 2015 IEEE

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • Spatially coupled codes
  • threshold saturation
  • density evolution
  • turbo codes
  • parallel concatenation
  • serial concatenation
  • braided convolutional codes

Conference name

IEEE Information Theory Workshop (ITW), 2015

Conference date

2015-10-11 - 2015-10-15

Conference place

Jeju Island, Korea, Democratic People's Republic of

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 978-1-4673-7853-6
  • ISBN: 978-1-4673-7852-9