On the theory of low-density convolutional codes. II
type: Item
instance of: scholarly article
title: On the theory of low-density convolutional codes. II
zbMATH Open document ID: 1038.94012
DOI: 10.1023/A:1013815115684
author: M. Lentmaier
author: Dmitri V. Truhachev
author: Kamil S. Zigangirov
published in: Problems of Information Transmission
publication date: 2003-09-08T00:00:00Z
review text: The paper deals with iterative decoding algorithms of low-density convolutional (LDC) codes. The authors analyse their asymptotic properties, discussing two families of LDC codes, namely homogeneous LDC codes and a convolutional version of turbo codes. They prove the existence of an upper bound on the decoding bit error probability and bounds on iterative limits for LDC codes and a family of turbo codes. They also discuss a derivation of these bounds. Procedures applied by the authors are analogous to those proposed by Gallager. Bounds on iterative limits are obtained for two channel models: the additive white Gaussian noise channel and the binary symmetric channel. For the calculation of estimates of log-likelihood ratios -- estimates of the Bhattacharyya parameter -- a Monte Carlo technique is used.
reviewed by: Józef Woźniak
Mathematics Subject Classification ID: 94B10
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 94B70
Mathematics Subject Classification ID: 94A40
zbMATH DE Number: 1930622
zbMATH Keywords: low-density convolutional codes
zbMATH Keywords: turbo-codes
zbMATH Keywords: asymptotic analysis and properties
zbMATH Keywords: channel models
zbMATH Keywords: bounds on codes
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1930622