A unified ensemble of concatenated convolutional codes
(2017) IEEE International Symposium on Information Theory (ISIT), 2017 p.26-30- Abstract
- We introduce a unified ensemble for turbo-like codes (TCs) that contains the four main classes of TCs: parallel con- catenated codes, serially concatenated codes, hybrid concatenated codes, and braided convolutional codes. We show that for each of the original classes of TCs, it is possible to find an equivalent ensemble by proper selection of the design parameters in the unified ensemble. We also derive the density evolution (DE) equations for this ensemble over the binary erasure channel. The thresholds obtained from the DE indicate that the TC ensembles from the unified ensemble have similar asymptotic behavior to the original TC ensembles.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/c585ef4c-112d-4d09-9639-bdf527435c40
- author
- Moloudi, Saeedeh LU ; Lentmaier, Michael LU and Graell i Amat, Alexandre
- organization
- publishing date
- 2017
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- IEEE International Symposium on International Symposium on Information Theory (ISIT)
- pages
- 26 - 30
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE International Symposium on Information Theory (ISIT), 2017
- conference location
- Aachen, Germany
- conference dates
- 2017-06-25 - 2017-06-30
- external identifiers
-
- scopus:85034096324
- ISBN
- 978-1-5090-4096-4
- DOI
- 10.1109/ISIT.2017.8006483
- language
- English
- LU publication?
- yes
- id
- c585ef4c-112d-4d09-9639-bdf527435c40
- date added to LUP
- 2017-09-15 16:24:40
- date last changed
- 2022-02-14 21:59:36
@inproceedings{c585ef4c-112d-4d09-9639-bdf527435c40, abstract = {{We introduce a unified ensemble for turbo-like codes (TCs) that contains the four main classes of TCs: parallel con- catenated codes, serially concatenated codes, hybrid concatenated codes, and braided convolutional codes. We show that for each of the original classes of TCs, it is possible to find an equivalent ensemble by proper selection of the design parameters in the unified ensemble. We also derive the density evolution (DE) equations for this ensemble over the binary erasure channel. The thresholds obtained from the DE indicate that the TC ensembles from the unified ensemble have similar asymptotic behavior to the original TC ensembles.}}, author = {{Moloudi, Saeedeh and Lentmaier, Michael and Graell i Amat, Alexandre}}, booktitle = {{IEEE International Symposium on International Symposium on Information Theory (ISIT)}}, isbn = {{978-1-5090-4096-4}}, language = {{eng}}, pages = {{26--30}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{A unified ensemble of concatenated convolutional codes}}, url = {{https://lup.lub.lu.se/search/files/34115096/ISIT2017_MLD.pdf}}, doi = {{10.1109/ISIT.2017.8006483}}, year = {{2017}}, }