Advanced

Finite Length Weight Enumerator Analysis of Braided Convolutional Codes

Moloudi, Saeedeh LU ; Lentmaier, Michael LU and Graell i Amat, Alexandre (2016) International Symposium on Information Theory and Its Applications (ISITA), 2016 In Proceedings of International Symposium on Information Theory and Its Applications (ISITA) p.488-492
Abstract
Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes (SC-TCs) with excellent belief propagation (BP) thresholds. In this paper we analyze the performance of BCCs in the finite block-length regime. We derive the average weight enumerator function (WEF) and compute the union bound on the performance for the uncoupled BCC ensemble. Our results suggest that the union bound is affected by poor distance properties of a small fraction of codes. By computing the union bound for the expurgated ensemble, we show that the floor improves substantially and very low error rates can be achieved for moderate permutation sizes. Based on the WEF, we also obtain a bound on the minimum distance which indicates that it grows... (More)
Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes (SC-TCs) with excellent belief propagation (BP) thresholds. In this paper we analyze the performance of BCCs in the finite block-length regime. We derive the average weight enumerator function (WEF) and compute the union bound on the performance for the uncoupled BCC ensemble. Our results suggest that the union bound is affected by poor distance properties of a small fraction of codes. By computing the union bound for the expurgated ensemble, we show that the floor improves substantially and very low error rates can be achieved for moderate permutation sizes. Based on the WEF, we also obtain a bound on the minimum distance which indicates that it grows linearly with the permutation size. Finally, we show that the estimated error floor for the uncoupled BCC ensemble is also valid for the coupled ensemble by proving that the minimum distance of the coupled ensemble is lower bounded by the minimum distance of the uncoupled ensemble. (Less)
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
Proceedings of International Symposium on Information Theory and Its Applications (ISITA)
pages
488 - 492
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
International Symposium on Information Theory and Its Applications (ISITA), 2016
external identifiers
  • scopus:85015239538
language
English
LU publication?
yes
id
6aeabb2b-c877-410a-b1a1-f3b88012d5b2
alternative location
http://ieeexplore.ieee.org/document/7840472/
date added to LUP
2016-12-20 12:16:21
date last changed
2017-10-31 15:02:31
@inproceedings{6aeabb2b-c877-410a-b1a1-f3b88012d5b2,
  abstract     = {Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes (SC-TCs) with excellent belief propagation (BP) thresholds. In this paper we analyze the performance of BCCs in the finite block-length regime. We derive the average weight enumerator function (WEF) and compute the union bound on the performance for the uncoupled BCC ensemble. Our results suggest that the union bound is affected by poor distance properties of a small fraction of codes. By computing the union bound for the expurgated ensemble, we show that the floor improves substantially and very low error rates can be achieved for moderate permutation sizes. Based on the WEF, we also obtain a bound on the minimum distance which indicates that it grows linearly with the permutation size. Finally, we show that the estimated error floor for the uncoupled BCC ensemble is also valid for the coupled ensemble by proving that the minimum distance of the coupled ensemble is lower bounded by the minimum distance of the uncoupled ensemble.},
  author       = {Moloudi, Saeedeh and Lentmaier, Michael and Graell i Amat, Alexandre},
  booktitle    = {Proceedings of International Symposium on Information Theory and Its Applications (ISITA)},
  language     = {eng},
  pages        = {488--492},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  title        = {Finite Length Weight Enumerator Analysis of Braided Convolutional Codes},
  year         = {2016},
}