ESTIMATION OF THE DOWNLINK CHANNEL FOR UMTS
The present invention relates to a method for estimating channels in a receiver for the downlink of the TDD (Time Division Duplex) component of the UMTS (Universal Mobile Telecommunication System) and a receiver thereof.
In mobile telecommunications systems, due to bandwidth limitations and multipath propagation, the transmission channel distorts the signal being transmitted, leading to inter symbol interference (ISI). The receiver needs to identify this channel distortion and equalize it. Classical system identification techniques require the use of both system input and output, which leads to the transmission of a training sequence, i.e. a set of fixed data (that do not carry information) that are known to both transmitter and receiver. The use of a training sequence reduces the transmission rate, especially when the training sequence has to be retransmitted often, due to the possibly fast channel variations that occur in mobile communications. To the contrary, blind equalizers adapt without using a training sequence.
In TDD mode of UMTS standard the channel estimation is based on the transmission of training sequences known at the receiver in every data packet. The problem of channel estimation by means of training sequences in receiver of mobile terminals has received much attention in the literature over the past years. Some algorithms operate in the time-domain and are based on a least-square approach . Other schemes operate in the frequency domain and are based on Discrete Fourier Transform (DFT) techniques. A reduced complexity search for the optimum training sequences has been proposed. In conventional systems, channel estimation is performed without taking into account a priori knowledge (Side Information) of the transmit shaping filter. A few time-domain schemes exploiting side information have been recently investigated and it has been shown that side information can improve the estimation accuracy with respect to conventional methods.
In hybrid TDMA (Time Division Multiple Access)/ CDMA (Code Division Multiple Access) systems like the TDD component of the UMTS standard, the problem of channel estimation has been addressed for the uplink, where the base station BS has to estimate up to 16 impulse responses (one for each active user). In the downlink the signals transmitted to the users pass through the same channel. The problem is complicated by the fact that the mobile station does not know which user codes are active in the slot. Figure 1 shows the slot structure of the UMTS-TDD component. We see that there are two fields of data separated by a midamble, which contains the training sequences of the active users and serves to estimate the channel
impulse response and the users' powers. The training signal in the downlink is similar to that used in the uplink. In particular, each active user is associated with a cyclically shifted version of a basic code with good autocorrelation properties. The resulting sequence is fed to a root- raised-cosine pulse shaping filter with roll-off = 0.22 . This model allows estimation of the channel impulse responses in the uplink by means of standard techniques. In the downlinlc the problem of channel estimation is quite different with respect to the uplink, since all users arrive at the mobile station MS through the same channel. Consequently, the channel impulse responses of the users only differ for a scalar factor that depends on the user's power. In particular, if a user is not active in the link then its scalar factor is zero. Thus, in contrast to the uplink situation where Nut different channels must be estimated (one for each active user), a single channel impulse response must be estimated in the downlink.
A discussion of the problem of channel estimation by means of training sequences in receiver is now given.
The received signal is given by
r(t) = s t) + w(t) (1) where w(t) represents the noise contribution, while s(t) is the useful signal component
s(t) = ∑r, ∑ a h{t- kT) . (2) ι=l k=\~W
In (2), P represents the length of the midamble expressed in chip intervals T , h(f) is the channel impulse response with support in (0, WT) , β(/) = {a^; 1 - W ≤ k < P - 1} is the training sequence associated with the zth user while γl = jP~ l , Pt being the power of the z'th user {/, = 0 if the user is not active). In the UMTS standard the parameters P, We Nut satisfy the following relation
P = WN. ut (3)
The training sequences α ,ω , l ≤ i < Nut are derived by cyclically shifting a basic code a =[a0,a ...,aP_ \ of length P in the following way
^ - -D^ - W+ l ≤ k≤ P - l, i = \,2,.. ,Nut (4) where the notation \r p stands for n modulo P. Without loss of generality, in the following we assume that the desired user is the first one and we let γ = \ . The received signal is first filtered and then sampled with period T I 2. The corresponding received samples are expressed by
*(») = *(0L
Br/2 + w(n) ≤ n ≤ 2P - l (5)
where {h(k); 0 < k < 2W - 1} are the samples of h(t) taken at kT / 2 and b® is related to the th
training sequence by the relation
Its f- 'λ n even b ) = \ " , . (6)
I o otherwise
From (5) it is seen that 2W + Nut - l parameters must be estimated: the Nut - 1 amplitudes iyt; 2 ≤ i ≤ Nut - l} and the 2W samples {h(k); O ≤ k ≤ 2W - 1} of the channel impulse response. It is worth noting that accurate estimates- of the signal amplitudes {/,- ; 2 < i ≤ Nut - 1} allow to identify the active user codes. This information is essential to perform multiuser data detection. Estimation of the signal amplitudes also allows to achieve a channel Mean Square Error (MSE)
very close to the following theoretical limit
MSE bomd = σ 2 j (8)
P ∑ r f i= l where B = (1 + ) 12T is the bandwidth of the useful signal component and σ is the power of the noise sample w(n). Eq. (8) is derived under the assumption that the amplitudes γi axe a priori known and the training sequences have ideal autocorrelation properties (i.e., their power spectral density is constant).
The UMTS-TDD standard employs orthogonal spreading codes to provide intrinsic protection against multiaccess interference. Correspondingly, the conventional code-matched filter receiver is optimum for transmission over the additive white Gaussian noise (AWGN) channel. In the presence of multipath, however, signals undergo frequency-selective fading and the spreading codes lose their orthogonality. In such conditions the matched filter detector suffers severe performance degradation due to multiaccess interference. To mitigate this problem, multiuser detection equalization techniques can be resorted to. As the complexity of the optimum multiuser detector is unrealistically high, suboptimum schemes based on block equalization have been proposed which provide a reasonable trade-off between performance and complexity. The equalizer coefficients can be computed by separately minimizing the mean squared error between the samples at the equalizer output and the data of each active user. This technique represents a suboptimum joint detection strategy and can be used with both linear or decision feedback equalizers (DFE). The DFE implementation, however, is rather complex and has not been used for the downlink. Several schemes based on linear equalization have been recently
proposed and some of them are still investigated. It is worth noting that all these reduced- complexity multiuser detectors require knowledge of the channel impulse response and identification of the active users in the slot.
Thus, it is necessary to jointly estimate the channel impulse response and the users' powers. It is the object of the present invention to solve the above drawbacks and provide a method for estimating channels in a receiver having a more efficient and improved performance compared to the solutions already known.
In this frame, it is the main object of the present invention to provide a method for estimating channels in a receiver, which is apt to jointly estimate the channel impulse response and the users powers achieving good performance in terms of bit-error-rate.
A further object of the present invention is to provide a channel estimation accuracy superior to that achieved with other existing methods.
A further object of the present invention is to accurately identify whether a given user is active or not. .In order to achieve such aims, it is the object of the present invention to provide a method for estimating channels in a receiver and/or a receiver incorporating the features of the annexed claims, which form an integral part of the description herein.
Further objects, features and advantages of the present invention will become apparent from the following detailed description and annexed drawings, which are supplied by way of non limiting example, wherein:
- Fig. 1 shows the slot structure of the UMTS-TDD component to be used in association with the method according to the invention.
The method for estimating channels in a receiver is now explained:
The key idea of the method for estimating channels according to invention is of jointly estimating channel response and signal amplitudes starting from signal amplitudes. This approach has the following advantages: i) The channel estimation accuracy is superior to that achieved with other existing methods because we exploit the aggregate of all the active users' signals rather than a single signal, iϊ) It is possible to accurately identify whether a given user is active or not. Consider the 2P received samples given in (5). We aim at jointly estimating the channel vector and the signal amplitudes, i.e.,
h = [h( ,h(X),..., h(2W- l)f (9)
(the superscript (•) indicates vector or matrix transposition) starting from the observed vector
* = [x(0),x(l),...,x(2P - l) (11)
To this end, we rewrite (5) in matrix notation
x = Phs + w (12) where hs is a 2NU/ W -dimensional vector containing scaled versions of the channel response h
r2h
τ r3h
τ -
rN ι
τ]
τ (13) , while P is a matrix of dimension 2P x 2N
utW containing N
ut blocks, each of dimension 2P x 2W
The («,#)-entry of Bi , 1 < i ≤ Nut , is given by
with b as defined in (6). The noise-vector w = [w(Q),w(ϊ),...,w(2P - l)]
τ is zero-mean and Gaussian, with covariance matrix
Cw = E{wwH} = σ2I2P (16) where J2P is the identity matrix of order 2P and the superscript (•) represents Hermitian transposition.
We begin by estimating hs through DFT techniques. To this end we resort to an known frequency-domain method which makes use of side information, adapting it to hybrid TDM A/CDMA systems. We found that a reduction of the mean square channel estimation error by a factor 0.6 can be achieved in UMTS by exploiting a priori knowledge of the transmit filter bandwidth. Letting
NB = mt(PBT) (17)
(int(x) indicates the integer part of x) we compute the 2NutW -dimensional vector y
In (18), [y]n represents the nth entry ofy, X(m) is the 2 -point TDF of the observed vector Λ;
2P-1
X{m) = x{k)e-
Jπmk'
P - P ≤ m ≤ P - 1 (19)
and Aim) is the P-point DFT of the basic code a
A{ιri = ake-^nk'P (20) k=0
It can be shown that
y = hs + w (21) where the noise contribution w is a zero-mean Gaussian vector with covariance matrix C^ . Equation (21) indicates that v is an unbiased estimate of hs and is normally exploited in the uplink of the UMTS-TDD component as an estimate of the channel impulse responses associated to the active users. To proceed, we divide y into Nut sub vectors {yn 1 < i ≤ Nut), each of length 2W
The Mi entry of yt is given by
Bearing in mind (21) and (13) we get
yl = χlh + wl i = 1,2,...,NW, (24) where wt is the z'th subvector of w . It is worth noting that yt represents an estimate of the channel γji associated to the z'th user.
The key idea of the invention is of jointly estimating vectors h and γ starting fromjλ With this approach the channel estimation accuracy is superior to that achieved with other existing methods because we exploit the aggregate of all the active users' signals rather than a single signal, and further, z't is possible to accurately identify whether a given user is active or not. To this end we resort to the least square criterion
where || • || indicates the Euclidean norm of a vector while h and γ are trial values of h and γ . Since the minimization (25) cannot be solved in closed form, it will be split into two simpler problems: z) estimation of γ assuming h known; if) estimation of A assuming γ known. As we
explain later, a solution to (25) can be achieved through an iterative procedure.
Estimation σ/γ assuming h known In this case problem (25) reduces to γ, - arg m ιmin y; - ? *||2 } i = \,2,...,Nut (26) r and its solution is found to be
9te
t*/ι}
where 5Re(x) denotes the real part of a number x. Estimation ofh assuming γ known In this case problem (25) reduces to
∑r,y.
A=- - (Tι =D (29)
Joz?t estimation ofh and γ Equations (27) and (29) can be used to jointly estimate vectors A and γ in an iterative fashion. Denoting by A(c) and γw the estimates of A and γ at the Mi iteration, the next estimates are computed as
r! ) = , „2 i=2,3,...,Nfl, = 1,2,... (30)
A (*-i)
# ( (*) = 1) Λ = 1,2,... (31)
Simulations indicate that the iterative algorithm (30)-(31) converges toward the solution of (25) in 2-3 iterations. However, it needs an initial channel estimate A
(0). Once A
(0) is available,
initial amplitude estimates γ
(0) can be computed through (30). Given γ
(0) we compute A by means of (31) ... and so on. To see how to get , we momentarily return to (24). Bearing in mind that γ
χ = 1 , it is easily seen that y represents a noisy version of A. Thus, we can simply assume Λ
(0) = y
λ . It is worth noting that the estimate of γ can be used to decide whether a given user is active or not. To be specific, the z
'th user is declared active if γ
t exceeds a given threshold λ , otherwise it is declared turned off.
In Tables I and II the MSE as obtained by simulation with the proposed method is indicated as MSEM&M and is compared with the theoretical limit MSEbomd given in (8). We have also reported the MSE as obtained with the conventional channel estimation method used in the uplink, indicated with the acronym MSEitd . The conventional method is expressed by
where z is a vector containing the first 2 Gentries of
Substituting (12) in (33) it is found
z = hs +μ (34) with μ = (PHP)~1PHw . Eq. (34) indicates that z is an unbiased estimate of hs . A third estimation scheme is obtained by reasoning in the following way. We divide z in Nut subvectors {z,, l ≤ i ≤ Nut), each of dimension 2W
with the Mi entry of z
x given by
[z, ]* = [«]*+2( - i)» (36)
Bearing in mind (34) and (13) it is seen that
z
l = γ
lh + μ
! i = l,2,...,N
ut (37) where μ
t is the z
'th subvector of μ. Thus, a channel estimate can be obtained starting from the subvectors z, through the following ad hoc algorithm
where the coefficients {η
t } are expressed by
/ = 2,3,..., N ut irh = i) (39)
The results in Tables I and II are normalized to MSEstd and have been obtained with the channel model 3 as standardized by 3 -GPP [3 -Generation Partnership Project] assuming that all users have equal power. It is seen that the accuracy of the proposed method is close to the bound and is much better than that achieved by the ad hoc scheme, at least at signal-to-noise ratio of practical interest (6-8 dB).
Tab.2 Performance comparison at SNR=8.dB.
The proposed algorithm (30)-(31) can be used to decide whether a given user is active or not. Identification of the active users is an open problem in the standardization process, as clearly indicated in several 3 -GPP documents where it is proposed the use of a separated channel to transmit information about the active users in the slot in order to minimize the probability of false codes' detection. A simple data detector for the downlink is based on the fact that the spreading codes are perfectly orthogonal and all user signals arrive at the mobile station through the same channel. In a frequency-selective environment the spreading codes lose their orthogonality. To mitigate this problem we may resort to a standard linear equalizer (to restore codes' orthogonality), followed by a single-user receiver. This detector is much simpler than
those described previously and its performance is only 1.5 dB worse if the equalizer coefficients are computed according to the MMSE criterion and the channel selectivity is not too severe. Obviously, the choice of the equalizer's taps requires knowledge of the channel impulse response. It is found that if the proposed channel estimator is used, the performance of the reduced complexity data detector is superior to that achieved with other more complex schemes operating with traditional channel estimation methods.