Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Analytical approach to low-density convolutional codes

Engdahl, Karin ; Lentmaier, Michael LU ; Truhachev, Dmitri and Zigangirov, Kamil LU (2000) IEEE International Symposium on Information Theory (ISIT), 2000
Abstract
A statistical analysis of low-density convolutional (LDC) codes is performed. This analysis is based on the consideration of a special statistical ensemble of Markov scramblers and the solution to a system of recurrent equations describing this ensemble. The results of the analysis are lower bounds for the free distance of the codes and upper bounds for the maximum likelihood decoding error probability. For the case where the size of the scrambler tends to infinity some asymptotic bounds for the free distance and the error probability are derived. Simulation results for iterative decoding of LDC codes are also presented.
Please use this url to cite or link to this publication:
author
; ; and
organization
publishing date
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]
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory (ISIT), 2000
conference location
Sorrento, Italy
conference dates
2000-06-25 - 2000-06-30
external identifiers
  • scopus:0034449215
ISBN
0-7803-5857-0
DOI
10.1109/ISIT.2000.866499
language
English
LU publication?
yes
id
fcd32935-3dc5-42ce-bc4f-4564a22c7d59 (old id 3731548)
date added to LUP
2016-04-04 11:41:45
date last changed
2022-01-29 22:14:58
@inproceedings{fcd32935-3dc5-42ce-bc4f-4564a22c7d59,
  abstract     = {{A statistical analysis of low-density convolutional (LDC) codes is performed. This analysis is based on the consideration of a special statistical ensemble of Markov scramblers and the solution to a system of recurrent equations describing this ensemble. The results of the analysis are lower bounds for the free distance of the codes and upper bounds for the maximum likelihood decoding error probability. For the case where the size of the scrambler tends to infinity some asymptotic bounds for the free distance and the error probability are derived. Simulation results for iterative decoding of LDC codes are also presented.}},
  author       = {{Engdahl, Karin and Lentmaier, Michael and Truhachev, Dmitri and Zigangirov, Kamil}},
  booktitle    = {{[Host publication title missing]}},
  isbn         = {{0-7803-5857-0}},
  keywords     = {{spatial coupling; LDPC codes; LDPC convolutional codes}},
  language     = {{eng}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{Analytical approach to low-density convolutional codes}},
  url          = {{http://dx.doi.org/10.1109/ISIT.2000.866499}},
  doi          = {{10.1109/ISIT.2000.866499}},
  year         = {{2000}},
}