SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Fagnani Federica) "

Sökning: WFRF:(Fagnani Federica)

  • Resultat 1-5 av 5
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  •  
3.
  • Como, Giacomo, et al. (författare)
  • ML performances of serial turbo codes do not concentrate!
  • 2006
  • Ingår i: Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on. - 9783800729470
  • Konferensbidrag (refereegranskat)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.
  •  
4.
  • Garin, Federica, et al. (författare)
  • The performance of serial turbo codes does not concentrate
  • 2012
  • Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 58:5, s. 2570-2588
  • Tidskriftsartikel (refereegranskat)abstract
    • Abstract in UndeterminedMinimum 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.
  •  
5.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-5 av 5

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy