MIMO2017
MIMO2017
fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LWC.2017.2753800, IEEE
Wireless Communications Letters
1
2162-2337 (c) 2017 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.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LWC.2017.2753800, IEEE
Wireless Communications Letters
2
where H ∈ C Nr ×Nt (C is set of complex numbers) is In this case, B2 is a 7×8 matrix. By performing the whitening
the MIMO channel in between transmitter and receiver. The of noise terms present in (7), we have
entries of H, i.e., channel coefficients are assumed to be
−1/2 y1 + y2 −1/2
Gaussian distributed with zero mean and unit variance. Further r1 = K1 B2 = K1 B2 h1 x1 + w1 , (8)
it is also assumed that all channel coefficients are independent 2
and identically distributed (i.i.d.); N is additive white Gaussian where w1 is AWGN vector with zeromean
and unit variance,
n1 +n2 n 1 +n2
H
noise (AWGN) matrix containing elements with σ 2 variance
K1 = E B2 2 B2 2 , and E(·) denotes
and zero mean. After some algebra, (1) can be rewritten as expectation operator. It can be shown through simulations that
the value of B2 BH
2 = I, where I denotes an identity matrix (in
y1 y2 y3 y4 = h1 h2 h3 h4 h5 h6 h7 h8
the considered example, B2 BH 2 is the identity matrix of size
x1 x1 −x1 x1 2
7 × 7); hence, K1 = σ2 I. From (8), the detector of x1 can
x2 x2 −x2 x2
be obtained by maximizing the conditional probability density
x3 −x3 −x3 x3
function of r1 conditioned on B2 and h1 , as
x4 −x4 −x4 x4
× x5 −x5 x5
+ n1 n2 n3 n4 , (3) 2
x5
x̂1 = arg min r1 − K1
−1/2
B2 h1 x̃1 . (9)
x6 −x6 x6 x6 x̃1
x7 −x7 x7 −x7 Similarly, by following the aforementioned steps, the detector
x8 −x8 x8 −x8 of xi , i ∈ {2, · · · , 8} will be
where
2
arg minx̃ ri/2 − K−1/2 Bi−1 hi x̃i , i = 2Z,
yk ∈ C 8×1 , k ∈ {1, · · · , 4}, hi = [hi1 hi2 · · · hi8 ]T ∈ i i
x̂i= 2 (10)
C 8×1 ((·)T shows the transpose), and nk ∈ C
8×1
are
complex arg minx̃i r(i+1)/2 − K−1/2
Bi+1 hi x̃i ,i = 2Z + 1,
i
valued vectors. Further, Y = y1 y2 y3 y4 ∈ C 8×4 ,
H = h1 h2 h3 h4 h5 h6 h7 h8 ∈ C 8×8 , and where r2 = (−y2 − y3 ) /2, r3 = (y3 + y4 ) /2, r4 =
N = n1 n2 n3 n4 ∈ C 8×4 . From (3), we have 2
(y1 − y4 ) /2, Ki = σ2 I, Bi is the left null of hi , and Z stands
8
X for integer.
y1 = hi xi + n1 , (4a)
B. STTS for Nt Transmit Antennas
i=1
In the proposed STTS, for transmitting N = Nt symbols
2 8
X X from Nt transmit antenna; N/2 time slots are needed. The
y2 = hi xi − hi x i + n2 , (4b)
STTS for Nt transmit antennas can be written as
i=1 i=3
→ Time slots
4 8
X X x1 x1 −x1 x1 · · · · ±x1
y3 = − hi x i + hi xi + n3 , (4c) x2 x2 −x2 x2 · · · · ±x2
i=1 i=5
x3 −x3 −x3 x3 · · · · ±x3
6
X 8
X x4 −x4 −x4 x4 · · · · ±x4
y4 = hi xi − hi x i + n4 . (4d) x5 −x5 x5 x5 · · · · ±x5
N
i=1 i=7 t x6 −x6 x6 x6 · · · · ±x6
X= ,
From (4a) and (4b), we get x7 −x7 x7 −x7 −x7 · · · ±x7
y x8 −x8 x8 −x8 −x8 · · · ±x8
y1 + y2 n1 + n2
· · · · · · · · ·
= h1 x1 + h2 x2 + . (5)
2 2
· · · · · · · · ·
In order to detect x1 from (5), the contribution of x2 should · · · · · · · · ∓xN −1
be nullified. It can be achieved by pre-multiplying (5) with the xN −xN · · · · · · ∓xN
left null of h2 . Similarly, x2 can be detected by nullifying the (11)
contribution of x1 . It can be observed through simulations that where X ∈ C N ×N/2 , the rows denote transmit antenna, and
the left null of a column vector with more than two elements columns denote time interval. The procedure of transmission
is a matrix. The matrix to be pre-multiplied with (5), i.e., in the proposed STTS is as follows:
B2 = (null(hH 2 ))
H
((·)H shows the hermitian), is chosen such • In first time slot, one symbol from each antenna with its
that h2 falls in the null space of B2 , i.e., B2 h2 = 0; we get original sign is transmitted.
• In second time slot, the sign of first and second symbols
y1 + y2 n1 + n2
B2 = B2 h1 x1 + B2 h2 x2 + B2 . (6) from first and second antennas are detained (same as in
2 2 previous time slot) and rest of the symbols are transmitted
Because of the property of left null, B2 h2 = 0 in (6). with opposite signs.
Therefore, (6) results into • In next time slot, the sign of third and forth symbol is
detained and all other symbol’s sign are flipped and so
y1 + y2 n1 + n2 on.
B2 = B2 h1 x1 + B2 . (7)
2 2 • In N/2 time slot, if N is a multiple of four then ‘+’ sign
is taken, otherwise, ‘-’ sign is taken.
2162-2337 (c) 2017 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.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LWC.2017.2753800, IEEE
Wireless Communications Letters
3
2162-2337 (c) 2017 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.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LWC.2017.2753800, IEEE
Wireless Communications Letters
4
0 0
10 10
dv=9
−2 N =N =4,Sim.,STBC [6],256−PSK −20
10 t r 10
N =N =4,Sim.,Ext.Sch.[3],BPSK
t r
Nt=Nr=4, Simulation, 8−PSK
−4 Nt=Nr=4, Analysis, 8−PSK −40 dv=29
10 10 d =19
v
Nt=Nr=4, Simulation, QPSK
BER
SER
2162-2337 (c) 2017 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.