Probability Density Function of Reliability Metrics in BICM with Arbitrary Modulation: Closed-form through Algorithmic Approach

In the popular bit-interleaved coded modulation (BICM) the output of the channel encoder and the input of the modulator are separated by a bit-level interleaver. From the decoder's point of view, the modulator, the transmission channel, and the demodulator (calculating bits' reliability metrics) become a memoryless BICM channel with binary inputs and real outputs. In unfaded channels, the BICM channel's outputs (reliability metrics) are known to be Gaussian for binary- or quaternary phase shift keying but their probability density function (PDF) is not known for higher-order modulation. We fill this gap by presenting an algorithmic method to calculate closed-form expressions for the PDF of reliability metrics in BICM with arbitrary modulation and bits-to-symbol mapping when the so-called max-log approximation is applied. Such probabilistic description of BICM channel is useful to analyze, from an information- theoretic point of view, any BICM constellation/mapping design.

[1]  Xiaodong Li,et al.  Bit-interleaved coded modulation with iterative decoding , 1997, IEEE Communications Letters.

[2]  Man Young Rhee.  High Speed Downlink Packet Access (HSDPA) , 2009 .

[3]  Giuseppe Caire,et al.  Bit-Interleaved Coded Modulation , 2008, Found. Trends Commun. Inf. Theory.

[4]  S. Aissa,et al.  Probability Density Functions of Logarithmic Likelihood Ratios in Rectangular QAM , 2006, 23rd Biennial Symposium on Communications, 2006.

[5]  Marvin K. Simon,et al.  A simpler form of the Craig representation for the two-dimensional joint Gaussian Q-function , 2002, IEEE Communications Letters.

[6]  S. Brink.  Convergence of iterative decoding , 1999 .

[7]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[8]  Albert Guillen i Fabregas.  Error probability of bit-interleaved coded modulation using the Gaussian approximation , 2004 .

[9]  Seungkeun Park,et al.  An alternative expression for the symbol-error probability of MPSK in the presence of I/Q unbalance , 2004, IEEE Trans. Commun..

[10]  Ephraim Zehavi,et al.  8-PSK trellis codes for a Rayleigh channel , 1992, IEEE Trans. Commun..

[11]  Amir K. Khandani,et al.  An analytical method for approximate performance evaluation of binary linear block codes , 2004, IEEE Transactions on Communications.

[12]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[13]  Leszek Szczecinski,et al.  Exact evaluation of bit- and symbol-error rates for arbitrary 2-D modulation and nonuniform signaling in AWGN channel , 2006, IEEE Transactions on Communications.

[14]  Giuseppe Caire,et al.  Capacity of bit-interleaved channels , 1996 .

[15]  Gerhard Bauch,et al.  Optimization of symbol mappings for bit-interleaved coded Modulation with iterative decoding , 2003, IEEE Communications Letters.

[16]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[17]  Andrew C. Singer,et al.  Minimum mean squared error equalization using a priori information , 2002, IEEE Trans. Signal Process..

[18]  Fady Alajaji,et al.  Constellation mappings for two-dimensional signaling of nonuniform sources , 2003, IEEE Trans. Commun..

[19]  Giuseppe Caire,et al.  Error probability analysis of bit-interleaved coded modulation , 2006, IEEE Transactions on Information Theory.