• DocumentCode
    1136416
  • Title

    Comment on "Improved Analysis of List Decoding and Its Application to Convolutional Codes and Turbo Codes

  • Author

    Aulin, T.M.

  • Author_Institution
    Telecommun. Theor., Chalmers Univ. of Technol., Gothenburg, Sweden
  • Volume
    55
  • Issue
    8
  • fYear
    2009
  • Firstpage
    3892
  • Lastpage
    3892
  • Abstract
    In a recent paper (Bai , IEEE Trans. Inf. Theory, 2007), an improved analysis concerning the analysis of List Decoding was presented. The event that the correct codeword is excluded from the list is central. For the additive white Gaussian noise (AWGN) channel an important quantity is the in (Bai , IEEE Trans. Inf. Theory, 2007) called effective Euclidean distance. This was earlier considered in (Aulin, IEEE Trans. Commun., 1999) under the name Vector Euclidean Distance (VED), where also a simple mathematical expression for this quantity was easily derived for any list size. In (Bai , IEEE Trans. Inf. Theory, 2007) , a geometrical analysis gives this when the list size is 1, 2, or 3.
  • Keywords
    AWGN channels; convolutional codes; decoding; turbo codes; AWGN channel; additive white Gaussian noise channel; convolutional codes; effective Euclidean distance; geometrical analysis; list decoding; turbo codes; vector euclidean distance; AWGN; Additive white noise; Convolutional codes; Error probability; Euclidean distance; Gaussian noise; Maximum likelihood decoding; Maximum likelihood detection; Signal to noise ratio; Turbo codes; Additive white Gaussian noise (AWGN) error probability; codeword error; correct path loss (CPL); list decoding; maximum-likelihood sequence detection (MLSD); vector Euclidean distance (VED);
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2009.2023711
  • Filename
    5165189