International Symposium on Information Theory and Its Applications (ISITA) p. 488-492. (2016)[Konferensbidrag, refereegranskat]

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

Dela på webben

Skapa referens, olika format (klipp och klistra)

BibTeX @conference{Moloudi2016,author={Moloudi, Saeedeh and Lentmaier, Michael and Graell i Amat, Alexandre},title={Finite Length Weight Enumerator Analysis of Braided Convolutional Codes},booktitle={International Symposium on Information Theory and Its Applications (ISITA)},isbn={978-4-88552-309-0},pages={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 linearly with the permutation size. Finally, we show that the estimated 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.},year={2016},}

RefWorks RT Conference ProceedingsSR ElectronicID 239424A1 Moloudi, SaeedehA1 Lentmaier, MichaelA1 Graell i Amat, AlexandreT1 Finite Length Weight Enumerator Analysis of Braided Convolutional CodesYR 2016T2 International Symposium on Information Theory and Its Applications (ISITA)SN 978-4-88552-309-0SP 488OP 492AB 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 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.LA engLK http://publications.lib.chalmers.se/records/fulltext/239424/local_239424.pdfOL 30