A Tight BER Upper Bound for Bit-Interleaved Coded Modulation with Square QAM and Gray Labeling

Bit-interleaved coded modulation (BICM) is a bandwidth-efficient coded system with diversity order higher than that of Ungerboeck´s trellis-coded modulation on fading channels. In this paper, we investigate the BER (bit error rate) performance of BICM in the additive white Gaussian and Rayleigh fading channels. A new upper bound is given for the square QAM constellation with gray labeling, which constitutes a large portion of practical applications of BICM systems. The new upper bound is tighter than the well-known BICM union bound proposed in G. Caire et al. (1998)