Principles of Digital Communication and Coding
Principles of Digital Communication and Coding
EURASIP Journal on Applied Signal Processing
Evaluation of bit error rate for packet combining with constellation rearrangement
Wireless Communications & Mobile Computing
On the performance of BICM with mapping diversity in hybrid ARQ
Wireless Communications & Mobile Computing
Distribution of max-log metrics for QAM-based BICM in fading channels
IEEE Transactions on Communications
Channel codng for 4G systems with adaptive modulation and codng
IEEE Wireless Communications
BER analysis of QAM on fading channels with transmit diversity
IEEE Transactions on Wireless Communications
A Closed-Form Approximation for the Error Probability of BPSK Fading Channels
IEEE Transactions on Wireless Communications
Bit-interleaved coded modulation
IEEE Transactions on Information Theory
Error probability analysis of bit-interleaved coded modulation
IEEE Transactions on Information Theory
Comments on "Bit-interleaved coded modulation"
IEEE Transactions on Information Theory
Gray Coding for Multilevel Constellations in Gaussian Noise
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Distribution of max-log metrics for QAM-based BICM in fading channels
IEEE Transactions on Communications
Exploiting UEP in QAM-based BICM: interleaver and code design
IEEE Transactions on Communications
IEEE Transactions on Communications
Performance analysis for BICM transmission over Gaussian mixture noise fading channels
IEEE Transactions on Communications
Adaptive modulation and coding schemes based on LDPC codes with irregular modulation
IEEE Transactions on Communications
Hi-index | 0.00 |
In this paper we develop closed form approximations for the probability density function (PDF) of the reliability metrics (L-values) in bit-interleaved coded modulation (BICM). The expressions are valid for M2-ary quadrature amplitude modulations (M2-QAM) with binary reflected Gray mapping when the metrics are calculated using the so-called max-log approximation. Based on the developed expressions, we also propose two simple Gaussian mixture approximations that are analytically tractable. We apply our developments to efficiently calculate the BICM capacity, and to develop bounds on the coded bit-error rate when a convolutional code is used. The coded performance of a hybrid automatic repeat request (HARQ) based on constellation rearrangement is also evaluated.