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 language | English |
---|---|
Title of host publication | Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on |
Publisher | IEEE - Institute of Electrical and Electronics Engineers Inc. |
ISBN (Electronic) | 9783800729470 |
Publication status | Published - 2006 Jan 1 |
Event | 6th 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 3 → 2006 Apr 7 |
Conference
Conference | 6th International ITG-Conference on Source and Channel Coding and 2006 4th International Symposium on Turbo Codes and Related Topics, TURBOCODING 2006 |
---|---|
Country/Territory | Germany |
City | Munich |
Period | 2006/04/03 → 2006/04/07 |
Subject classification (UKÄ)
- Control Engineering