IEEE ICC 2015 - Wireless Communications Symposium
Spatial Modulation for Massive MIMO
Dushyantha A. Basnayaka and Harald Haas
Institute for Digital Communications, The University of Edinburgh, Mayfield Road, Edinburgh, UK
E–mail:{d.basnayaka, h.haas}@ed.ac.uk
Abstract—Multiple-input multiple-output (MIMO) systems can
increase wireless link capacity without requiring additional
bandwidth and power. On the one hand, MIMO systems heavily
depend on channel state information (CSI) at the receiver. It
has also been shown that CSI at the transmitter (CSIT) can
improve the link capacity and reliability considerably but with
the disadvantage of extra feedback and computational costs.
On the other hand, energy efficiency of MIMO systems could
adversely increase with the number of antennas in the link.
Therefore, there are considerable interests in energy efficient
practical transmission schemes for MIMO links without CSIT. In
this study, an emerging wireless communication concept which
is termed as spatial modulation (SM) is considered for large
scale MIMO. The results show that in information-theoretic
viewpoint, SM achieves capacity comparable to the open-loop
MIMO capacity even though a subset of transmit antennas is
activated in every channel use. The reason is both the channel
coefficients and input symbols carry information in SM. As a
result, SM regains (compensates) the loss of information capacity
due to activating a subset of antennas by modulating information
in the antenna index. This means that the sum information rate
remains high.
I. I NTRODUCTION
Multiple-input-multiple-output (MIMO) is a promising
technology for increasing the link capacity and/or reliability
in modern communication systems. Multi element antennas
are used in many scenarios such as point-to-point links [1],
[2], multiuser links [3], and macrodiversity links [4]. The
capability of MIMO for achieving higher throughput is due
to the fact that multiple independent spatial data streams can
be transmitted in the same time and frequency resource. A key
enabler for MIMO operation is the rich scattering environment
between transmit and receive antennas, and that receivers can
successfully separate the multiple data streams transmitted
with the assistance of channel state information (CSI) at the
receiver. It has also been shown that CSI at the transmitter
(CSIT) can increase the capacity in the moderate signal-to-
noise ratio (SNR) region [5]. However, acquiring CSIT is a
costly process. It has several phases which include estimating
CSI at the receiver, and feeding back appropriate information
to the transmitter [6]. The cost continuously increases with the
number of constituent links in the MIMO link. One of the main
challenges of future communication systems is finding the
right compromise between spectral and energy efficiency. The
energy efficiency of MIMO systems could adversely increase
with the number of transmit antennas in the link. Therefore,
research has focused on energy efficient transmission schemes
to achieve MIMO capacity without CSIT. Also, [7, see Section
5] reports on massive MIMO to achieve capacity in the
978-1-4673-6432-4/15/$31.00 ©2015 IEEE 1945
absence of CSIT before a link is established with a terminal.
There are existing transmission schemes for MIMO links in
the absence of CSIT. Among them standalone space-time (ST)
code and spatial multiplexing (SMX) are prominent [8], [1].
In SMX, as many independent data streams as the number of
transmit antennas are transmitted in a single use of the channel,
and it has been shown to have reasonable decoding complexity
[1]. In ST coding, redundancy is added to the transmit symbol
to provide multiple independent replicas of the transmit data
symbols to the receiver.
In this work, a simple information based antenna switching
technique called Spatial Modulation (SM) is considered as a
possible transceiver solution for MIMO links with no CSIT
[9], [10], [11]. As explained in Section II, SM modulates
information in both the signal constellation and antenna index.
In addition to its simplicity, the ability to control the number
of transmit RF chains in SM is very important in terms
of the transmit power efficiency. In contrast to the spatial
multiplexing and ST coding, SM uses a subset of transmit
antennas for transmission. The operation and performance of
SM are now well-understood [10]. The optimum detection of
SM is investigated in [12], and average bit error probability
in different fading scenarios is analysed in [13]. The effect of
channel estimation error and the effect of antenna switching
on the bandwidth efficiency are investigated in [14] and [15],
respectively. The channel estimation of SM is considered in
[16], and energy efficiency of SM is comprehensively studied
in [17].
The main objective of this work is to investigate the poten-
tial gain of SM in a massive MIMO system with no CSIT. In
particular, a MIMO scenario with a large number of transmit
antennas with relatively fewer number of receive antennas is
considered. This scenario typically occurs in cellular downlink
communication from a base station (BS) to a user terminal.
On the one hand, transmission schemes such as vertical
Bell Laboratories layered space-time (V-BLAST) [1] could
be employed with random beamforming [18]. On the other
hand, standalone ST code could also be used for such MIMO
systems, but ST codes may experience rate loss for a higher
number of transmit antennas [19]. Since both V-BLAST and
ST code transmit using all transmit antennas, their energy
efficiency may not scale well with the number of transmit
antennas due to the large number of power amplifiers.
The investigation starts with an information-theoretic capac-
ity analysis of SM in additive white Gaussian noise (AWGN)
channels, and fading. Unlike conventional MIMO links, the
wireless channel itself carries information, therefore capacity
 IEEE ICC 2015 - Wireless Communications Symposium
analysis tends to be more challenging. Research has been
undertaken on capacity analysis [20]. The focus has been in
analysing the information capacity conveyed in the antenna
index and signal constellation separately. Also, the capacity
analysis in [20] does not have a closed form solution which
could be used for further optimization. However, in the study
here a different approach is used in which the system is
modeled as two independent sources of information, con-
stellation and antenna index with multiplicative interaction.
This model allows the calculation of the capacity in a more
straightforward manner. The optimal channel input distribution
for SM is analytically obtained. Then, the theoretical capacity
results are compared with mutual information (MI) results
for SM with suboptimal channel inputs: practical modulation
schemes such as quadrature amplitude modulation (QAM), and
the performance of SM is assessed in terms of its practical
information transfer capability.
The rest of the paper is laid out as follows. Section II
describes the system model, and the main analysis is given
in Section III. Sections IV provides numerical results, and
Section V gives the conclusion.
II. S YSTEM M ODEL
A single user point-to-point MIMO communication system
with SM in Rayleigh fading with N transmit and nR receive
antennas is considered. By adopting the well-established com-
plex baseband mathematical model, C nR ×N channel matrix,
H captures the fading between the transmit and the receive
antenna array. The channel matrix H contains elements,
hik ∼ CN (0, 1) which represents the complex channel gain
between the transmit antenna k and the receive antenna i,
where E |hik |2 = 1. Here CN (0, 1) denotes a zero mean
circularly symmetric complex Gaussian (ZMCSCG) random
variable with unit variance, and E {.} denotes the expectation
operation. Every channel element, hik , is assumed to be drawn
from a complex random process, H, with finite raw moments.
This complex random process consists of two independent and
identically  (iid) real random processes (i.e., ∈ R).
distributed
Let E hℓI and E hℓQ be the ℓth raw moments of real and

imaginary random processes which make up H, respectively.
The SM scheme considered in this paper activates several
antennas for data transmission, and an independent data stream
is transmitted from each antenna. The number of the allowed
set of antennas

generally has to be an integer power of 2.
There are N T possible sets for a SM system if the number of
active antenna is T . Assume only L sets are configured as legal
antenna sets for data transmission, and T constellation symbols
are directly transmitted from all active antennas. The incoming

bit sequence is segmented into blocks (say b ) of log2 LM T
bits. The first log2 L bits are modulated in the antenna index,
while the next T log2 M bits are conventionally modulated
using QAM constellation. The first log2 L bits select what
antenna set is activated in the current channel use and the
second T log2 M bits select the symbols which are transmitted
by all active antennas. In this study, the set of active transmit
antennas are denoted by Υi where Υi ∈ {Υ1 , . . . , ΥL }. The
1946
effective baseband receive vector is given by:
√
r = gV V x + n, (1)
n o
where C nR ×T matrix is V ∈ H̃ H 1 , . . . , H̃ Hi
H L . The matrix H̃
is a submatrix of H which consists of channel elements from
all active antennas in the set, Υi , to all receive antennas, and
it is denoted as:
H i = H {Υi } .
H̃ (2)
n o
The alphabet of V is denoted as H̃ H 1 , . . . , H̃
H L . The constant
g is defined to capture the average link power drop between
transmit antennas and receive antennas due to shadowing and
path loss. It is assumed here that both transmit and receive
antennas are co-located so that the average link SNR, g of
each constituent link is the same in contrast to macrodiversity
MIMO [4]. The average transmit power of the data signal
x is set to Es , and n denotes the C nR ×1 AWGN vector.
Its distribution is denoted by n ∼ CN 0 , σ 2I . Here, the


transmit precoding is omitted due to the absence of CSIT.
It is convenient to denote the ith column of V as v i , so
V = (vv 1 , . . . , v T ). For example, consider a SM system with
N = 4, T = 2. There are 6 possible sets but only 4 sets are
selected as (1, 2) , (1, 3) , (1, 4) , (2, 3). The modulator selects
one of these four sets depending on the first 2 bits of the
segment and selects x from a 4-QAM constellation depending
on next 4 bits if 6-bits transmission is required. If more bits
are to be transmitted, higher order signal constellations have
to be employed. At the receiver, the joint maximum likelihood
decoder in AWGN channel is employed:
√
b̂b = arg min krr − gV V xk , (3)
V ,x
where k.k denotes the Euclidean vector norm.
III. M AIN C APACITY A NALYSIS
Firstly, the case with a single receive antenna is considered,
and an extension to the general antenna case is followed.
1) nR = 1: The capacity of SM for a fixed channel
depends on the particular selection of antennas sets. The
general baseband equation in (1) reduces to:
√
r = gvvx + n, (4)
for nR = 1 where C 1×T vector v = (v1 , . . . , vT ) has a discrete
T
alphabet, and the transmit C T ×1 vector, x = (x1 , . . . , xT )
has equal power constellation symbols and the power of each
symbol is set to Es /T . The channel matrix is reduced to a
x, v ; r)
vector, h . First, an upper bound for the sum capacity, I (x
is obtained. From the chain rule for MI:
x, v ; r) = H (r) − H (r|x
x, v ) ,
I (x (5)
where H (.) denotes the differential entropy. It can be shown
that H (r|x x, v ) = log2 πeσ 2 in AWGN channels. Since,
x, v ; r) is maximum when H(r) is maximum, maximizing
I (x
the entropy of r remains. H(r) can be upper bounded by the
entropy of a complex Gaussian random variable with variance
 IEEE ICC 2015 - Wireless Communications Symposium

that is the same as that of r. Therefore, the capacity of SM is: of the complex signal, xi = xIi + jxQi which is denoted as
the distribution of either xIi or xQi is considered here. The
gσz2
 
C = max I (xx, v ; r) ≤ log2 1 + 2 , (6) characteristic function (CF) from (27) in Corollary 3 for xIi
x σ
is:
where σz2 is the second moment of z, and z = v x . Since, x X∞
(jt)
ℓ
and v are independent: ϕxIi (t) = mxℓ Ii , (9)
ℓ!
ℓ=0
Es
σz2 = Ev v v H

, where
T
Es i/2
 
ℓ/2 PNi 2
= Ev1 ,...vT v1 v1 + · · · + vT vTH
 H
. (7)  (ℓ−1)!!Es
 k=1 aik eIik
if ℓ is even,
T mxℓ Ii = (2T )ℓ/2 L
 ℓ−2
2
PNi 
aik eℓIik (10)
k=1
If transmit antenna k is activated dk times in total, σz2 reduces 

0 if ℓ is odd.
to (see Example 1):
where (ℓ − 1)!! denotes the double factorial, i.e., the product
Es H
σz2 = h Dh , (8) of every odd numbers from ℓ − 1 to 1. From Lemma 1, as
LT
Ni → ∞ regardless of the weights, aik s:
where the diagonal matrix D = diag (d1 , . . . , dN ). Substi- !N #
i
tuting the result from (8) into (6), the desired result for the 1 X
aik eIik = E hℓI ,
ℓ

(11)
upper bound is obtained. The alphabets for v1 to vT depend L
k=1
on the selection of the transmit antenna sets. The alphabet P 2
of each vi has a different number of distinct elements, and PNi 2
aik /
Ni
→ 0. Since all aik are integers,
if k=1 k=1 aik
the same element may occur multiple times. The following
this condition is always satisfied, but depending on the actual
is defined to capture this. Let Ni (Ni ≤ N ) be the number
values of aik , the convergence speed may be changed. The
of distinct elements in the alphabet of vi . Let the alphabet
convergence speed could be improved by selecting active
of vi be vi ∈ {ei1 , . . . , eiNi }, and it is assumed that eik th
antenna sets which results Ni ≈ N . Then, (10) becomes:
element occurs aik times in the alphabet of vi , and all aik s are
ℓ/2

integers. Note that although a different notation is introduced  (ℓ−1)!!Esℓ/2 (E {h2I }) if ℓ is even,
xIi ℓ/2
E {h I }
ℓ
for the alphabet of vi here, they are actually drawn from the mℓ = (2T ) (12)
original channel matrix H , thus from the random process, 0 if ℓ is odd.

H, as shown in Example 1. Hence, theℓth raw moments This confirms that the per dimension input distribution does
of real and imaginary parts of eik are E hℓI and E hℓQ ,

not depend on CSI but CDI. Similar to the approach in
respectively ∀i, k. Due P to the constraint on the total number Corollary 3, per stream input distribution can be derived, and
of active antenna sets, k aik = L for all i. If the capacity
upper bound is to be achieved in the additive Gaussian noise Q fXi . The independent stream
thus the full input distribution,
transmission implies fx = i fXi . Due to the channel model
channel, it is clear that each complex product, vi xi of z should considered in this paper (see Section II), alphabets of all vi s
be Gaussian variate. It appears that CSIT is essential in order are drawn from the same random process. As a result, all xi s
to make z Gaussian variate. Moreover, it is not clear whether are identically distributed.
z could be made Gaussian variate even with ideal CSIT.
However, an interesting scenario occurs in the massive MIMO Corollary 1 shows that in massive MIMO scenarios, ( i.e.,
regime where the capacity upper bound is indeed achievable N → ∞), the input distribution does not depend on v . How-
with no CSIT. The following result will be useful towards ever, it further shows that the input distribution depends on the
proving this conjecture. CDI. Unlike in SISO fading channels, the capacity achieving
x is not always Gaussian. Therefore, in the absence of CSIT or
Corollary 1. If a SM system is designed in such a way that in strictly with no CSIT but with CDI at the transmitter (CDIT),
the limit of N → ∞, all Ni → ∞, the capacity upper bound the capacity upper bound in (6) is indeed achievable in the
in (6) is almost surely achievable, and the input distribution of limit of N . Hence, the capacity of SM with a deterministic
x is independent of CSI but channel distribution information wireless channel in a massive MIMO system can be given as:
(CDI).  ρ H 
C = log2 1 + h Dh , (13)
Proof: In order to achieve the capacity upper bound in LT
PN
(6) in Gaussian noise channels, it is clear that z should be where k=1 dk = LT , and ρ = gEsn/σ 2 . The  ergodic capacity
o
made Gaussian
P variate. The sum of complex scalar products, in fading, CF , becomes CF = Eh log2 1 + LT ρ
h H Dh .
z, is: z = i vi xi . If each product can be made Gaussian, The exact value of the diagonal elements of D depends on the
as a result, z become Gaussian. Hence, an arbitrary product selection of active antenna sets. Moreover, in Rayleigh fading
denoted as vi xi and per stream input distribution denoted as i.e., samples of v are drawn from a ZMCSCG random process,
fXi are considered. Let eik be eik = eIik + jeQik , where eIik the following result for the PDF of xi ∀i can be obtained.
is the real part of eik . The per dimension input distribution

1947
 IEEE ICC 2015 - Wireless Communications Symposium

following example further explains the analysis.

1

0.8 product Example 1. Consider a SM system where the number of trans-

0.6
Gaussian mit antennas is set to N = 4 and the number of active anten-
CDF

N=4 nas is set to T = 2 for simplicity. Let the allowed antenna sets
0.4
be (1, 2) , (1, 3) , (1, 4) , (2, 3), making L = 4. It is clear that
0.2
the alphabet for v1 is h1 , h2 and for v2 is h2 ,h3 , h4 , thus N1 =
 H 1 2 2
0
−3 −2 −1 0 1 2 3 2 and N2 = 3. Therefore, Ev1 v1 v1 = L 3 |h1 | + |h2 | ,
Re (product) 
2 2 2

and Ev2 v2 v2H = L1 |h2 | + 2 |h3 | + |h4 | . After sub-

1

0.8 product stituting these results into (7) with some simplifications, we
0.6 Gaussian arrive at σz2 = E8s h H Dh , where in this particular case,
CDF

0.4 N=32 D = diag (3, 2, 2, 1). A SM system with a following mod-

0.2
ified antenna set, (1, 2) , (3, 1) , (4, 3) , (2, 4), may be more
favourable from information-theoretic viewpoint because, N =
0
−3 −2 −1 0 1 2 3 N1 = N2 = 4, the maximum allowed by the system dimension.
Re(product)
2) nR > 1: The analysis follows the same logic as for a
Fig. 1. Cumulative distribution function (CDF) comparison of the real part single receive antenna case. The channel equation is given in
of an arbitrary product of z, vi xi with different N in Rayleigh fading. The
optimum input distribution in Corollary 2 is used, and Es = 0 dB.
(1), and the focus is on the product, z = V x . Each element of
z is a sum of complex scalar products. Therefore, the results
in Section III-1 are extended. The details are omitted here, and
Corollary 2. In Rayleigh fading, and in the limit of N → ∞, the final result for fixed channel matrix H is given by:
the capacity achieving per stream input distribution, fXi ∀i ρ
C = log2 I + H DH H , (17)
converges in distribution to fXi (xi ) = g (xIi ) g (xQi ), where LT
the per dimension density function is given by: and the ergodic capacity in fading becomes:
ρ
! r # ! r # n o
1
g (s) = δ s +
Es 1
+ δ s−
Es
, (14) CF = EH log2 I + H DH H , (18)
2 2T 2 2T LT
where |.| denotes the matrix determinant. One may compare
where δ (s) is the direct delta function. (18) with the capacity results in the absence of CSI at the
transmitter in [2].
Proof: The per dimension density function of xi is
derived. The product vi xi is considered, and the results of A. Remarks
Corollary 1 are applied. From (12), in Rayleigh fading:
 i/2 The most favorable fading scenario for SM in AWGN
 2  i 1 channel is Rayleigh fading. In undesirable fading scenarios
E hI = 1/2, and E hI = (i − 1)!! . (15)
2 where different antenna sets are difficult to distinguish at the
receiver, the information transferred in the antenna set index is
Application of (15) into (12) directly yields that mxi Ii =
i/2 degraded. In SM, the total capacity depends on the individual
(Es /2) for i is even and zero otherwise. It gives: capacities achieved by both constellation symbols (say Cx )
E s t2 E 2 t4 E 3 t6 and antenna set index (say CV ). In undesirable fading, SM
ϕxIi (t) = 1 − + s2 − s3 + . . . , capacity is mainly governed by Cx . For instance, if all channel
2T 2! 4T 4! 8T 6!!
∞ i √
2i elements are approximately equal, CV → 0, thus SM capacity
r #
X (−1) Es t Es
= i
= cos t . (16) decreases to the capacity of a nR ×T MIMO system, where fx
(2T ) 2i ! 2T
i=0 converges to a T -variate jointly Gaussian distribution, because

ℓ/2
E hℓI = E h2I
 
By inverting CF for xIi in (16), the optimum per dimension ∀ℓ in (12). Therefore, channel input
input distribution in Rayleigh fading can be found as shown distribution should be adjusted in accordance with the fading
in (14). scenario. In this context, the analysis in this study can be useful
Similarly, input distributions can be obtained for any fading to derive the optimum channel input distribution for a given
scenario such as Rician fading and space correlated fading fading scenario, thus the dependence of input distribution on
[22]. Also, this approach could be employed to derive the the distribution information of fading is not surprising.
optimal input distribution for channels that do not have a sta-
tistical fading model, but measured data. In this context, (12) IV. N UMERICAL R ESULTS AND D ISCUSSION
may be particularly useful, where sample moments may be In this section, a simulation study for comparing theoretical
used instead of distribution moments. For illustrative purposes, results obtained in Section III with the link-level MI attainable
the results of a Monte-Carlo simulation are shown in Fig 1 in with practical constellations in Rayleigh fading is presented.
order to confirm the postulate presented in Corollary 2. The The ergodic MI in spatially uncorrelated Rayleigh fading H

1948
 IEEE ICC 2015 - Wireless Communications Symposium

0
25 10

capacity
bits/channel use

20

average BER
mutual infor.
15
n =3
R Shannon limit
10
nR=2 uncoded SM
5 uncoded SMX
−5
0 10
−5 0 5 10 15 20 25 0 5 10 15 20 25 30
SNR [dB] SNR [dB]

Fig. 2. Ergodic capacity and link-level mutual information of a MIMO system Fig. 3. Uncoded average bit error probability of SM and spatial multiplexing
with SM, and γ = 15, N = 64. with γ = 15, N = 64, and nR = 3.

can be calculated as CFSIM = EH {I (V V , x ; r |H

H )}. The receive V. C ONCLUSION
SNR is set to gEs /σ 2 . The modulation rate, γ (in bits/channel-
In this study, the information-theoretical capacity limit of
use) denotes the number of bits modulated into the channel in
SM in the absence of CSI at the transmitter is analyzed. It
a single channel-use. Note that the number of bits consists of
has been shown that information based antenna switching has
both information and redundant bits.
the potential to achieve capacity comparable with open-loop
A SM system with nR = 2, 3 is considered. The ergodic
MIMO systems. The reason is that SM modulates information
capacity is compared with the achievable link-level MI with
in the antenna index which is in complete contrast to plain
γ = 15. Here, N = 64, L = 4096 and T = 3. Accordingly,
antenna switching techniques. Unlike conventional MIMO
4096 set of 3 antenna sets is selected for transmission, where
operations, both the channel coefficients and input symbols
antenna sets are organized as in Example 1 in order to make
carry information. As a result, SM regains (compensates) the
Ni = N ∀i. In order to achieve γ = 15, 12-bits are modulated
loss of information due to activating a subset of antennas by
in the L antenna sets and 3 BPSK symbols are transmitted
modulating information in the antenna set index. Then the
directly from T antennas. Results are shown in Fig. 2. The
sum capacity (given in (18)) remains high. It has been further
theoretical capacity in (18) is also shown for comparison. The
shown that through Monte-Carlo simulation for link-level MI,
theoretical capacity of SM, and the simulated MI with practical
the theoretical limit can be reached with practical constellation
constellation are comparable even with not-so-large number of
in operationally important SNR regions.
transmit antennas. The MI apparently follows the theoretical
capacity in SNR as high as 20 dB with nR = 2, but it reduces
to 10 dB in nR = 3. The MI curves saturate at 15 bits/channel- A PPENDIX A
use because, the channel input entropy, H (bb)=15 bits. S OME U SEFUL R ESULTS
In Fig. 3, the uncoded average bit error probability of
a SM system with N = 64 and nR = 3 is considered. Theorem 1. Let V be an uniformly distributed real discrete
For comparison, a SMX system with 15 independent BPSK random variable with a support of V ∈ {v1 , . . . , vN }, and
modulated signal streams is also considered, where random X is a real zero mean Ex variance random variable. The
precoding [18] is used to map 15 data streams to 64 transmit elements (i.e., vk s) of the alphabet of V are drawn from a
antennas, and nR = 3. As shown in Fig. 3, SM and SMX randon process with finite raw moments. The
ith raw moment
achieve comparable average BER at all SNR considered. of the random process is denoted by E v i . Note that −∞ ≤
vi ≤ ∞ for all i. Let the real random variable Z be Z = V X.
d
LetgX P be the PDFof X. In the limit of N → ∞, Z − →
N
( k=1 vk )
2
d
A. Final Remarks N 0, N Ex , where − → denotes the convergence in
distribution, if X variates with the following density function:
This study shows that SM can achieve capacity com-
∞
!  #
parable to the theoretical capacity of MIMO systems. For X s
gX (s) = φ(s) 1 + A2i He2i √ (19)
instance a 3 × 64 MIMO system with SM could theoretically, Ex
i=2
achieve nearly 10 bits/channel-use (see Fig. 2), with a strong
channel coding scheme of rate, R = 2/3 at SNR=10 dB where:
[21]. Therefore, based on this analysis, SM type transmission 1 s2
φ(s) = √ e− 2Ex , (20)
schemes are proposed for spectral and energy efficient MIMO 2πEx
communication systems which have a fewer number of receive i
X (−1)
k
antennas in comparison with the number of transmit antennas. A2i = mX
2i−2k . (21)
k! (2i − 2k)!2k
k=0

1949
 IEEE ICC 2015 - Wireless Communications Symposium

The ith raw moment of X, mX i : Proof: See [22].


 (i−1)!!Exi/2 (E {v2 })i/2 ACKNOWLEDGEMENT
if i is even,
mX
i = E{v i } (22) The authors acknowledge support from the Engineering
0 if i is odd. and Physical Sciences Research Council (EPSRC) under
The RV, X converges in distribution to an independent random Established Career Fellowship grant EP/K008757/1.
variable which is independent of V , but the distribution R EFERENCES
information of V . Here Hei (t) is the ith probabilists’ Hermite
[1] G. J. Foschini, “Layered spacetime architecture for wireless communica-
polynomial, and: tion in a fading environment when using multiple antennas,” Bell Labs
1 ∞ Syst. Tech. J., vol. 1, p. 41-59, Autumn 1996.
Z
Ai = Hei (t) f (t) dt. (23) [2] E. I. Telatar, “Capacity of multi-antenna Gaussian channels,” Eur. Trans.
i! −∞ Telecommun., vol. 10, pp. 585–595, Nov. 1999.
[3] D. Gesbert, M. Kountouris, R. W. Heath, C. B. Chae, and T. Salzer,
Proof: See [22] “Shifting the MIMO paradigm,” IEEE Signal Processing Mag., vol. 24,
no. 5, pp. 36–46, Sep. 2007.
Corollary 3. Let Z be a complex random variable defined by [4] D. A. Basnayaka, P. J. Smith and P. A. Martin, “Performance analysis
Z = V X, and V be an uniformly distributed complex discrete of macrodiversity MIMO systems with MMSE and ZF receivers in flat
Rayleigh fading,” IEEE Trans. on Wireless Commun., vol. 12, no. 5, pp.
random variable with a support of V ∈ {h1 , . . . , hN }. The 2240–2251 , May 2013.
elements (i.e., hk ) of the alphabet of V are drawn from a
[5] E. Biglieri, R. Calderbank, A. Constantinides, A. Goldsmith, A. Paulraj,
complex random process with finite raw moments. Let E hiI and H. V. Poor , MIMO Wireless Communications, Cambridge University
i

Press, 2007.
and E hQ be the ith raw moments of real and imaginary [6] D. J. Love, R. W. Heath Jr., V. K. N. Lau, D. Gesbert, B. D. Rao, and
parts respectively of this random process. X = XI +jXQ is a M. Andrews, “An overview of limited feedback wireless communication
zero mean Ex variance complex random variable with iid real systems,” IEEE Jour. Select. Areas in Commun., vol. 26(8), pp. 1341–
1365, Oct. 2008.
and imaginary components. Note that −∞ ≤ hIi , hQi ≤ ∞ [7] E. G. Larsson, F. Tufvesson, O. Edfors, and T. L. Marzetta, “Massive
for all i. In the limit of N (i.e., N → ∞), Z converges in MIMO for next generation wireless systems,” IEEE Wireless Commun.
→ CN 0, khNk Ex , if X
2

d Mag., online http://arxiv.org/pdf/1304.6690v2.pdf.
distribution to a Gaussian RV: Z −
[8] H. Jafarkhani, Space-Time Coding: Theory and Practice, Cambridge
variates with the following distribution function: fX (x) = University Press, 2005.
g (xI ) g (xQ ) where: [9] R. Mesleh, H. Haas, S. Sinanovic, C. W. Ahn, and S. Yun, “Spatial
Modulation,” IEEE Trans. on Veh. Tech., vol. 57, no. 4, pp. 2228–2241,
∞ Jul. 2008.
! r #
X 2 [10] M. Di Renzo, H. Haas, A. Ghrayeb, S. Sugiura, and L. Hanzo, “Spatial
g (s) = φ(s) 1 + A2i He2i s , (24)
i=2
Ex modulation for generalized MIMO: Challenges, opportunities and imple-
mentation,” Proc. IEEE, vol. 102, no. 1, pp. 56-103, Jan. 2014.
[11] A. Younis, N. Serafimovski, R. Mesleh, and H. Haas, “Generalised
1 s2 spatial modulation,” Proc. Asilomar Conf. on Signals, Syst. and Comput.,
φ(s) = √ e − Ex , (25) pp. 1498–1502, Nov. 2010.
πEx [12] J. Jeganathan, A. Ghrayeb, and L. Szczecinski, Spatial modulation:
i k Optimal detection and performance analysis,” IEEE Commun. Lett., vol.
X (−1)
A2i = mX
2i−2k .
I
(26) 12, no. 8, pp. 545-547, Aug. 2008.
k! (2i − 2k)!2k [13] M. Di Renzo and H. Haas, “Bit error probability of SM-MIMO over
k=0
generalized fading channels,” IEEE Trans. Veh. Technol., vol. 61, no. 3,
The ith raw moment of XI , mX I
i :
pp. 1124-1144, Mar. 2012.
[14] E. Basar, U. Aygolu, E. Panayirci, and H. Poor, “Performance of spatial
i/2 modulation in the presence of channel estimation errors,” IEEE Commun.

 (i−1)!!Exi/2 (E {h2I }) if i is even,
XI Lett., vol. 16, no. 2, pp. 176-179, Feb. 2012.
mi = 2 { I}
i/2 E hi
(27) [15] K. Ishibashi, and S. Sugiura, “Effects of antenna switching on band-
0 if i is odd. limited spatial modulation,” IEEE Wireless Commun. Lett., vol. 3, no. 4,

pp. 345-348, Aug. 2014.
XQ
Note that mX
i
I
= mi for all i. [16] S. Sugiura and L. Hanzo, “Effects of channel estimation on spatial
modulation,” IEEE Signal Process. Lett., vol. 19, no. 12, pp. 805-808,
Proof: See [22]. Dec. 2012.
[17] A. Stavridis, S. Sinanovic, M. Di Renzo, and H. Haas, “Energy evalua-
tion of spatial modulation at a multi-antenna base station,” in Proc. IEEE
A PPENDIX B Veh. Technol. Conf., pp 1–5, Sep. 2013.
P ROOF OF L EMMA 1 [18] M. Kountouris, D. Gesbert, and T. Salzer, “Enhanced multiuser random
beamforming: Dealing with the not so large number of users case,” IEEE
Lemma 1. Let {xi } be a sequence of independent and Jour. Select. Areas in Commun., vol. 26(8), pp. 1536–1545, Oct. 2008.
[19] S. Sandhu and A. Paulraj, “Space-Time block codes: A capacity per-
identically distributed random variables with finite mean and spective,” IEEE Commun. Lett., vol. 4, no. 12, pp. 384–386, Dec. 2000.
variance drawn from a random process, andP{ai } be a [20] Y. Yang, B. Jiao, “Information-guided channel-hopping for high data
N
sequence of positive weights; define AN = i=1 ai and
rate wireless communication,” IEEE Commun. Lett., vol. 12, no. 4, pp.
PN k k 225–227, Apr. 2008.
Jk = 1/AN i=1 ai xi . Let E x be the kth raw moment [21] D. J. Costello, G. D. Forney, Jr. , “Channel coding: The road to channel
of the random process. If the weight sequence {ai } satisfies capacity,” Proceedings of the IEEE, vol. 95, no. 6, pp. 1150–1177 , Jun.
P  P −2 2007.
N 2 N
the conditions, limN →∞ i=1 ai i=1 ai = 0, in the [22] D. A. Basnayaka, M. Di Renzo, H. Haas, “Massive but few active
limit of N → ∞ regardless of the weights Jk → E xk . MIMO,” in preparation.


1950