Professional Documents
Culture Documents
Abstract: - The combination of MIMO and OFDM becomes a key standardization work for the downlink
channel in 3G Long-Term Evolution (3G-LTE). This paper studies one of the core techniques of 3G-LTE
downlink: the coding and decoding schemes in a time-variable multipath environment. It discusses the MIMO
schemes for 3G-LTE downlink, the STBC/SFBC, SFTC/STTC and Group layered SFC coding-decoding
schemes. This paper also discusses channel estimation scheme based on pilot symbol assistance (PSA),
including the pilot pattern and the channel tracking algorithms. The computation complexity, frequency
efficiency, BER performance and the effects of channel estimation are analyzed under multi-path fading
channel environments. Then we give computer simulation results for the coding-decoding schemes. We believe
that results will provide beneficial information to design the 3G-LTE downlink channels.
P/S
IFFT
Forming
S/P
ST/SF Coding
sM T [n, m]
S M T [ n, k ]
P/S
IFFT
S/P
Frame
Forming
Pilot
Symbol Other user data
Fig 1 ST/SF Coding MIMO scheme for LTE downlink (transmitter)
y1[n, m]
Remove Pilot Y1[n, k ]
FFT
S/P
P/S
guard symbol
symbol recover
ST/SF Decoding
y M R [ n, m ]
Remove Pilot YM R [n, k ]
FFT
S/P
P/S
guard symbol
symbol recover
Channel
Estimate
Pilot Symbol
Fig 2 ST/SF Coding MIMO scheme for LTE downlink (Receiver)
Suppose that the system is equipped with M T For the nth OFDM symbol, the channel response
transmitting (Tx) antennas and M R receiving (Rx) between the qth transmitter antenna and the ith
antennas. The output signal from IFFT can be receiver antenna can be described as
described as sq [ n, m] in time domain h i , q [n] = [hi ,q [n, 0], hi ,q [n,1], , hi , q [n, L − 1]]T (3)
1 N −1 2π km where i = 1, 2, , M R , q = 1, 2, , M T and L is
∑ Sq [n, k ]e
j
sq [n, m] = N
(1) the channel order.
N k =0
The received signal after matched filtering and
The signal with guard interval ( N g ) is the guard symbol removed are
⎧ s [n, m + N ] m = − N g , , −1
sq [n, m] = ⎨ q
⎩ sq [n, m] m = 0 N − 1 (2)
It can be seen that, for transmit signal pairs of Yn ,i = H n ,i ,1S n ,1 + H n,i ,2S n,2 + Z n,i (21)
S1[k ] S 2 [k ] , the decision statistics input is the
where H n ,i ,1 , H n ,i ,2 are channel response diagonal
linear combinations of M R M T signals. When the matrix. Using the odd and even part expression,
fading of the channel between any Tx and Rx Eq.(21) can be expressed as
antenna pair is mutually independent, the scheme Yn ,i ,e = H n ,i ,1,eS n ,e + H n ,i ,2,eS n,o + Z n,i ,e (22)
can achieve a full transmit diversity of M R M T .
Yn ,i ,o = − H n ,i ,1,o S*n ,o + H n ,i ,2,oS*n ,e + Z n ,i ,o (23)
The average symbol error probability (SER) can
be expressed as Suppose that the distance between the adjacent
Ps ( E ) = sub-carriers exceeds the correlated bandwidth, one
3π
⎛ ρ0
⎜⎜ −
1 ⎞
⎟⎟ (16) can have H n ,i ,1,e ≈ H n ,i ,1,o , and H n ,i ,2,e ≈ H n ,i ,2,o .
1
π∫
∏ ∏ ⎝ M T 2sin (θ ) ⎠
dθ
MR MT 2
4
i =1 q =1
M γ i ,q e Thus the results of the following linear
0
transformation can be used to do ML decision
P
Where ρ0 = is SNR, P is total transmit power, processing
σ V2 MR
Sn,2 = ⊗ a1
(18)
⊗
T
⎣⎡Sn[1] Sn [0] Sn[ N −1] Sn*[ N − 2]⎤⎦
*
av1
⊗
I t (1)
Let S ne and S no are the vectors constructed by
taking the even and odd components of S n
⊕
x(t )
respectively. S n ,1,e , S n ,1,o , S n ,2,e , S n ,2,o are symbol
vectors of odd and even sub-carriers of
corresponding transmitter, then
S n ,1,e = S n ,e I t (2)
b v2
(19)
S n ,1,o = −S*n ,o
S n ,2,e = S n ,o b1
(20)
S n ,2,o = S*n ,e
b0
When the guard interval exceeds the maximum
Fig 3 structure of SFTC
time delay of channel, the received signal vector at
the ith Rx antenna is
For QPSK, the data stream was split into 2 sub- maximizing diversity gain. They usually provide
streams (3 sub-streams for 8PSK), and then send to diversity gain without coding gain.
SFTC coder. The constrained length of codec is STTC and SFTC can obtain diversity gain and
⎢ v + i − 1⎥ coding gain at the same time. SFTC (STTC) scheme
v = v1 + v2 , where vi = ⎢ . At the time t ,
⎣ 2 ⎥⎦
is based on TCM, which is a joint design of error
control coding, modulation, transmit and receive
the symbol transmitted from k transmitter is diversity. It can simultaneously offer a substantial
coding gain, spectral efficiency, and diversity
v1 v2 improvement. However, the complexity of the
x = (∑ I
k
t
1
t− p a + ∑ I t2−qbqk ) mod 4
k
p (26) SFTC (STTC) decoding (denoted by the number of
p =0 q =0 trills states) is increased exponentially with transmit
l
where I t − p is the bits in the lth sub-data stream, at diversity gain d and transmit rate b , and may not
be feasible for many applications.
time t− p , the coder output
[6] and [7] propose a Space-Frequency-Time
xt = [ x , x , 1
t
2
t ,x t
MT
] is mapped to the (SFT) scheme, which can achieve the maximum
constellation symbols and the coding matrix is diversity gain. However, It spectral efficiency is
G T = ⎡⎣aT0 , bT0 , a1T , b1T , ⎤⎦ . lowered because of the coding redundancy.
SFTC uses vector Viterbi decoding algorithm. If
SFTC is applied on all sub-carriers, for large
3.6 Channel Estimation
number of carriers the decoding procedure is very
The PSA channel estimation is shown in Fig.5. Two
complex. One way to overcome this difficulty is to
significant issues for PSA approach are: (a) the
group the sub- carriers, and apply the SFTC on
design of the pilot symbol pattern at transmitter; (b)
different groups. This scheme, however, will suffer
performance lost. the estimation of channel state information at all
subcarriers and symbols based on the receiving pilot
at the receiver.
3.4 Group Layered SFC Scheme For the receiver it first obtain channel estimation
A group layered SF coding (SFC) system was at pilot symbols, then to obtain the channel state
proposed [3], shown in Fig 4. It has multiple information at all the symbols by using
identical SFC at the Transmitter. The decoding transformation (IFFT-FFT)[10], interpolation [11],
processing chain related to an individual sub-stream filtering [12] and so on.
is referred to as a layer.
OFDM
3.6.1 Pilot Pattern
SFC Grouped Two-dimension rectangular pilot pattern for a
OFDM Interfe
OFDM
rence resource block (12 sub-carriers × 7 OFDM
Layered STC
n=0
Frequency
k =0
Df
k=11
Dt
In order to recover channel state for all the 3.6.2 Channel Estimation at Pilot Symbols
subcarrier and symbols the pilot patterns should Suppose that the MIMO-OFDM system is equipped
satisfy the multi-dimension Nyquist sampling with M T Tx(transmitting) antennas and M R Rx
theorem [12]:
(receiving) antennas. The channel response between
f D maxT 's ⋅ Dt ≤ 1/ 2 τ D max ΔF ⋅ D f ≤ 1/ 2 (27)
the qth Tx antenna and the ith Rx antenna is
where f D max is the maximal Doppler frequency hi , q [n] = [hi , q [n, 0], hi , q [n,1], , hi , q [n, L − 1]]T
(29)
spread and τ D max is the maximal multipath delay where n is the OFDM symbol index,
spread, ΔF is the subcarrier interval and T 's is the i = 1, 2, , M R , q = 1, 2, , M T and L is the FIR channel
OFDM symbol period. Usually a double order. When the guard interval ( N g ) exceeds the
oversampling will be used in a practical system. maximum time delay spread of the channel, the
The spectral efficiency loss for the rectangular Inter-Symbol-Interference (ISI) can be neglected
pilot pattern is and the signal model in frequency domain can be
MT expressed as
η0 = (28) MT
Dt D f Yi [n, k ] = ∑ H i , q [n, k ]S q [n, k ] + Vi [n, k ]
q =1
(30)
i = 1, 2, , M R , k = 0,1, , N −1
where Yi [n, k ] is the received signal at the ith antenna,
S q [n, k ] is the symbol transmitted by the qth Tx
L −1 2π kl
−j between the M T Tx antennas and the ith Rx
antenna, H i , q [n, k ] = ∑ hi , q [n, l ]e N
is the channel
l =0 antenna can be rewritten as
frequency response at the kth subcarrier of h i [n] = [hTi ,1[n], hTi ,2 [n], , hTi , MT [n]]T (35)
nth OFDM symbol between the qth Tx antenna and According to the MMSE criterion, the cost function
the ith Rx antenna and Vi [n, k ] is AWGN noise with of the estimation is
mean zero and variance σ V2 . J (hi [n]) = E{| Yi [n, k p ] − Yi [n, k p ] |2 } (36)
Using the known Training Pilots and the where
MT
corresponding received symbols, the frequency
Yi [n, k p ] = ∑ S q [n, k p ]H i , q [n, k p ] = hˆ Ti [n]w p [n] (37)
response for the kq , p th pilot estimated by LS q =1
⎢ q ,⎥
N N
S [ n, k p ]e , Sq [ n, k p ]e
Let H i , q = [ H i , q [n, kq ,0 ], H i , q [n, kq ,1 ], , H i , q [n, kq , P −1 ]] , wq, p [n] = ⎢
T
− j 2π ⎥ (39)
⎢ , S [n, k ]e N k pli ,q,L ⎥
the time domain channel response between the qth ⎣ q p ⎦
Tx and the ith Rx antenna is Substitute (37) into (36), the cost function becomes
J (hi [n]) = E{| Yi [n, k p ] − hTi [n]w p [n] |2 } (40)
⎛1⎞
hi , q [n] = ⎜ ⎟ WqH H i ,q ; A LMS-Like algorithm is employed to find the
⎝P⎠ (32) optimal estimation of the channel coefficients. Let
i = 1, 2, , M R ; q = 1, 2, , MT hi [n, p] be the estimation of optimal
where Wq is a P × N matrix whose (k , m)th element h i [n] after p times iteration, the instantaneous
is estimate of the gradient vector of
− j 2π
( q −1+ kM T )( m −1)
[ Wq ]k , m = e N (33) J (hi [n, p])
2 (41)
hi , q [n] = [hi , q [n, 0], hi , q [n,1], , hi , q [n, N − 1]]T is an = Yi [n, k p ] − hˆ Ti [n, p]w p
N × 1 complex vector consisting of N estimated
fading coefficients. In real wireless environments, is
the number of fading paths is limited and thus most ∇J (h i [n, p ])
(42)
of the estimated coefficients in hi , q [n] might be the = −2w *p [n]Yi [n, k p ] + 2w p [n]w Hp [n]hi [n, p ]
∗
estimation error. The Significant Taps Catch (STC) Here [i] donates the vector conjugate. Let
technique [14] is employed in the scheme to pick
2 e[n, p] = Yi [n, k p ] − w Tp [n]hi [n, p ] (43)
out L paths with larger power gains hi , q [n, l ] . After
The estimation is updated as
STC the channel coefficients can be expressed by hi [n, p +1] = hi [n, p] + μ[−∇J (hi [n, p])]
the vector pairs (44)
T hi [n, p +1] = hi [n, p] + 2μw*p [n]e[n, p]
⎡li,q,1 , li,q,2 , , li,q, L ⎤
⎣ ⎦ where μ is the step size. To guarantee the
hi,q [n] = [hi,q [n, li,q,1 ], hi,q [n, li,q,2 ], , hi,q [n, li,q, L ]]T (34) convergence property of the algorithm, μ is
q = 1,2, , MT ; i = 1,2, , MR 1
The STC technique reduces the estimation error selected to satisfy 0 < μ < .
MT L
and the complexity of the adaptive tracking process Since usually channel varies continuously
significantly. between successive OFDM symbols, it is reasonable
to initialize the estimation in the current OFDM
symbol by the estimation results in the previous
3.6.3 Adaptive tracking for time-varying OFDM symbol, i.e.
Time domain adaptive tracking algorithm is resorted hi [n,0] = hi [n − 1] (45)
to tracking the time varying channels. Based on the
STC results, the estimation of the MISO channel
For each of the M R Rx antennas, after P iterations bandwidth of 5MHz; The channel is composed of
the final estimation for nth OFDM symbol is 6 × 20 sub-paths, the transmit power of a single
antenna shall be the same as the each transmit
hi [n] = hi [n, P] (46)
power of a multiple antenna case. Considering the
The frequency response Hˆ i , q [n, k ] is obtained by QPSK modulation and the down-link channel,
using FFT. N = 1024 , N g = 40 . The receiver signal-to-noise-
For LS algorithm the cost function of the estimation ratio (SNR) is defined as
is
⎧M 2⎫
E ⎨∑ Hi , q [n, k ] Sq [n, k ] ⎬ .
T
2
P −1
J (hˆ i [n]) = ∑ Yi [n, k p ] − hˆ [n]w p [n] (47)
2
T
SNR = ⎩ ⎭
i q =1
p =0
σV2
where Yi [n, k p ] and w p [ n ] are obtained by the Assuming that, the guard interval exceeds the
reference pilots and STC. Based on the same maximum time delay of the channel, so the IBI can
assumption as the above LMS algorithm, the be neglected. The transmitting power for all the
optimal LS estimation is simulations is identical and equally distributed to
hˆ i [n] = (W H [n]W[n])-1 W H [n]Yip [n] (48) each antenna.
u =0
(50)
RLS (recursive LS) algorithm derived from
Eq.(50) is listed in Table 1.
Table.1 The RLS tracking algorithm for time- Fig 7 compare of SFTC and SFBC(2×2)
varying channels
Initialize: hi [n, 0] = hi [n − 1] = hi [n − 1, P], Φ[0] = δ −1I
Φ[0]where δ is a little positive number
Calculate: λ−1Φ[ p −1]wp[n]
k[ p] =
p =1,2, , P 1+ λ−1wHp [n]Φ[ p −1]wp[n]
e[n, p] = Yi [n, kp ] − wTp[n]hi[n, p]
hi[n, p +1] = hi [n, p] + k[ p]e*[n, p]
Φ[ p] = λ−1Φ[ p −1] − λ−1k[ p]wHp [n]Φ[ p −1]
4 Simulation results
To demonstrate the performance of the MIMO
scheme discussed, computer simulation has been
carried out. Fig 8 STBC Scheme (Alamouti)
Firstly, in order to compare performance of these
MIMO schemes, we assume that the receiver could Figure 7 compares the performance of SFBC and
obtain the exact CSI and recover the carrier frequency 16-state SFTC under same channel and antenna
correctly. structure.. The figure shows that the performance of
Assuming the channel is macro Urban scenario SFTC system is superior to the SFBC system. The
[4], carrier frequency of 2.15GHz, the height of base SFTC system brings a 2.3dB improvement at a BER
station is 10m, the mobile height is 1.5m; the of 10−4 than SFBC system. It is because that the
carefully designed SFTC can offer both diversity Fig 10 shows the impact of Ricean channel factor
gain and coding gain, with the cost of the increasing K on a SFBC system. The Rayleigh fading channel
of the decoding complexity. and the Ricean channel with factor K=10 and
Figure 8 shows the impact of fast fading channel K=100 are studied. It can be observed that the
on STBC-OFDM. It assumed that the channel keeps performance is slightly degraded when the factor K
constant over 2 successive STBC-OFDM symbols. is increasing.
The performance of a system with the velocity of Figure 11 shows the SER curve of GLSFC
30km/h is worse than the system of constant channel (Group Layered SFC). For the scheme layered code
by 1~2dB loss. This is because that the fast fading V-BLAST is concatenated with SFBC The system
of channel destroys the orthogonal of Alamouti has 4 Tx antennas, splitting into 2 groups, QPSK
scheme. modulation and the transmit rate of 4bps/Hz.
The fast fading could offer an extra diversity Different number of Rx antennas were adopted. It
gain: Doppler diversity. To obtain the Doppler gain, can be observed that increasing the number of Rx
much work had to be done with the channel antennas provides a significant diversity gain.
estimating and decoding processing.
5 Conclusion
In this paper, we discussed the combination of
MIMO schemes for the downlink channel in 3G
Long-Term Evolution (3G-LTE). The coding and
decoding schemes in a time-variable multipath
environment are discussed. In particular, the
STBC/SFBC, SFTC/STTC and Group layered SFC
coding-decoding schemes, were taken into account.
Their performance including the computation
Fig.14 BER versus SNR with different L (LMS complexity, frequency efficiency, BER and the
30km/h) effects of channel estimation, are compared.
Furthermore, computer simulation results for these
schemes. We believe that results will provide Estimation, IEEE Trans. On Broadcasting, Vol.
beneficial information to design MIMO scheme for 46, No.4, pp.240-248, Dec.2000
the 3G-LTE downlink. [11] S.Kang, Y.Ha and K.Joo, A Comparative
Investigation on Channel Estimation
Algorithms for OFDM in Mobile
6 Acknowledgement Communications, IEEE Trans. On
The authors wish to grateful to their colleagues at Broadcasting, Vol.49, No.2, pp.142-149,
Group of Smart Antenna and Signal Processing of Jun.2003
UESTC. [12] P.Hoeher, S.Kaiser and P.Robertson, Two-
dimension pilot-symbol-aided channel
estimation by wiener filtering, in Proc. 1997
References: IEEE Int. Conf. Acoustics, Speech, and Signal
[1] H. Bolcskei, M.Boromann and A.J.Paulraj, Processing, Munich, Germany, Apr.1997,
Impact of the propagation environment on the pp.90-96
performance of space-frequency coded MIMO- [13] King F.Lee and Douglas B.Williamos, “Pilot-
OFDM, IEEE JSAC. Vol.21, No.3, pp.427-439, Symbol-Assisted Channel Estimation for
April 2003 Space-Time Coded OFDM Systems,”
[2] Z.Chen, B.Vucetic, J.Yuan, et al, Space-Time EURASIP Journal on Applied Signal
Trellis Codes with Two, Three and Four Processing 2002:5,507-516
Transit Antennas in Quasi-Static Flat Fading [14] Y. (G.) Li, Simplified Channel Estimation for
Channels,IEEE ICC, vol 3,pp.1589-1595, May OFDM Systems With Multiple Transmit
2002 Antennas”, IEEE Trans.On Wireless Commum,
[3] V. Tarokh, et al, Combined array processing vol. 1, pp.67-75, Jan.2002
and space-time coding, IEEE Trans. on Inf. [15] “Evaluation Methodology for IMT-2000 Radio
Theory, Vol. 45, No. 4, pp. 1121–1128, May Transmission Technologies”,
1999. http://www.arib.or.jp/
[4] 3rd Generation Partnership Project; Technical [16] 3GPP, “Physical layer aspects for evolved
Specification Group Radio Access Network; Universal Terrestrial Radio Access (UTRA)
Spatial Channel Model for Multiple Input (Release 7),” TR 25.814 V7.1.0, Sept. 2006.
Multiple Output (MIMO) simulations. 2003. [online]
www.3gpp.org
[5] S. M. Alamouti, A simple transmit diversity
technique for wireless communications, IEEE J.
Select. Areas Comm., Vol. 16, No. 8, pp. 1451-
1458, Oct. 1998.
[6] G.J.Foschini, Layered space-time architecture
for wireless communication in fading
environment when using multi-element
antennas, Bell Labs Tech.J. Vol.1, pp.41-59,
1996
[7] H. Bolcskei, M.Boromann and A.J.Paulraj,
Impact of the propagation environment on the
performance of space-frequency coded MIMO-
OFDM, IEEE JSAC. Vol.21, No.3, pp.427-439,
April 2003
[8] M.Hsieh and C.Wei, Channel estimation for
OFDM systems based on Comb-Type Pilot
Arrangement in Frequency Selective Fading
Channels, pp.217-225, IEEE 1998
[9] Y(G). Li, Pilot-Symbol-Aided Channel
Estimation for OFDM in Wireless Systems,
IEEE Trans. On Vehicular Tech., Vol.49, No.4,
pp.1207-1215, July 2000
[10] H.Minn and V.Bhargava, An investigation into
Time-Domain Approach for OFDM Channel