ML performances of serial turbo codes do not concentrate!

Giacomo Como, Federica Garin, Fabio Fagnani

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

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.

Original languageEnglish
Title of host publicationTurbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9783800729470
Publication statusPublished - 2006 Jan 1
Event6th International ITG-Conference on Source and Channel Coding and 2006 4th International Symposium on Turbo Codes and Related Topics, TURBOCODING 2006 - Munich, Germany
Duration: 2006 Apr 32006 Apr 7

Conference

Conference6th International ITG-Conference on Source and Channel Coding and 2006 4th International Symposium on Turbo Codes and Related Topics, TURBOCODING 2006
Country/TerritoryGermany
CityMunich
Period2006/04/032006/04/07

Subject classification (UKÄ)

  • Control Engineering

Fingerprint

Dive into the research topics of 'ML performances of serial turbo codes do not concentrate!'. Together they form a unique fingerprint.

Cite this