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

On the Asymptotic Performance of Bit-Wise Decoders for Coded Modulation

Mikhail Ivanov (Institutionen för signaler och system, Kommunikationssystem) ; Alex Alvarado ; Fredrik Brännström (Institutionen för signaler och system, Kommunikationssystem) ; Erik Agrell (Institutionen för signaler och system, Kommunikationssystem)
IEEE Transactions on Information Theory (0018-9448). Vol. 60 (2014), 5, p. 2796-2804.
[Artikel, refereegranskad vetenskaplig]

Two decoder structures for coded modulation over the Gaussian channel are studied: the maximum likelihood symbol-wise decoder, and the (suboptimal) bit-wise decoder based on the bit-interleaved coded modulation paradigm. We consider a 16-ary quadrature amplitude constellation labeled with a Gray labeling. It is shown that the asymptotic loss in terms of pairwise error probability, for any two codewords caused by the bit-wise decoder, is bounded by 1.25 dB. The analysis also shows that the asymptotic loss is zero for a wide range of linear codes, including all rate-1/2 convolutional codes.

Nyckelord: Additive white Gaussian noise, Gray code, pairwise error probability, coded modulation, bit-interleaved coded modulation, logarithmic likelihood ratio, pulse-amplitude modulation



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2014-05-26. Senast ändrad 2016-04-28.
CPL Pubid: 198521

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

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