CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

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

Tor Aulin (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
IEEE Transactions on Information Theory (0018-9448). Vol. 55 (2009), 8, p. 3892.
[Artikel, refereegranskad vetenskaplig]

In a recent paper (Bai et al, 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 et al, 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, where also a simple mathematical expression for this quantity was easily derived for any list size. In (Bai et al, IEEE Trans. Inf. Theory, 2007), a geometrical analysis gives this when the list size is 1, 2 or 3.

Nyckelord: Additive white Gaussian noise (AWGN) error probability, codeword error, correct path loss (CPL), list decoding, maximum likelihood sequence detection (MLSD), vector Euclidean distance (VED)

Denna post skapades 2009-09-04.
CPL Pubid: 97320


Läs direkt!

Länk till annan sajt (kan kräva inloggning)