Analytical approach to low-density convolutional codes

Karin Engdahl; Michael Lentmaier; Dmitri Truhachev; Kamil Zigangirov

doi:10.1109/ISIT.2000.866499

Analytical approach to low-density convolutional codes

Karin Engdahl, Michael Lentmaier, Dmitri Truhachev, Kamil Zigangirov

Department of Electrical and Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

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.

Original language	English
Title of host publication	[Host publication title missing]
Publisher	IEEE - Institute of Electrical and Electronics Engineers Inc.
ISBN (Print)	0-7803-5857-0
DOIs	https://doi.org/10.1109/ISIT.2000.866499
Publication status	Published - 2000
Event	IEEE International Symposium on Information Theory (ISIT), 2000 - Sorrento, Sorrento, Italy Duration: 2000 Jun 25 → 2000 Jun 30

Conference

Conference	IEEE International Symposium on Information Theory (ISIT), 2000
Country/Territory	Italy
City	Sorrento
Period	2000/06/25 → 2000/06/30

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Free keywords

spatial coupling
LDPC codes
LDPC convolutional codes

Access to Document

10.1109/ISIT.2000.866499

Cite this

@inproceedings{fcd329353dc542cebc4f4564a22c7d59,

title = "Analytical approach to low-density convolutional codes",

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.",

keywords = "spatial coupling, LDPC codes, LDPC convolutional codes",

author = "Karin Engdahl and Michael Lentmaier and Dmitri Truhachev and Kamil Zigangirov",

year = "2000",

doi = "10.1109/ISIT.2000.866499",

language = "English",

isbn = "0-7803-5857-0",

booktitle = "[Host publication title missing]",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "IEEE International Symposium on Information Theory (ISIT), 2000 ; Conference date: 25-06-2000 Through 30-06-2000",

}

TY - GEN

T1 - Analytical approach to low-density convolutional codes

AU - Engdahl, Karin

AU - Lentmaier, Michael

AU - Truhachev, Dmitri

AU - Zigangirov, Kamil

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

KW - spatial coupling

KW - LDPC codes

KW - LDPC convolutional codes

U2 - 10.1109/ISIT.2000.866499

DO - 10.1109/ISIT.2000.866499

M3 - Paper in conference proceeding

SN - 0-7803-5857-0

BT - [Host publication title missing]

PB - IEEE - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Symposium on Information Theory (ISIT), 2000

Y2 - 25 June 2000 through 30 June 2000

ER -

Analytical approach to low-density convolutional codes

Abstract

Conference

Subject classification (UKÄ)

Free keywords

Access to Document

Fingerprint

Cite this