Linear precoded index modulation

Index modulation (IM) is an attractive concept for next generation communication systems. However, as an emerging technique, there are still some challenges need to be tackled in this frontier. In this paper, we consider two aspects of IM, which are diversity and detection complexity. Specifically, we propose a linear precoding assisted index modulation (LPIM) scheme for orthogonal frequency division multiplexing (OFDM) systems. We commence by analyzing the diversity and coding gains of the proposed scheme. Moreover, a detailed codebook design criterion is proposed. Then, our LPIM codebook is designed based on the maximum diversity and coding gain criteria. In contrast to the signaling model of the existing full diversity precoder designed for OFDM, we introduce a modeling method to link the zero-valued IM symbols to the origin of a Lattice for implementing our full diversity precoder designed for OFDM-IM. Both analytical and computer simulation results are provided for characterizing the attainable performance of OFDM-LPIM, demonstrating that it is capable of achieving full diversity as well as an attractive coding gain. However, the maximum-likelihood (ML) detection complexity of OFDM-LPIMis excessive, hence a low-complexity generalized iterative residual check detector (GIRCD) is proposed, which is inspired by the existing sparse recovery algorithms. Finally, computer simulation results are provided for demonstrating that GIRCD can provide a beneficial trade-off between bit error ratio performance and complexity.<br/