Braided Convolutional Codes - A Class of Spatially Coupled Turbo-Like Codes
(2014) International Conference on Signal Processing and Communications (SPCOM)- Abstract
- In this paper, we investigate the impact of spatial coupling on the thresholds of turbo-like codes. Parallel concatenated and serially concatenated convolutional codes as well as braided convolutional codes (BCCs) are compared by means of an exact density evolution (DE) analysis for the binary erasure channel (BEC). We propose two extensions of the original BCC ensemble to improve its threshold and demonstrate that their BP thresholds approach the maximum-a posteriori (MAP) threshold of the uncoupled ensemble. A comparison of the different ensembles shows that parallel concatenated ensembles can be outperformed by both serially concatenated and BCC ensembles, although they have the best BP thresholds in the uncoupled case.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/4469395
- author
- Lentmaier, Michael LU ; Moloudi, Saeedeh LU and Graell i Amat, Alexandre
- organization
- publishing date
- 2014
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- turbo codes, braided codes, braided convolutional codes, LDPC convolutional codes, spatial coupling
- host publication
- [Host publication title missing]
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- International Conference on Signal Processing and Communications (SPCOM)
- conference location
- Bangalore, India
- conference dates
- 2014-07-22 - 2014-07-25
- external identifiers
-
- wos:000364936400029
- scopus:84920722408
- language
- English
- LU publication?
- yes
- id
- f8c92d1c-ed52-4083-831d-46a1119549f8 (old id 4469395)
- date added to LUP
- 2016-04-04 11:38:23
- date last changed
- 2022-01-29 22:14:49
@inproceedings{f8c92d1c-ed52-4083-831d-46a1119549f8, abstract = {{In this paper, we investigate the impact of spatial coupling on the thresholds of turbo-like codes. Parallel concatenated and serially concatenated convolutional codes as well as braided convolutional codes (BCCs) are compared by means of an exact density evolution (DE) analysis for the binary erasure channel (BEC). We propose two extensions of the original BCC ensemble to improve its threshold and demonstrate that their BP thresholds approach the maximum-a posteriori (MAP) threshold of the uncoupled ensemble. A comparison of the different ensembles shows that parallel concatenated ensembles can be outperformed by both serially concatenated and BCC ensembles, although they have the best BP thresholds in the uncoupled case.}}, author = {{Lentmaier, Michael and Moloudi, Saeedeh and Graell i Amat, Alexandre}}, booktitle = {{[Host publication title missing]}}, keywords = {{turbo codes; braided codes; braided convolutional codes; LDPC convolutional codes; spatial coupling}}, language = {{eng}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Braided Convolutional Codes - A Class of Spatially Coupled Turbo-Like Codes}}, url = {{https://lup.lub.lu.se/search/files/5820753/4469405.pdf}}, year = {{2014}}, }