Precoder Index Modulation
Index modulation, where information bits are conveyed through antenna indices (spatial modulation) and subcarrier indices (subcarrier index modulation) in addition to information bits conveyed through conventional modulation symbols, is getting increased research attention. In this paper, we introduce precoder index modulation, where information bits are conveyed through the choice of a precoder matrix at the transmitter from a set of pre-determined pseudo-random phase precoder (PRPP) matrices. Combining precoder index modulation (PIM) and spatial modulation (SM), we introduce a PIM-SM scheme which conveys information bits through both antenna index as well as precoder index. Spectral efficiency (in bits per channel use) and bit error performance of these index modulation schemes are presented.
Keywords – Index modulation, spatial modulation, pseudo-random phase precoding.
In conventional modulation schemes, information bits are conveyed in a given channel use through the transmission of a modulation symbol chosen from a pre-determined modulation alphabet (e.g., QAM, PSK) . Recently, modulation techniques that convey additional information bits through antenna indices and subcarrier indices have generated increased research interest. One such index modulation scheme that is popularly researched in recent times is spatial modulation (see , and the references therein), which is a multi-antenna modulation scheme that uses antenna indexing. Another such scheme is subcarrier index modulation, which is a multi-carrier modulation scheme that uses subcarrier indexing ,.
Spatial modulation (SM) uses multiple transmit antennas but only one transmit radio frequency (RF) chain. In a given channel use, only one among all the transmit antennas will be activated and the others will remain silent. The activated antenna will carry a conventional modulation symbol. The antenna to be activated is chosen based on information bits. Therefore, the index of the activated antenna conveys additional information bits. If is the number of transmit antennas and is the modulation alphabet, the number of bits conveyed per channel use in SM is given by . Similarly, subcarrier index modulation refers to a multi-carrier modulation scheme, where information bits are conveyed through the indices of active subcarriers ,. An advantage of index modulation over conventional modulation is that, to achieve a certain spectral efficiency, index modulation can use a smaller-sized QAM/PSK alphabet compared to that needed in conventional modulation. This, in turn, can lead to SNR gains (for a given probability of error performance) in favor of index modulation ,.
Pseudo-random phase precoding (PRPP): The link reliability in single-input-single-output (SISO) fading channels is poor due to lack of diversity. One way to improve the link reliability is to get diversity gains through the use of multiple antennas. Diversity gains can be achieved even in single-antenna systems using rotation coding  or transmit power control . Transmit power control requires channel state information at the transmitter (CSIT). Whereas, rotation coding does not require CSIT. The idea in rotation coding is to use multiple channel uses and precode the transmit symbol vector using a phase precoder matrix without requiring more slots than the number of symbols precoded. A phase precoder matrix with optimized phases is shown to achieve a diversity gain of two in SISO fading channels . In , the rotation coding idea has been exploited for large precoder sizes. Instead of using optimized phases in the precoder matrix (solving for optimum phases for large precoder sizes is difficult), pseudo-random phases are used. Also, the issue of detection complexity at the receiver for large precoder sizes has been addressed by using the low complexity likelihood ascent search (LAS) algorithm in . It has been shown that with pseudo-random phase precoding (PRPP) and LAS detection, near-exponential diversity is achieved in a SISO fading channel for large precoder sizes (e.g., precoder matrix).
PRPP-SM: In ,, a PRPP-SM scheme which simultaneously exploits the diversity advantage of PRPP and the SNR advantage of SM is proposed. The PRPP-SM scheme precodes both the modulation bits and the antenna index bits using pseudo-random phases. The PRPP-SM scheme has been shown to outperforms both the PRPP scheme without SM and the SM scheme without PRPP.
In this paper, we introduce the idea of index modulation applied to the choice of precoder matrix at the transmitter, which we refer to as precoder index modulation. In the precoder index modulation (PIM) scheme, additional information bits are conveyed through the choice of a precoding matrix from a set of pre-determined PRPP matrices. We also combine the PIM and PRPP-SM schemes, and propose a PIM-SM scheme which conveys bits through both antenna index as well as precoder index. The rest of the paper is organized as follows. The PRPP, SM, and PRPP-SM schemes are introduced in Section II. The PIM and PIM-SM schemes are presented in Section III. Conclusions are presented in Section IV.
Ii PRPP, SM, and PRPP-SM schemes
In this section, we briefly introduce PRPP, SM, and PRPP-SM schemes.
Ii-a PRPP scheme
Figure 1 shows the PRPP transmitter. The PRPP transmitter takes modulated symbols and forms the symbol vector , where is the modulation alphabet. The symbol vector is then precoded using a precoding matrix to get the transmit vector . The th entry of the precoder matrix is , where the phases are generated using a pseudo-random sequence generator. The seed of this random number generator is pre-shared among the transmitter and receiver. The precoded sequence is transmitted through the channel, which is assumed to be frequency-flat fading. The channel fade coefficients are assumed to be i.i.d from one channel use to the other. At the receiver, after channel uses, the received symbols are accumulated to form the received vector , given by
where , , s are i.i.d. complex Gaussian fade coefficients with zero mean and unit variance, and is the noise vector whose entries are distributed as . The entries of the matrix are uncorrelated and . This creates a virtual MIMO system. It has been shown in  that as the precoder size becomes large (e.g., ) the performance of PRPP in SISO fading, using the likelihood ascent search (LAS) detection algorithm in  with MMSE initial solution, approaches exponential diversity performance (i.e., close to SISO AWGN performance). This point is illustrated in Fig. 2 which shows the performance of PRPP with BPSK modulation for and 400 in SISO fading channels.
Ii-B SM scheme
The SM scheme uses transmit antennas but only one transmit RF chain as shown in Fig. 3. The number of transmit RF chains, . In a given channel use, the transmitter selects one of its transmit antennas, and transmits a modulation symbol from the alphabet on the selected antenna. The number of bits transmitted per channel use through the modulation symbol is , and the number of bits conveyed per channel use through the index of the transmitting antenna is . Therefore, a total of bits per channel use (bpcu) is conveyed. For e.g., in an SM system with and 8-QAM, the spectral efficiency is 4 bpcu.
The SM alphabet set for a fixed and is given by
For e.g., for and 4-QAM, is given by
Let denote the transmit vector. Let denote the channel gain matrix, where denotes the channel gain from the th transmit antenna to the th receive antenna, assumed to be i.i.d complex Gaussian with zero mean and unit variance. The received signal at the th receive antenna is
where is the number of receive antennas, is the th symbol in transmitted by the th antenna, and is the noise component. The signals received at all the receive antennas can be written in vector form as
For this system model, the maximum likelihood (ML) detection rule is given by
Ii-C PRPP-SM scheme
The PRPP-SM scheme is an SM scheme whose modulation bits as well as antenna index bits are precoded by a PRPP matrix ,. The PRPP-SM transmitter consists of transmit antennas and transmit RF chains as shown in Fig. 4. It takes modulated symbols and forms the symbol vector , where is the modulation alphabet. A matrix of size denotes the transmit antenna activation pattern, such that . The matrix consists of submatrices , , each of size , such that , and . The submatrix is constructed as
where is a vector of zeroes, and is a vector constructed as
where is the index of the active antenna during the th channel use. For e.g., in a system with and , to activate antennas 1, 2 and 1 in three consecutive channel uses, respectively, the matrix is given by
Note that the indices of the non-zero rows in matrix gives the support of the spatially modulated vector . For e.g., in (9), the support given by is .
The vector is then precoded as , using a rectangular precoder matrix of size . The th entry of the matrix is , where the phases are generated using a pseudo-random sequence generator, whose seed is pre-shared among the transmitter and receiver. The output of the precoder is transmitted on the selected antenna in each channel use.
Let denote the number of receive antennas. The received signal vector at the receiver is given by
where , is the channel matrix of the th channel use, the elements of are i.i.d. complex Gaussian with zero mean and unit variance, is the noise vector, whose entries are distributed as . The ML detection rule for the PRPP-SM system is then given by
The indices of the non-zero rows in and the entries of are demapped to obtain the information bits.
For the same spectral efficiency, PRPP-SM scheme performs significantly better than SM scheme without PRPP and PRPP scheme without SM. This can be seen from Fig. 5, which shows the bit error performance of PRPP-SM, PRPP, and SM schemes at the same spectral efficiency of 3 bpcu. For e.g., at BER, the PRPP-SM scheme outperforms SM scheme without PRPP and PRPP scheme without SM by about 7 dB and 3 dB, respectively. This performance advantage in favor of the PRPP-SM scheme is due to the diversity gain offered by the pseudo-random phase precoding.
Iii Precoder index modulation
In this section, we introduce precoder index modulation (PIM) which conveys information bits through the choice of a precoding matrix among a set of pre-determined precoder matrices.
Iii-a Precoder index modulation (PIM)
In the proposed PIM scheme, the transmitter has equal number of transmit antennas and RF chains. Consider the case of . The idea here is to have a collection of precoder matrices each of size and choose one among these matrices to precode modulation symbols from an alphabet in channel uses. Call this collection of matrices as ‘precoder set,’ denoted by . Therefore, the number of bits conveyed per channel use through precoder indexing is . The total number of bits per channel use (including precoder index bits and modulation symbol bits) is then given by
Construction of the precoder set: The precoder set is constructed as follows. Let denote the number of precoder index bits per channel use, i.e., . Generate a PRPP matrix of size , where . Note that the precoder set size . The matrix can be written as
where ’s are sub-matrices each of size . Now, the columns of a precoder matrix are obtained by drawing one column from each , . Each of such draws form one precoder matrix. Since there are columns in each , the number of such possible draws is , which gives us all the matrices in the precoder set. For e.g., consider and , and
The precoder set for this example is given by
System model: The PIM transmitter is shown in Fig. 6(a). It takes bits and encodes them as follows. The bits are used to obtain modulation symbols. Let denote the vector of these modulation symbols. The vector is precoded by a precoder matrix chosen from whose index is given by the bits. The transmitter then sends one precoded symbol in every channel use. The detection is performed after channel uses. The received signal vector in this system model can be written as
where is the PRPP matrix chosen from , and is the channel matrix as described in Sec. III. The ML detection rule is given by
PIM with activation pattern matrix: The PIM scheme can also be described as follows. Consider an activation pattern matrix generated using bits, similar to the activation pattern matrix described in Sec. II-C. Note that . The vector is precoded with the matrix to get the transmit vector. The received signal vector in channel uses can be expressed as
The matrix is a PRPP matrix. The matrix chooses one column from the columns of every to get a PRPP matrix . Thus, the choice of from columns conveys information bits, where can be viewed as the precoder equivalent of the spatial antennas in SM, which are indexed by the information bits. The ML detection rule for this alternate system model is given by
The indices of the non-zero rows in and the entries of are demapped to obtain the information bits. The precoder matrices convey information bits in addition to providing diversity, and we can achieve the advantages of SM-MIMO in a SISO fading channel through PIM. Also, by taking the view of (14), detection algorithms meant for SM can be effectively used for PIM detection.
Simulation results: In Fig. 7, we present the BER performance of the PIM scheme with and 4-QAM, using ML detection. We compare this performance with the ML detection performance of PRPP scheme without SM for and 16-QAM, and SM scheme without PRPP for and 4-QAM. Note that the spectral efficiency in all the three schemes is 4 bpcu. We see that PIM outperforms PRPP without SM and SM without PRPP. For e.g., at BER, PIM preforms better than PRPP without SM by about 2.5 dB and better than SM without PRPP by about 12.5 dB. The PIM scheme achieves better performance than PRPP without SM because PIM can use a smaller sized (and hence more power efficient) modulation alphabet compared to PRPP without SM. Also, the reason behind the better performance of PIM compared to SM without PRPP is that PIM provides diversity gain due to precoding. Thus, PIM provides the benefits of both diversity advantage of PRPP and SNR advantage of SM. Note that the PRPP-SM scheme in Sec. II-C also provides both these advantages, but the possibility of using smaller-sized modulation alphabet in PRPP-SM arises due to antenna indexing, whereas in PIM it arises due to precoder indexing. Therefore, PIM avoids the need to use multiple transmit antennas compared to PRPP-SM. This observation leads us to consider exploiting the antenna indexing in SM for further reduction in modulation alphabet size in PIM. We refer to such a PIM scheme that exploits both precoder indexing as well as antenna indexing as PIM-SM scheme. The proposed PIM-SM scheme is presented in the following subsection.
|Scheme||Number of bits conveyed through||Precoding done on|
Iii-B Precoder index modulation with SM (PIM-SM)
The proposed PIM-SM scheme uses transmit antennas and one transmit RF chain, so that bits are conveyed as antenna index bits. These bits are in addition to the bits conveyed in PIM. Therefore, the spectral efficiency of the PIM-SM scheme is
For immediate reference and comparison, the spectral efficiencies achieved by the different schemes and the bits that are precoded in these schemes are tabulated in Table I.
System model: The PIM-SM transmitter is illustrated in Fig. 6(b). The system model for the PIM-SM scheme can be written as
where is the activation pattern matrix of the PRPP-SM scheme defined in Sec. II-C. The ML detection rule for PIM-SM can then be written as
The indices of the non-zero rows in , index , and the entries of are demapped to obtain the information bits.
Simulation results: In Fig. 8, we present the BER performance of PIM-SM scheme with , BPSK and , using ML detection. We also plot the ML detection performance of the PIM scheme (without SM) for , 4-QAM, and . We have also plotted the ML detection performance of PRPP-SM scheme with , 4-QAM, and . Note that the spectral efficiency is 4 bpcu in all the three schemes. It can be seen that the PIM-SM scheme performs better than PIM scheme. This is because of the smaller-sized modulation alphabet in PIM-SM (BPSK) compared that in PIM (4-QAM). Also, PIM-SM performance is similar to that of PRPP-SM.
We introduced precoder index modulation (PIM) in this paper. We proposed a PIM scheme which conveys additional information bits through the choice of a precoding matrix from a set of pre-determined PRPP matrices. Combining the PIM and PRPP-SM schemes, we proposed a PIM-SM scheme which conveys bits through both antenna index as well as precoder index. We showed the performance of PIM and PIM-SM schemes for small precoder sizes using ML detection. Design of low complexity detection algorithms for PIM and PIM-SM for large precoder sizes is open for future extension.
-  J. G. Proakis, Digital Communications, 4th Ed., Mc-Graw Hill, 2001.
-  M. Di Renzo, H. Haas, A. Ghrayeb, S. Sugiura, and L. Hanzo, “Spatial modulation for generalized MIMO: challenges, opportunities and implementation,” Proceedings of the IEEE, vol. 102, no. 1, pp. 53-55, Jan. 2014.
-  A. Chockalingam and B. Sundar Rajan, Large MIMO Systems, Cambridge Univ. Press, Feb. 2014.
-  R. Abu-alhiga and H. Haas, “Subcarrier-index modulation OFDM,” Proc. IEEE PIMRC’2009, pp. 177-181, Sep. 2009.
-  E. Basar, U. Aygolu, E. Panayirci, and H. V. Poor, “Orthogonal frequency division multiplexing with index modulation,” Proc. IEEE GLOBECOM’2012, pp. 4741-4746, Dec. 2012.
-  N. Serafimovski1, S. Sinanovic, M. Di Renzo, and H. Haas, “Multiple access spatial modulation,” EURASIP J. Wireless Commun. and Networking 2012, 2012:299.
-  T. Lakshmi Narasimhan, P. Raviteja, and A. Chockalingam, “Large-scale multiuser SM-MIMO versus massive MIMO,” IEEE ITA’2014, San Diego, Feb. 2014. Also available online: arXiv:1311.1291 [cs.IT] 6 Nov 2013.
-  D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, 2005.
-  V. Sharma, K. Premkumar and R. N. Swamy, “Exponential diversity achieving spatio-temporal power allocation scheme for fading channels,” IEEE Trans. Info. Theory, vol. 54, no. 1, pp. 188-208, Jan. 2008.
-  R. Annavajjala and P. V. Orlik, “Achieving near exponential diversity on uncoded low-dimensional MIMO, multi-user and multi-carrier systems without transmitter CSI,” Proc. ITA 2011, Jan. 2011.
-  K. V. Vardhan, S. K. Mohammed, A. Chockalingam, and B. S. Rajan, “A low-complexity detector for large MIMO systems and multicarrier CDMA systems,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, pp. 473-485, Apr. 2008.
-  T. Lakshmi Narasimhan, Y. Naresh, T. Datta, and A. Chockalingam, “Pseudo-random phase precoded spatial modulation,” available online arXiv:1401.6543v1 [cs.IT] 25 Jan 2014.
-  T. Lakshmi Narasimhan, Y. Naresh, T. Datta, and A. Chockalingam, “Pseudo-random phase precoded spatial modulation and precoder index modulation,” accepted in IEEE GLOBECOM’2014, Dec. 2014.