Bit-Interleaved Coded Modulation with Mismatched Decoding Metrics

doi:10.1109/TCOMM.2011.121410.100281

Return

Bit-Interleaved Coded Modulation with Mismatched Decoding Metrics

2011-02-01

PRE

Trung T. Nguyen *

Lutz Lampe

DOI：10.1109/TCOMM.2011.121410.100281

Original

Original request for help

Save

Abstract

En 中文

Bit-interleaved coded modulation (BICM) has become the de facto coding standard for communication systems. Recently, BICM has been cast as a mismatched decoding scheme due to the assumption of independent bit metrics. In addition to this inherent mismatch, practical demodulators may produce mismatched decoding metrics because of implementation constraints, such as clipping and metric approximation to reduce computational complexity. In this paper, we investigate BICM with such metrics. In line with recent works on this topic, we adopt the generalized mutual information (GMI) as the pertinent performance measure. First, we show that level-dependent scaling of logarithmic bit metrics can improve the BICM GMI. Second, we propose a uniform metric scaling which can lead to an improved performance of mismatched sum-product symbol-by-symbol decoding, even if the GMI is not changed. Third, we investigate general metric-mismatch correction methods and analyze their effects in terms of the GMI. By means of three application examples, we illustrate that metric-mismatch correction, including metric scaling, can significantly increase BICM rates.

Keywords:

Bit-interleaved coded modulation (BICM)

mismatched decoding

generalized mutual information (GMI)

symbol-by-symbol decoding

metric correction

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.