Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

The performance of serial turbo codes does not concentrate

Författare:
Publiceringsår: 2012
Språk: Engelska
Sidor: 2570-2588
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 58
Nummer: 5
Dokumenttyp: Artikel i tidskrift
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.

Sammanfattning

Abstract in Undetermined

Minimum distances and maximum likelihood error probabilities of serial turbo codes with uniform interleaver are analyzed. It is shown that, for a fraction of interleavers approaching one as the block-length grows large, the minimum distance of serial turbo codes grows as a positive power of their block-length, while their error probability decreases exponentially fast in some positive power of their block-length, on sufficiently good memoryless channels. Such a typical code behavior contrasts the performance of the average serial turbo code, whose error probability is dominated by an asymptotically negligible fraction of poorly performing interleavers, and decays only as a negative power of the block-length. The analysis proposed in this paper relies on precise bounds of the minimum distance of the typical serial turbo code, whose scaling law is shown to depend both on the free distance of its outer constituent encoder, which determines the exponent of its sub-linear growth in the block-length, and on the effective free distance of its inner constituent encoder. The latter is defined as the smallest weight of codewords obtained when the input word of the inner encoder has weight two, and appears as a linear scaling factor for the minimum distance of the typical serial turbo code. Hence, despite the lack of concentration of the maximum likelihood error probability around its expected value, the main design parameters suggested by the average-code analysis turn out to characterize also the performance of the typical serial turbo code. By showing for the first time that the typical serial turbo code's minimum distance scales linearly in the effective free distance of the inner constituent encoder, the presented results generalize, and improve upon, the probabilistic bounds of Kahale and Urbanke, as well as the deterministic upper bound of Bazzi, Mahdian, and Spielman, where only the dependence on the outer encoder's free distance was proved.

Nyckelord

  • Control Engineering
  • Error probability
  • minimum distance
  • serially concatenated codes
  • turbo codes
  • typical code analysis

Övriga

Published
  • LCCC-lup-obsolete
  • ISSN: 0018-9448

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu.se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen