SINR Analysis for Full-Rate Linear Dispersion
Code Using Linear MMSE
Mabruk Gheryani, Zhiyuan Wu, Yousef R. Shayan
Department of Electrical Engineering, Concordia University
Montreal, Quebec Canada
{m gherya, zy wu, yshayan}@ece.concordia.ca
Abstract— We have studied the statistics of signal-to-
interference-noise for a MIMO transceiver using full-rate lin-
ear dispersion code and linear minimum-mean-square-error
(MMSE) receiver over a Rayleigh fading channel. The associated
probability density function of the signal-to-interference-noise
is derived, which will benefit the future study, such as error-
rate probability. Simulation results are provided to verify the
theoretical analysis.
I. I NTRODUCTION
The use of multiple antennas at the transmitter and receiver
can lead to significant spectral efficiency on a scattering-rich
wireless channel [1][2]. This has spurred a remarkable thrust
into the so-called Multiple-Input Multiple-Output (MIMO)
technologies. One of the most promising technologies is space-
time (ST) coding, e.g., [3]-[6].
Among the existing space-time codes, the linear disper-
sion code (LDC) [4]-[6] is often preferable for full rate.
This is because it subsumes many existing block codes as
its special cases, allows suboptimal linear receivers with
greatly reduced complexity, and provides flexible rate-versus-
performance tradeoff [4][6]. The LDC breaks the data stream
into sub-streams that are dispersed over space and time and
then combined linearly at the transmitter [4]. As a subopti-
mal receiver for the LDC, linear minimum-mean-square-error
detector is more attractive due to its simplicity and good
performance [7][8].
However, the performance analysis in this case is still
deficient. Most of related works were addressed only for the
V-BLAST [9][10] scheme, a special case of the full-rate LDC.
For example, the case of two transmit antennas was analyzed
in [11] and the distribution of the angle between two complex
Gaussian vectors was presented. The layer-wise signal to
interference plus noise ratio (SINR) distribution for V-BLAST
with successive interference cancellation at the receiver was
provided in [12].
The main goal of this paper is to study the statistics of SINR
for full-rate LDCs [4]-[6] using linear minimum-mean-square-
error(MMSE) receiver over a Rayleigh fading channel. In this
paper, the associated probability density function of the SINR
is derived, which will benefit future studies, such as error-
rate probability. This paper will be organized as follows. Our
system model is presented in section II. The statistics of SINR
with the MMSE receiver is derived in section III. Simulation
Ant-1
1
Ant-1
M1
Nt
Symbols
S/P
MMSE
1
Ant-Nr
ML
Ant-Nt
Nt
Fig. 1. System Block Diagram.
results are provided in section IV to verify the theoretical
analysis. Finally, in section V, conclusions are drawn.
II. S YSTEM M ODEL
In this study, a block fading channel model is assumed
where the channel keeps constant in one modulation block
but may change from block to block. That is, the channel
is not necessarily constant within a coding frame which often
consists of a large number of modulation blocks. Furthermore,
the channel is assumed to be a Rayleigh flat fading channel
with Nt transmit and Nr receive antennas. Let’s denote the
complex gain from transmit antenna n to receiver antenna
m by hmn and collect them to form an Nr × Nt channel
matrix H = [hmn ], known perfectly to the receiver but
unknown to the transmitter. The entries in H are assumed
to be independently identically distributed (i.i.d.) symmetrical
complex Gaussian random variables with zero mean and unit
variance.
The considered MIMO system is depicted in Fig. 1. In this
system, the information bits are first mapped into symbols.
After that, the symbol stream is parsed into blocks of length
L. The symbol vector associated with one modulation block is
denoted by x = [x1 , x2 , . . . , xL ]T . We assume the symbols xi
are Gaussian with zero mean and unit variance and indepen-
dent to each other. Each block of symbols will be mapped to
a dispersion matrix of size Nt × T and then transmitted over
the Nt transmit antennas over T channel uses. An Nt × T
codeword matrix is constructed as [4].
L
X L
X
X= Mi xi + Ni x∗i (1)
i=1 i=1
where Mi , Ni are the dispersion matrices associated with
the i-th symbol. For simplicity, the following model will be
considered in this study, i.e., where RI = H e IHe H + σ 2 I. Note that the scaling factor
I z
1
L
X −1 in the coefficient vector of the MMSE
hHi ( i i I)
h h H +R hi
X= Mi xi (2) estimator wi is added to ensure an unbiased estimation as
i=1 indicated by (7). The variance of the noise term ẑi can be
where Mi is defined by its L Nt × T dispersion matrices found from (7) and (8) as
Mi = [mi1 , mi2 , . . . , miT ]. The so-obtained results can be
extended to the model in (1). Received signals associated with σ̂i2 = wiH RI wi (9)
one modulation block can be written as Substituting the coefficient vector for the MMSE estimator in
r r L
P P X (8) into (9), the variance can be written as
Y= HX + Z = H Mi xi + Z (3)
Nt Nt i=1 1
σ̂i2 = −1 (10)
where Y is a complex matrix of size N r × T whose (m, n)- hH
i R I hi
th entry is the received signal at receive antenna m and time Then, the SINR of MMSE associated with xi is 1/σ̂i2 .
instant n, Z is the additive white Gaussian noise matrix with µ ¶
i.i.d. symmetrical complex Gaussian elements of zero mean 1 P −1
γi = = hHi RI hi (11)
and variance σz2 , and P is the average energy per channel use ˆ2
σi Nt
at each receive antenna. Let vec() be the operator that forms a
column vector by stacking the columns of a matrix and define In our system model, all the symbols has the same SINR, i.e.,
y = vec(Y), z = vec(Z), and mi = vec(Mi ), then (3) can γ1 = γ2 = .........γL = γ
be rewritten as By using singular value decomposition (SVD), (11) can be
r r written as µ ¶
P P e P
y= HGx + z = Hx + z (4) γ= hH −1 H
Nt Nt i UΛ U hi (12)
Nt
where H = IT ⊗ H with ⊗ as the Kronecker product
where UH is an Nt2 − 1 × Nt2 − 1 unitary matrix and the
operator and G = [m1 , m2 , . . . , mL ] will be referred to as the
matrix Λ is (Nt2 − 1) × (Nt2 − 1) with nonnegative numbers
modulation matrix. Since the average energy of the signal per
on the diagonal and zeros off the diagonal. Let’s define
channel use at a receive antenna is assume to be P , we have
tr(GGH ) = Nt T . For full-rate LDC, we have GH G = I [4] h̃ = UH hi
[5] [6]. Denoting hi = Hmi as the i-th column vector of H, e
the above equation can also be written as which is the transformed propagation vector with components
r h̃l , l = 1, ...........Nr Nt .
L
P X Equation (12) can be written as
y= hi xi + z (5)
Nt i=1 µ ¶ NX
r Nt
P |h̃l |2
III. SINR A NALYSIS WITH THE L INEAR MMSE γ= (13)
Nt λl
l=1
In our study, Nr ≥ Nt is assumed. For simplicity, we choose
T equal to Nt and L equal to Nt T . with
(
Equation (4) can also be written as λ̃l = 1
r r λl = σz2 (γ̄λl + 1) l = 1, ......., r ≤ L − 1
(14)
P P X σz2 l = r + 1, ........., Nr Nt
y= hi xi + hj xj + z (6)
Nt Nt
j6=i e IHe H which is less
where γ̄ = NPt σ2 and r is the rank of H I
In the sequel,the i-th column of H e , denoted as hi , will be 2
than Nt − 1.
z

referred to as the signature signal of symbol xi . The vector h̃ has the same statistics as the original vector
Without loss of generality, we consider the estimation of hi [1]. For analytical purpose, we can replace |h̃l |2 by |hil |2 .
one symbol, say xi . Collect the rest symbols into a column Now, we can write (13) as
vector xI and denote H e I = [h1 , .., hi−1 , hi+1 , ..., hL ] as the
r
X N
X t Nr
matrix obtained by removing the i-th column from H. e |hil |2
γ= γ̄ + γ̄khil |2 (15)
A linear MMSE detector is applied and the corresponding (γ̄λl + 1)
i=1 r+1
output is given by
The probability density function (PDF) of γ can be found
x̂i = wiH y = xi + ẑi . (7)
using the moment generating function (MGF) as follows [13].
where ẑi is the noise term of zero mean. The corresponding First, we find the conditional (on the eigenvalues) MGF of γ
wi can be found as as
¡ ¢−1 r µ ¶
hi hHi + RI hi N N −r
Y γs
¯
wi = ¡ ¢−1 (8) Mγ/λ (s) = [Mγ (γ̄s)] r t Mγ (16)
hH hi hH (γ̄λl + 1)
i i + RI hi l=1
the fλi (λi ) denotes the PDF of the ith nonzero eigenvalue of Let’s define
e IH
the H e H . If we let fλ (λ) denote the PDF of any unordered 0
I k! Γ(k + n )
λi for i = 1, ....., r,, then (16) can be written as K1(k) =
· µ ¶¸r (k + Nr Nt − r)! 22k k!
N N −r γs
¯ (2i)!(2k − 2i)!
Mγ/λ (s) = [Mγ (γ̄s)] r t Mγ (17) K2(i) =
(γ̄λ + 1) i![(k − i)!]2 Γ(k + n0 )
µ ¶
Further, (−2)d 2k + 2Nr Nt − 2r
K3(d) =
1 1 d! 2k − d
Mγ/λ (s) = Nr Nt −r
׳ ´r (18) 0
(1 − γ̄s) 1− γs
¯ where n = Nr Nt − r + 1. Then we can write (21) as
(1+γ̄λ)
r−1 k 2k Z ∞
we can find the probability density function (PDF) of γ Kγ X X X
PΓ (γ) = K1(k) K2(i) K3(d)
conditionally on λ by using inverse laplace transform for (18) r 0
i=0 k=0 d=0
as [15]
r
(1 + γ̄λ) λNr Nt −r+d
(γ̄)−Nr Nt γ
Pγ/λ (γ) = (γ)Nr Nt −1 exp(− ) ×
Γ(Nr Nt ) γ̄ 1 F1 (Nr Nt − r, Nr Nt , λγ) exp(−γλ)dλ (24)
r
(1 + γ̄λ)1 F1 (Nr Nt − r, Nr Nt , λγ) exp(−λγ) (19) r
The term (1 + γ̄λ) can be written as
where 1 F1 (., ., .) is Kummer’s confluent hypergeometric func- r µ ¶
X r
tion [14] and defined as r
(1 + γ̄λ) = γ̄ r γ̄ v−r λv
∞
v
X (a)n xn v=0
1 F1 (a, b, x) = Then equation (24) will be as
n
(c)n n!
Kγ γ̄ r
where (∗)n = Γ(∗+n)
Γ(∗) .
PΓ (γ) =
r
×
Let’s define
∞
X r
X k
X 2k
X
(γ̄)−Nr Nt γ γ n K(n) K(v)K1(k) K2(i) K3(d)×
Kγ = (γ)Nr Nt −1 exp(− )
Γ(Nr Nt ) γ̄ n v=0 i=0 d=0

Then equation (19) can be written as r−1 Z

X ∞
∞
X λNr Nt −r+d+v+n exp(−γλ) dλ (25)
(Nr Nt − r)n 0
Pγ/λ (γ) = Kγ × k=0
(r)n
n with
n (Nr Nt − r)n
γ n r K(n) =
λ (1 + γ̄λ) exp(−λγ) (20) (r)n n!
n!
Now, we can find the probability density function (PDF) of γ and µ ¶
r
as follows. K(v) = γ̄ v−r
v
Z ∞
PΓ (γ) = Pγ/λ (γ)fλ (λ) dλ (21) The general form of the integration of (25) can be found in
0 [14] Z ∞
fλ (λ) was given in [1] and can be written as xΘ exp(−µx)dx = Θ!µ−Θ−1
r 0
1X
fλ (λ) = Φi (λ)2 λNr Nt −r exp(−λ) (22) where
r i=1
Θ = Nr Nt − r + d + v + n
where Then (25) can be written as
µ ¶ 12
k! ∞
Kγ γ̄ r X
Φk+1 (λ) = LN
k
r Nt −r
(λ) PΓ (γ) =
(k + Nr Nt − r)! r n
k = 0, ...r − 1
r
X r−1
X k
X
where LN k
r Nt −r
(λ) is the associated Laguere Polynomial of γ n K(n) K(v) K1(k) K2(i)×
order k [14]. Equation (22) can be written as v=0 k=0 i=0

r−1 2k
1X k! X
fλ (λ) = [LNr Nt −r (λ)]2 (23) K3(d)γ −Nr Nt +r−d−v−n−1 (Nr Nt −r+d+v+n)! (26)
r (k + Nr Nt − r)! k
k=0 d=0
 −2 −2
104
x 10 104
x 10
15 7
Monte Carlo Simulation
Monte Carlo Simulation
Theoretical PDF
Theoretical PDF

5
10

0
0 10 20 30 40 50 60 70 80 90
0
0 10 20 30 40 50 60

Fig. 2. Comparison between the theoretical PDF of SINR and Monte Carlo
Simulation when Nt=Nr=2 at P/σz2 =20dB Fig. 3. Comparison between the theoretical PDF of SINR and Monte Carlo
Simulation when Nt=Nr=4 at P/σz2 =20dB

Further,
IV. S IMULATION R ESULTS
r r r−1
X k
X 2k
X
Kγ γ̄ γ In this section, we verify our derivation by simulation. In
PΓ (γ) = K1(k) K2(i) K3(d)×
rγ Nr Nt +1 i=0
the simulation, Nt = Nr = T = 2 and Nt = Nr = T = 4
k=0 d=0
were assumed. In Fig. 2 and Fig. 3, the theoretical results
r ∞ of the SINR in (28) and Monte Carlo simulation results were
X X
γ −d K(v)γ −v K(n)(Nr Nt − r + d + v + n)! (27) compared for 2×2 and 4×4 channels, respectively at P/σz2 =
v=0 n 20dB. Simulation results match to the analytical result very
well.
Let’s define
V. C ONCLUSIONS
K(v, d) = (Nr Nt − r + d + v)!× In this paper, over a Rayleigh fading channel, the probability
density function of signal-to-interference-plus-noise ratio of
Γ(Nr Nt − r + d + v + 1)Γ(d + v − r + 1) ` a MIMO transceiver using full-rate linear dispersion code
K(v) and linear minimum-mean-square-error receiver is derived.
Γ(d + v + 1)Γ(Nr Nt + d + v + 1)
Monte Carlo results are presented to verify our derivation.
and The analytical results will shed light on the future study of
µ ¶
` = r linear dispersion codes.
K(v)
v
R EFERENCES
Then (27) can be written as
[1] I. E. Telatar, “Capacity of multi-antenna Gaussian channels,” Eur. Trans.
Telecom., vol. 10, pp.585-595, Nov. 1999.
r−1
r−Nr Nt −1 X k
X
Kγ γ [2] G. J. Foschini, M. J. Gans, “On limits of wireless communications in
PΓ (γ) = K1(k) K2(i)× a fading environment when using multiple antennas,” Wireless Personal
r i=0 Communications, vol. 6, no. 3, pp.311-335, 1998.
k=0
[3] V. Tarokh, N. Seshadri, and A. Calderbank, “Space-time codes for
high data rate wireless communications: Performance criterion and code
2k
X r
X construction,” IEEE Trans. Inform. Theory, vol. 44, pp. 744-765, Mar.
K3(d)γ −d K(v, d) (28) 1998.
d=0 v=0 [4] B. Hassibi and B. Hochwald, “High-rate codes that are linear in space and
time,” IEEE Trans. Inform. Theory, vol. 48, pp. 1804-1824, July 2002.
[5] X. Ma and G. B. Giannakis,“Full-Diversity Full-Rate Complex-Field
This is the PDF of SINR for our system over Rayleigh Space-Time Coding,” IEEE Trans. Signal Processing, vol. 51, no. 11,
fading channels. pp. 2917-2930, July 2003.
[6] Z. Wu and X. F. Wang, “Design of coded space-time modulation,” IEEE
International Conference on Wireless Networks, Communications and
Mobile Computing, vol. 2, pp. 1059-1064, Jun. 13-16, 2005.
[7] R. Lupas and S. Verdu, “Linear multiuser detectors for synchronous code-
division multiple-access channels,” IEEE Trans. inform. Theory, vol. 35,
pp. 123-136, Jan. 1989.
[8] H. V. Poor and S. Verdu, “Probability of error in MMSE multiuser
detection,” IEEE Trans. inform. Theory, vol. 43, pp. 858-871, May 1997.
[9] G. J. Foschini, “Layered space-time architecture for wireless communi-
cation in fading environments when using multiple antennas,” Bell labs.
Tech. J.,vol. 1, no. 2, pp. 41-59, 1996.
[10] G. D. Golden, G. J. Foschini, R. A. Valenzuela, and P. W. Wolniansky,
“Detection algorithm and initial laboratory results using V-BLAST space-
time communication architecture,” Electron. Lett., vol. 35, pp. 14-16, Jan.
1999.
[11] S. Loyka , “V-BLAST outage probability: analytical analysis,” 2002
Proc. IEEE Vehicular Technology Conference (VTC), vol.4 pp.1997-2001,
Sept. 2002.
[12] R. Bhnke, Karl-Dirk Kammeyer, “SINR Analysis for V-BLAST with
Ordered MMSE-SIC Detection,” International Wireless Communications
and Mobile Computing Conference, pp. 623 - 628, July 2006.
[13] Robb J. Muirhead, Aspects Of Multivariate Statistical Theory, New
York: John Wiley and Sons Inc., 1982.
[14] I. S. Gradshteyn ,I. M. Ryzhik,A. Jeffrey,and D. Zwillinger, Table of
Integrals, Series, and Products,6th ed. San Diego, Calif.: Academic
Press 2000.
[15] G. E. Roberts and H. Kaufman, Table Of Laplace Transforms,Volume
2. Philadelphia: W. B. Saunders Company. 1966.