On BICM-ID with Multiple Interleavers

In this letter, we study the performance of BICM-ID with multiple interleavers (BICM-ID-M) in terms of bit-error rate (BER), and show that BICM-ID-M is well-suited to exploit the unequal error protection (UEP) caused by the binary labeling. We show that BICM-ID-M should always be the preferred alternative for BICM-ID and that the gains obtained appear even for the simplest configuration (0.5-0.75 dB for a BER of 10-7). It is found that conventional design paradigms such as maximizing the free distance of the code should be modified.

[1]  Pål K. Frenger,et al.  Convolutional codes with optimum distance spectrum , 1999, IEEE Communications Letters.

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

[3]  S. Brink,et al.  Iterative demapping for QPSK modulation , 1998 .

[4]  Leszek Szczecinski,et al.  Exploiting UEP in QAM-based BICM: interleaver and code design , 2010, IEEE Transactions on Communications.

[5]  Frank Schreckenbach,et al.  Iterative Decoding of Bit-Interleaved Coded Modulation , 2007 .

[6]  Albert Guillén i Fàbregas,et al.  Bit-interleaved coded modulation with shaping , 2010, 2010 IEEE Information Theory Workshop.

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

[8]  Dariush Divsalar,et al.  Soft-input soft-output modules for the construction and distributed iterative decoding of code networks , 1998, Eur. Trans. Telecommun..

[9]  Giuseppe Caire,et al.  Bit-interleaved coded modulation , 2008, Proceedings of ICC'97 - International Conference on Communications.

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