Documente Academic
Documente Profesional
Documente Cultură
i=1
H
i
x
i
+n = H
e
x +n (1)
where H
i
C
NM
is the channel matrix for User i, with en-
tries that are independent and identically distributed complex
Gaussian. The vector transmitted by User i is x
i
C
M1
.
The transmissions of all users are aggregated into the vec-
tor x = [x
T
1
x
T
2
. . . x
T
K
]
T
, and the corresponding equivalent
channel matrix is H
e
= [H
1
H
2
. . . H
K
]. n C
N1
is the
Gaussian noise vector. The vectors x and n are assumed
independent from each other and from the channel gains. It is
assumed that perfect channel state information is available at
the receiver (CSIR) but not at the transmitter.
We aim to characterize the diversity gain, d(R, M, N),
as a function of the spectral efciency R (bits/sec/Hz) and
the number of transmit and receive antennas. This requires
a pairwise error probability (PEP) analysis which is not
directly tractable. Thankfully outage and PEP exhibit identical
exponential orders in our case, a fact whose proof follows
similarly to [3] and is omitted in this letter for brevity.
Following the notation of [7], we dene the outage-type
quantities
P
out
(R, N, M) P(I(x; y) < R) (2)
d
out
(R, N, M) lim
log P
out
(R, M, N)
log
(3)
where is the per-stream signal-to-noise ratio (SNR).
We say that the two functions f() and g() are exponen-
tially equal, denoted by f(p)
.
= g(p) when
lim
log f()
log()
= lim
log g()
log()
The ordering operators
and
are also dened in a similar
manner. If f()
.
=
d
, we say that d is the exponential order
of f(p). The basis of the logarithm is 2 throughout this letter.
III. DMT OF THE MMSE MIMO MAC
Kumar et al. [2] obtained the DMT of MMSE single-user
MIMO receivers:
d(r) = (N M + 1)(1
r
M
)
+
. (4)
2162-2337/13$31.00 c 2013 IEEE
w
w
w
.
t
a
k
e
o
f
f
p
r
o
j
e
c
t
s
.
c
o
m
For Further Details-A Vinay 9030333433,0877-2261612 0
276 IEEE WIRELESS COMMUNICATIONS LETTERS, VOL. 2, NO. 3, JUNE 2013
MMSE
User 1
MUX
Base station
H
e
1
User
1
k=1
log(1 +
1
k
) < R
_
. (7)
where
1
k
is the unbiased decision-point SINR for the data
stream k of the rst user:
1
k
=
1
(I + H
e
H
H
e
)
1
kk
1, k = 1, M. (8)
where ()
kk
denotes the diagonal element number k. Thus the
outage probability is:
P
1
out
= P
_
M
k=1
log(I + H
e
H
H
e
)
1
kk
> R
_
. (9)
Using Jensens inequality the outage probability can be
bounded as
P
1
out
P
_
log
_
M
k=1
1
M
(I + H
e
H
H
e
)
1
kk
_
>
R
M
_
P
_
log
_
KM
k=1
1
M
(I + H
e
H
H
e
)
1
kk
_
>
R
M
_
(10)
= P
_
KM
k=1
1
1 +
k
> M2
R
M
_
(11)
where (10) holds by adding positive terms
2
to the argument
of the logarithm, which itself is a monotonically increasing
function. Substituting
k
=
k
, we have the following
exponential equality
1
1 +
k
.
=
_
k1
k
< 1
1
k
> 1.
(12)
Thus at high SNR, each of the additive terms in (11) is either
zero or one, therefore to characterize
k
1
1+k
at high SNR
we basically count the ones. The asymptotic slope of (11) in
the special case of K = 1 was calculated in [3] using the
distribution of {
k
}. This result generalizes to K > 1 in a
straight forward manner, as follows.
P
1
out
P
_
KM
k=1
1
1 +
k
> M2
R
M
_
2
Recall that (I + He
H
He) is a positive denite matrix [8].
w
w
w
.
t
a
k
e
o
f
f
p
r
o
j
e
c
t
s
.
c
o
m
For Further Details-A Vinay 9030333433,0877-2261612 1
MEHANA and NOSRATINIA: DIVERSITY OF MMSE RECEIVERS IN MIMO MULTIPLE ACCESS CHANNELS 277
.
=
d(R)
(13)
where
d(R) =
_
M2
R/M
_
2
+|N KM|
_
M2
R/M
_
. (14)
B. MIMO MAC MMSE Outage Lower Bound
The lower bound is based on Jensens inequality
P
1
out
= P
_
M
k=1
log
1
(I + H
e
H
H
e
)
1
kk
< R
_
P
_
M log
M
k=1
1
M
1
(I + H
e
H
H
e
)
1
kk
< R
_
(15)
= P
_
M
k=1
1
M
1
(I + H
e
H
H
e
)
1
kk
< 2
R
M
_
(16)
Let the eigen decomposition of H
e
H
H
e
be given by
H
e
H
H
e
= U
H
U where U is unitary and is a diagonal
matrix that has the eigenvalues of the matrix H
e
H
H
e
on its
diagonal. Let the eigenvalues of H
e
H
H
e
be given by {
}
with
1
2
kM
. Let the vector u
k
be the column k
of the matrix U, we have
(I + H
e
H
H
e
)
1
kk
= u
H
k
(I + )
1
u
k
=
KM
=1
|u
k
|
2
1 +
S
k
.
Let
k = arg min
k
S
k
. we can bound the sum in (15)
1
M
M
k=1
1
(I + H
e
H
H
e
)
1
kk
=
1
M
M
k=1
1
S
k
1
min
k
S
k
=
1
S
k
(17)
thus the outage bound in (15) can be further bounded
P
out
P
_
S
k
> 2
R
M
_
(18)
We now bound (18) by conditioning on the event
B
_
|u
k
|
2
a
M
, = KM M + 1, , KM
_
(19)
where a is a positive real number that is slightly smaller
than one a = 1
1
, and
1
is a small positive number. We
then have
P
out
P
_
S
k
> 2
R
M
_
P
_
S
k
> 2
R
M
B
_
P(B)
= P
_
KM
=1
|u
k
|
2
1 +
> 2
R
M
B
_
P(B)
P
_
KM
=KMM+1
|u
k
|
2
1 +
> 2
R
M
B
_
P(B) (20)
P
_
1
M
KM
=KMM+1
a
1 +
> 2
R
M
_
P(B)
.
= P
_
1
M
KM
=KMM+1
a
1 +
> 2
R
M
_
(21)
= P
_
KM
=KMM+1
1
1 +
>
M
a
2
R
M
_
(22)
where (20) follows by removing some of the elements of the
sum corresponding to the largest eigenvalues. Eq. (21) follows
because P(B) is nite and independent of . The proof is
similar to [2, Appendix A]
Note that H
e
H
H
e
is not a Wishart matrix, hence the
analysis of Section IV.A does not directly apply here. The
block diagonal elements of H
e
H
H
e
are similar and are given
by
D =
i=0
H
H
i
H
i
. (23)
The matrix H
e
H
H
e
is Toeplitz and Hermitian. Moreover,
the matrix D given by (23) is a Wishart matrix
3
.
Observe that the probability in (22) depends on the M
smallest eigenvalues. We now bound these eigenvalues with
the eigenvalues of the matrix D via the Sturmian separation
theorem [9, P.1077].
Theorem 2: (Sturmian Separation Theorem) Let {A
r
, r =
1, 2, . . .} be a sequence of symmetric r r matrices such that
each A
r
is a submatrix of A
r+1
. Then if {
k
(A
r
) , k =
1, . . . , r} denote the ordered eigenvalues of each matrix A
r
in descending order, we have
k+1
(A
i+1
)
k
(A
i
)
k
(A
i+1
).
For our purposes, we consider a special case of the
Sturmian Theorem by constructing a set of matrices
A
M
, A
M+1
, . . . , A
LdM
starting by the largest one A
LdM
=
H
e
H
H
e
and making all other matrices A
i
to be (successively
embedded) i i principal submatrices of H
e
H
H
e
, such that
the smallest matrix is A
M
= D
Ld
. Then we repeatedly apply
the rst inequality in the Sturmian to get:
ML
d
(AML
d
) ML
d
1(AML
d
1) M(AM)
ML
d
1(AML
d
) ML
d
2(AML
d
1) M1(AM)
.
.
.
.
.
.
ML
d
M+1(AML
d
) ML
d
M(AML
d
1) 1(AM)
This implies that the smallest M eigenvalues of H
e
H
H
e
are bounded above by the M eigenvalues of D, respectively.
Hence:
P
out
P
_
M
k=1
1
1 +
k
(D)
>
M
a
2
R
M
_
. (24)
3
Let W(n,
) and B2 W(n2,
).
w
w
w
.
t
a
k
e
o
f
f
p
r
o
j
e
c
t
s
.
c
o
m
For Further Details-A Vinay 9030333433,0877-2261612 2
278 IEEE WIRELESS COMMUNICATIONS LETTERS, VOL. 2, NO. 3, JUNE 2013
D is a sum of ( + 1) central Wishart matrices each with N
degrees of freedom and with identity covariance matrix, i.e.
D W(KN, I). Therefore analysis similar to the analysis
of [4, Section III-B] applies here and we get
P
_
M
k=1
1
1 +
k
(D)
>
M
a
2
R
M
_
.
=
d(R)
. (25)
Remark 1: Using the linear MMSE receiver, the diversity
of each user depends on the rate transmitted by that user, but
is independent of the rate of other users. This is due to the
fact that the residual interference is considered as noise.
Remark 2: For simplicity the results of this letter were
developed under the assumption that all users experience the
same transmit-side equivalent SNR of , however, it is straight
forward to show that the result applies to unequal SNR as long
as
i
j
= O(1).
Remark 3: The results of this letter can easily be general-
ized to remove the restriction N KM. The main difference
is that some eigenvalues of H
e
H
H
e
are zero when N < KM.
The generalized result is:
d(R) =
__
M2
R/M
(KM N)
+
_
+
_
2
+ |N KM|
__
M2
R/M
(KM N)
+
_
+
_
(26)
V. CONCLUSION
In this letter the diversity of the MMSE MIMO receiver in
multiple access channel is calculated. The diversity in the xed
rate-regime (where the spectral efciency R is not a function
of SNR) is fully characterized.
REFERENCES
[1] A. Hedayat and A. Nosratinia, Outage and diversity of linear receivers
in at-fading MIMO channels, IEEE Trans. Signal Process., vol. 55,
no. 12, pp. 58685873, Dec. 2007.
[2] K. R. Kumar, G. Caire, and A. L. Moustakas, Asymptotic performance
of linear receivers in MIMO fading channels, IEEE Trans. Inf. Theory,
vol. 55, no. 10, pp. 43984418, Oct. 2009.
[3] A. Hesham Mehana and A. Nosratinia, Diversity of MMSE MIMO
receivers, in Proc. 2010 IEEE ISIT.
[4] A. H. Mehana and A. Nosratinia, Diversity of MMSE MIMO receivers,
IEEE Trans. Inf. Theory, vol. 58, no. 11, pp. 67886805, Nov. 2012
[5] H. Gao, P. J. Smith, and M. V. Clark, Theoretical reliability of MMSE
linear diversity combining in Rayleigh-fading additive interference chan-
nels, IEEE Trans. Commun., vol. 46, no. 5, pp. 666672, May 1998.
[6] E. N. Onggosanusi, A. G. Dabak, T. Schmidl, and T. Muharemovic,
Capacity analysis of frequency-selective MIMO channels with sub-
optimal detectors, in Proc. 2002 IEEE ICASSP, vol. 3, pp. 23692372.
[7] A. Tajer and A. Nosratinia, Diversity order in ISI channels with single-
carrier frequency-domain equalizer, IEEE Trans. Wireless Commun.,
vol. 9, no. 3, pp. 10221032, Mar. 2010.
[8] I. E. Telatar, Capacity of multi-antenna Gaussian channels, European
Trans. Telecommun., vol. 10, pp. 585595, Nov./Dec. 1999.
[9] D. S. Bernstein, Matrix Mathematics: Theory, Facts and Formulas.
Princeton University Press, 2009.
w
w
w
.
t
a
k
e
o
f
f
p
r
o
j
e
c
t
s
.
c
o
m
For Further Details-A Vinay 9030333433,0877-2261612 3