Cooperative Networks: Bit-Interleaved Coded Modulation with Iterative Decoding

Abstract

In this paper the performance of bit-interleaved coded modulation-iterative decoding (BICM-ID) based cooperative network is analyzed over Rayleigh, Nakagami-m and Rician fading channels. In this system coding diversity is obtained through BICM and spatial diversity through cooperative relaying network. The analysis is performed for the relays operating in both amplify-and-forward (AF) and decode-and-forward (DF) modes. The bit error rate (BER) bound of multiple-relay cooperative system with the serial concatenated BICM-ID using the set partitioning (SP) and Gray mapped (GM) labeling for M-ary Phase Shift Keying (M-PSK) modulations over Nakagami-m fading channels is obtained. For the numerical results of union bound on BER, moment generating function (MGF) based approach is used. The expression of MGF derived for Nakagami distribution is then extended to Rayleigh and Rician fading channels. The comparisons of BER theoretical and simulation results are also shown. The performance of bit-interleaved low-density parity-check coded modulation with iterative decoding (BILDPCM-ID) based cooperative system, using low-density parity-check (LDPC) code instead of convolutional code, is also analyzed in term of bit-error rate (BER). The performance comparisons of BICM-ID and BILDPCM-ID based systems are shown using the set partitioning (SP) labeling for 8-PSK modulation scheme by performing Monte Carlo simulation.