On the Asymptotic Performance of Bit-Wise Decoders for Coded Modulation
From MaRDI portal
Publication:2986390
DOI10.1109/TIT.2014.2312726zbMATH Open1360.94438arXiv1306.4009WikidataQ63960984 ScholiaQ63960984MaRDI QIDQ2986390
Author name not available (Why is that?)
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Two decoder structures for coded modulation over the Gaussian and flat fading channels 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 by 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 for the Gaussian channel the asymptotic loss is zero for a wide range of linear codes, including all rate-1/2 convolutional codes.
Full work available at URL: https://arxiv.org/abs/1306.4009
Related Items (2)
Performance evaluation of coded modulation schemes based on binary lattices ⋮ Asymptotic optimality of the GMD and Chase decoding algorithms
This page was built for publication: On the Asymptotic Performance of Bit-Wise Decoders for Coded Modulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986390)
