Analytical approach to low-density convolutional codes

Karin Engdahl, Michael Lentmaier, Dmitri Truhachev, Kamil Zigangirov

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceedingPeer review


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.
Titel på värdpublikation[Host publication title missing]
FörlagIEEE - Institute of Electrical and Electronics Engineers Inc.
ISBN (tryckt)0-7803-5857-0
StatusPublished - 2000
EvenemangIEEE International Symposium on Information Theory (ISIT), 2000 - Sorrento, Sorrento, Italien
Varaktighet: 2000 juni 252000 juni 30


KonferensIEEE International Symposium on Information Theory (ISIT), 2000

Ämnesklassifikation (UKÄ)

  • Elektroteknik och elektronik


Utforska forskningsämnen för ”Analytical approach to low-density convolutional codes”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här