On the Asymptotic Performance of Bit-Wise Decoders for Coded Modulation
Journal article, 2014

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.

pulse-amplitude modulation

coded modulation

logarithmic likelihood ratio

Gray code

bit-interleaved coded modulation

pairwise error probability

Additive white Gaussian noise

Author

Mikhail Ivanov

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Fredrik Brännström

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Erik Agrell

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

IEEE Transactions on Information Theory

0018-9448 (ISSN)

Vol. 60 5 2796-2804

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

Infrastructure

C3SE (Chalmers Centre for Computational Science and Engineering)

DOI

10.1109/TIT.2014.2312726

More information

Latest update

3/29/2018