1826 IEEE COMMUNICATIONS LETTERS, VOL. 19, NO. 10, OCTOBER 2015
Asymptotic Orthogonality Analysis of Time-Domain
Sparse Massive MIMO Channels
Zhen Gao, Linglong Dai, Chau Yuen, and Zhaocheng Wang
Abstract—The theoretical analysis of downlink massive MIMO
usually assumes the ideal Gaussian channel matrix with asymp-
totic orthogonality of channel vectors. Meanwhile, recent experi-
ments have shown that massive MIMO channels between a certain
user and massive base station antennas appear the spatial common
sparsity (SCS) in both the time domain and angle domain. This
motivates us to investigate whether realistic sparse massive MIMO
channels could provide the favorable propagation condition, and
reveal the capacity gap between massive MIMO systems over re-
alistic sparse channels and that under the ideal Gaussian channel
matrix assumption. This letter theoretically proves that channel
vectors associated with different users in massive MIMO over
sparse channels satisfy the asymptotic orthogonality. Moreover,
the simulation results confirm the theoretical analysis.
Index Terms—Massive MIMO, favorable propagation condi-
tion, spatial common sparsity (SCS), asymptotic orthogonality.
I. INTRODUCTION
T
HE theoretical performance of massive MIMO relies on
the favorable propagation condition, which is equivalent
to the asymptotic orthogonality of channel vectors associated
with different users [1]. For theoretical analysis, the channel
is usually modeled as the ideal Gaussian channel matrix, so
that channel vectors associated with different users are asymp-
totically orthogonal and can provide the favorable propagation
condition fo r massive MIMO [1], [2].
Recent researches have shown that, due to the finite number
of significant scatterers and the compact antenna array at the
base station (BS), realistic massive MIMO chan nels between a
certain user and massive base station (BS) antennas exhibit the
intrinsically spatial common sparsity (SCS) [3]–[8]. However,
in [4]–[6], the proposed channel estimation schemes only con-
sider the massive MIMO channels with SCS in the time domain,
while [7] and [8] only consider the SCS of massive MIMO
channels in the angle domain. For massive MIMO channels,
both the path delay in the time domain and angle of departure
(AoD)/angle of arrival (AoA) in the angle domain are essential
parameters to represent the channels. Therefore, in this letter,
we will jointly consider the SCS of massive MIMO channels
in both the time domain and angle domain. Clearly, the actual
Manuscript received January 31, 2015; revised June 24, 2015; accepted
July 16, 2015. Date of publication July 24, 2015; date of current version
October 8, 2015. This work was supported in part by the National Key Basic
Research Program of China (Grant No. 2013CB329203), Singapore A
∗
STAR
SERC Project (Grant No. 142 02 00043), National Natural Science Foundation
of China (Grant Nos. 61201185 and 61271266), and Beijing Natural Science
Foundation (Grant No. 4142027). The associate editor coordinating the revie w
of this paper and approving it for publication was M. Matthaiou.
Z. Gao, L. Dai, and Z. Wang are with the Tsinghua National Laboratory
for Information Science and Technology (TNList), Department of Electronic
Engineering, Tsinghua University, Beijing 100084, China (e-mail: gao-z11@
mails.tsinghua.edu.cn; daill@tsinghua.edu.cn; zcwang@tsinghua.edu.cn).
C. Yuen is with Singapore University of Technology and Design, Singapore
138682 (e-mail: yuenchau@sutd.edu.sg).
Digital Object Identifier 10.1109/LCOMM.2015.2460243
massive MIMO channel experienced by practical systems is
different from the ideal Gaussian channel m atrix for theoretical
analysis. Such difference motivates us to investigate the propa-
gation cond ition of realistic massive MIMO chan nels with SCS,
and reveal the capacity gap between massive MIMO systems
over actual sparse channels and that under the ideal Gaussian
channel matrix assumption. Specifically, we first introduce the
SCS of massive MIMO channels in both the time domain and
angle domain. Then, we p rove that channel vectors over sparse
channels are asymptotically orthogonal, where our analysis is
based on the widely used isotropic uniform linear array (ULA)
without loss of generality [3], [7], [8]. The asymptotic orthogo-
nality of different c hannel vectors indicates that massive MIMO
channels with SCS could provide the favorable propagation
condition, which is also confirmed by simulations.
II. S
YSTEM MODEL
In typical massive MIMO systems, the BS employs M anten-
nas to simultaneously serve K single-antenna users. Usually, M
is large, and much larger than K,e.g.,M = 128 and K = 16 [1].
In the downlink, the BS transmits data x ∈ C
M×1
to K single-
antenna users, and the received signal y ∈ C
K×1
for K users can
be expressed as
y =
√
ρ
d
Gx+n =
√
ρ
d
D
1/2
Hx +n, (1)
where ρ
d
is the transmit power, G ∈ C
K×M
is the downlink
channel matrix, n ∈ C
K×1
is the additive white Gaussian noise
(AWGN) vector, the diagonal matrix D
1/2
∈ C
K×K
with the kth
diagonal element
√
β
k
represents the large-scale channel fading
due to shadow fading and path loss, while H ∈ C
K×M
denotes
the small-scale channel fading matrix due to channel variation.
Note that when the widely used OFDM is considered, (1) is
valid for every frequency-domain subcarrier.
To fully exploit advantages of massive MIMO, the BS re-
quires the downlink channel information for precoding, user
scheduling, etc. The propagation con dition of downlink channel
matrix determines the achievable capacity of downlink massive
MIMO, which can be expressed as [1]
C =log
2
det(I
K
+ρ
d
GG
∗
), (2)
where I
K
∈ C
K×K
is the unit matrix, and (·)
∗
is the Hermitian
transpose operation. It can be observed from (2) that the
achievable capacity heavily depends on the property of channel
matrix G.
For the ideal Gaussian channel matrix, G provides the favor-
able propagation condition, where elements of the small-scale
channel fading matrix H follow the independent and identically
distributed (i.i.d.) circularly symmetric complex Gaussian dis-
tribution CN (0, 1). It has been shown that row vectors of G are
asymptotically orthogonal [1], i.e.,
lim
M→∞
GG
∗
/M = lim
M→∞
D
1/2
HH
∗
D
1/2
/M =D. (3)
1558-2558 © 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.