Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

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..

Publiceringsår

2015

Språk

Engelska

Publikation/Tidskrift/Serie

Information Theory Workshop - Fall (ITW), 2015 IEEE

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • 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

Forskningsgrupp

  • Telecommunication Theory

ISBN/ISSN/Övrigt

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