Density Evolution Analysis of Braided Convolutional Codes on the Erasure Channel
(2014) IEEE International Symposium on Information Theory (ISIT), 2014 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:
https://lup.lub.lu.se/record/4391119
- author
- Moloudi, Saeedeh LU and Lentmaier, Michael LU
- organization
- publishing date
- 2014
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [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
- conference location
- Honolulu, HI, United States
- conference dates
- 2014-06-29 - 2014-07-04
- external identifiers
-
- wos:000346496102150
- scopus:84906569123
- language
- English
- LU publication?
- yes
- id
- a76a0b21-1252-49ed-b067-f1e549b1512d (old id 4391119)
- date added to LUP
- 2016-04-04 12:11:44
- date last changed
- 2022-05-01 22:42:27
@inproceedings{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}}, booktitle = {{[Host publication title missing]}}, language = {{eng}}, pages = {{2609--2613}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Density Evolution Analysis of Braided Convolutional Codes on the Erasure Channel}}, url = {{https://lup.lub.lu.se/search/files/5949641/4580670.pdf}}, year = {{2014}}, }