Terminated LDPC convolutional codes with thresholds close to capacity
(2005) IEEE International Symposium on Information Theory (ISIT), 2005 p.1372-1376- Abstract
- An ensemble of LDPC convolutional codes with parity-check matrices composed of permutation matrices is considered. The convergence of the iterative belief propagation based decoder for terminated convolutional codes in the ensemble is analyzed for binary-input output-symmetric memoryless channels using density evolution techniques. We observe that the structured irregularity in the Tanner graph of the codes leads to significantly better thresholds when compared to corresponding LDPC block codes
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3731471
- author
- Lentmaier, Michael LU ; Sridharan, Arvind ; Zigangirov, Kamil LU and Costello Jr., Daniel J.
- organization
- publishing date
- 2005
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- spatial coupling, LDPC codes, LDPC convolutional codes
- host publication
- [Host publication title missing]
- pages
- 1372 - 1376
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE International Symposium on Information Theory (ISIT), 2005
- conference location
- Adelaide, Australia
- conference dates
- 2005-09-04 - 2005-09-09
- external identifiers
-
- scopus:33749439921
- ISBN
- 0-7803-9151-9
- DOI
- 10.1109/ISIT.2005.1523567
- language
- English
- LU publication?
- yes
- id
- f3fd7115-f869-4d60-916d-fbad5321b769 (old id 3731471)
- date added to LUP
- 2016-04-04 10:39:51
- date last changed
- 2022-01-29 20:37:02
@inproceedings{f3fd7115-f869-4d60-916d-fbad5321b769, abstract = {{An ensemble of LDPC convolutional codes with parity-check matrices composed of permutation matrices is considered. The convergence of the iterative belief propagation based decoder for terminated convolutional codes in the ensemble is analyzed for binary-input output-symmetric memoryless channels using density evolution techniques. We observe that the structured irregularity in the Tanner graph of the codes leads to significantly better thresholds when compared to corresponding LDPC block codes}}, author = {{Lentmaier, Michael and Sridharan, Arvind and Zigangirov, Kamil and Costello Jr., Daniel J.}}, booktitle = {{[Host publication title missing]}}, isbn = {{0-7803-9151-9}}, keywords = {{spatial coupling; LDPC codes; LDPC convolutional codes}}, language = {{eng}}, pages = {{1372--1376}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Terminated LDPC convolutional codes with thresholds close to capacity}}, url = {{http://dx.doi.org/10.1109/ISIT.2005.1523567}}, doi = {{10.1109/ISIT.2005.1523567}}, year = {{2005}}, }