To the theory of low-density convolutional codes. I (Q1569277)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: To the theory of low-density convolutional codes. I |
scientific article; zbMATH DE number 1467814
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | To the theory of low-density convolutional codes. I |
scientific article; zbMATH DE number 1467814 |
Statements
To the theory of low-density convolutional codes. I (English)
0 references
6 March 2002
0 references
Selected properties of low-density convolutional (LDC) codes are investigated. The authors analyze a special statistical set of LDC codes described by Markov equations. For such codes the lower bound of free distance and upper bounds for decoding error probability are evaluated. The authors also propose and analyze an iterative decoding algorithm, with hard decisions for homogeneous LDC codes of rate 1/2. Additionally, they compare the complexity characteristics of convolutional turbo- and LDC codes, verifying the analytical results via simulation experiments.
0 references
low-density convolutional codes
0 references
convolutional turbo-codes
0 references
LDC codes
0 references
lower bound of free distance
0 references
upper bounds for decoding error probability
0 references
iterative decoding algorithm
0 references
0.94157207
0 references
0.86868584
0 references
0.8679182
0 references
0.86720145
0 references
0.8597461
0 references
0.85595465
0 references
