Advanced

ML performances of serial turbo codes do not concentrate!

Como, Giacomo LU ; Garin, Federica and Fagnani, Fabio (2006) 6th International ITG-Conference on Source and Channel Coding and 2006 4th International Symposium on Turbo Codes and Related Topics, TURBOCODING 2006
Abstract

In this paper we investigate the typical behaviour of minimum distance and ML word error probability of a serial turbo concatenation with random interleaver, when the interleaver length N goes to infinity. Our main result shows that the word error probability P(e) goes to zero subexponentially in N with probability one. While it is known that 10glE[P(e)]/logN converges to a constant, we prove that with probability one the sequence 10g(-log(P(e)))/logN approaches an interval [α, β] C (0 ,1 ), thus showing that the expected error rate is dominated by an asymptotically negligible fraction of bad interleavers. Our analysis is based on precise estimations of the minimum distance distribution.

Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on
publisher
Institute of Electrical and Electronics Engineers Inc.
conference name
6th International ITG-Conference on Source and Channel Coding and 2006 4th International Symposium on Turbo Codes and Related Topics, TURBOCODING 2006
conference location
Munich, Germany
conference dates
2006-04-03 - 2006-04-07
external identifiers
  • scopus:84994701179
ISBN
9783800729470
language
English
LU publication?
yes
id
a4f15e4f-fa6a-40d7-a5b8-4537feb2a9f6
date added to LUP
2019-06-29 15:58:10
date last changed
2019-08-16 14:01:03
@inproceedings{a4f15e4f-fa6a-40d7-a5b8-4537feb2a9f6,
  abstract     = {<p>In this paper we investigate the typical behaviour of minimum distance and ML word error probability of a serial turbo concatenation with random interleaver, when the interleaver length N goes to infinity. Our main result shows that the word error probability P(e) goes to zero subexponentially in N with probability one. While it is known that 10glE[P(e)]/logN converges to a constant, we prove that with probability one the sequence 10g(-log(P(e)))/logN approaches an interval [α, β] C (0 ,1 ), thus showing that the expected error rate is dominated by an asymptotically negligible fraction of bad interleavers. Our analysis is based on precise estimations of the minimum distance distribution.</p>},
  author       = {Como, Giacomo and Garin, Federica and Fagnani, Fabio},
  isbn         = {9783800729470},
  language     = {eng},
  location     = {Munich, Germany},
  month        = {01},
  publisher    = {Institute of Electrical and Electronics Engineers Inc.},
  title        = {ML performances of serial turbo codes do not concentrate!},
  year         = {2006},
}