Advanced

Density Evolution Analysis of Braided Convolutional Codes on the Erasure Channel

Moloudi, Saeedeh LU and Lentmaier, Michael LU (2014) IEEE International Symposium on Information Theory (ISIT), 2014 In [Host publication title missing] p.2609-2613
Abstract
Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes with a structure that is similar to product codes or generalized LDPC codes. We derive explicit input/output transfer functions of the component convolutional decoders for the binary erasure channel (BEC). These are then used to formulate exact density evolution equations for blockwise BCCs under belief propagation (BP) decoding with optimal component APP decoders. Thresholds are computed for the coupled and uncoupled case, which is equivalent to tailbiting. Due to the relatively high rate of the component codes a significant threshold improvement by spatial coupling can be observed.
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
in
[Host publication title missing]
pages
2609 - 2613
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory (ISIT), 2014
external identifiers
  • WOS:000346496102150
  • Scopus:84906569123
language
English
LU publication?
yes
id
a76a0b21-1252-49ed-b067-f1e549b1512d (old id 4391119)
date added to LUP
2014-04-08 10:11:00
date last changed
2016-10-13 04:50:08
@misc{a76a0b21-1252-49ed-b067-f1e549b1512d,
  abstract     = {Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes with a structure that is similar to product codes or generalized LDPC codes. We derive explicit input/output transfer functions of the component convolutional decoders for the binary erasure channel (BEC). These are then used to formulate exact density evolution equations for blockwise BCCs under belief propagation (BP) decoding with optimal component APP decoders. Thresholds are computed for the coupled and uncoupled case, which is equivalent to tailbiting. Due to the relatively high rate of the component codes a significant threshold improvement by spatial coupling can be observed.},
  author       = {Moloudi, Saeedeh and Lentmaier, Michael},
  language     = {eng},
  pages        = {2609--2613},
  publisher    = {ARRAY(0x9812348)},
  series       = {[Host publication title missing]},
  title        = {Density Evolution Analysis of Braided Convolutional Codes on the Erasure Channel},
  year         = {2014},
}