Advanced

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

Moloudi, Saeedeh LU ; Lentmaier, Michael LU and Graell i Amat, Alexandre (2015) IEEE Information Theory Workshop (ITW), 2015 In 2015 IEEE Information Theory Workshop - Fall (ITW)
Abstract
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..
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
Spatially coupled codes, threshold saturation, density evolution, turbo codes, parallel concatenation, serial concatenation, braided convolutional codes
in
2015 IEEE Information Theory Workshop - Fall (ITW)
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE Information Theory Workshop (ITW), 2015
external identifiers
  • Scopus:84962741425
DOI
10.1109/ITWF.2015.7360750
language
English
LU publication?
yes
id
a43f6b83-f0e3-4809-8c4b-9b27802cf30f (old id 8081436)
date added to LUP
2015-10-21 09:15:39
date last changed
2016-10-13 04:43:28
@misc{a43f6b83-f0e3-4809-8c4b-9b27802cf30f,
  abstract     = {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..},
  author       = {Moloudi, Saeedeh and Lentmaier, Michael and Graell i Amat, Alexandre},
  keyword      = {Spatially coupled codes,threshold saturation,density evolution,turbo codes,parallel concatenation,serial concatenation,braided convolutional codes},
  language     = {eng},
  publisher    = {ARRAY(0x89b0000)},
  series       = {2015 IEEE Information Theory Workshop - Fall (ITW)},
  title        = {Threshold Saturation for Spatially Coupled Turbo-like Codes over the Binary Erasure Channel},
  url          = {http://dx.doi.org/ 10.1109/ITWF.2015.7360750},
  year         = {2015},
}