• 沒有找到結果。

Subspace-MMSE blind channel estimation for multiuser OFDM with receiver diversity

N/A
N/A
Protected

Academic year: 2021

Share "Subspace-MMSE blind channel estimation for multiuser OFDM with receiver diversity"

Copied!
5
0
0

加載中.... (立即查看全文)

全文

(1)

Subspace-MMSE Blind Channel Estimation for

Multiuser OFDM with Receiver Diversity

Yu-Yi Cheng Yumin Lee Hsueh-Jyh Li

Graduate Institute of Communication Engineering

National Taiwan University

Taipei 10617, Taiwan

Abstract In this paper, a receiver algorithm for OFDM with receiver diversity is proposed. The proposed receiver uses a new two-step blind channel estimation algorithm referred to as the subspace-MMSE channel estimator. Minimum mean square error linear diversity combining is then performed based on the estimated channel. Simulation results show that performance gain of 1 – 3 dB is achievable by the proposed approach.

I. INTRODUCTION

Orthogonal frequency division multiplexing (OFDM) [1] is an efficient transmission technique for high-rate wireless data communication systems. In OFDM, a high–rate data stream is transmitted over low-rate parallel subcarriers, thus increasing the symbol duration and reducing the effect of multipath delay-spread. A cyclic prefix (CP) is also introduced in every OFDM symbol to eliminate inter-block interference (IBI) and reduce receiver complexity. Although OFDM is very effective in combating the effect of delay-spread, it stills suffers from signal fading caused by multipath propagation as well as interference caused by other users. Receiver diversity [2] is a technique for mitigating both effects. For example, by linearly combining the signals from multiple receiving antennas, a diversity receiver can greatly enhance the performance of an OFDM system in the presence of signal fading and interference. The weightings for diversity combining must be carefully optimized in order to achieve the best performance, which in turns requires accurate estimates of the channel between all users and receiver antennas.

The development of blind channel estimation and equalization algorithms based on second-order statistics (SOS) [3] derived either by over-sampling or from the use of an antenna array has spawned intensive research in the area, such as the least-squares [12] and

This research work was supported by the National Science Council of the Republic of China under grant number NSC 90-2219-E-002-011.

the subspace [8] methods. The subspace method, in particular, has also been applied to channel estimation for single-user OFDM systems [4-6]. A subspace-based approach is proposed in [4] to directly estimate the frequency-domain channel gains for single-user OFDM systems. In [5], a subspace-based channel identification algorithm is proposed for a single-user OFDM system without cyclic prefix. And in [6] it is proposed to use the autocorrelation of the vector that consists of all received signal samples to perform subspace-based blind channel estimation for single-user OFDM systems. While these approaches achieve good performance for the single-user case, some generalizations are necessary if they are to be applied to multi-user OFDM systems.

In this paper, we present a receiver that uses the subspace-based channel estimation algorithm for multi-user OFDM transmission systems with receiver diversity. The proposed receiver consists of a two-step blind channel estimator and a frequency-domain linear diversity combiner. In the channel estimator, an initial time-domain channel estimate is first obtained using a new multi-user generalization of the subspace approach. The initial estimate is then transformed into the frequency domain and appropriately scaled to obtain the refined, final frequency-domain channel estimates. The diversity combiner then performs per-subcarrier linear combining using weights computed from the frequency-domain channel estimates. Simulation results show that performance gain of 1 – 3 dB is achievable using the proposed approach.

II. SYSTEM BLOCK DIAGRAM

Consider the multi-user OFDM transmission system shown in Fig. 1, in which S quasi-synchronous users transmit independent and identically distributed OFDM symbols in the same bandwidth at the same time. For the s-th user, information bits are convolutionally encoded and mapped onto quaternary phase-shift keying (QPSK)

(2)

subsymbols, which are then serial-to-parallel converted and processed by the N-point inverse discrete Fourier transformer (IDFT), where N is the number of subcarriers. The output of IDFT is parallel-to-serial converted and a CP of length NCP is inserted to obtain a discrete-time

signal xs,l. For simplicity, we assume that CP

is sufficiently long so that there is no IBI. The continuous-time transmitted signal of user s is given by

(

t lT

)

q x t x l l s s()≡

, − , (1)

where T is the sample (chip) time of the OFDM symbol, and q(•) is the pulse-shaping function. The user signals are transmitted to M receiving antennas through independent wireless channels, each modeled as a modified Jakes’ frequency-selective multipath fading channel corrupted by additive white Gaussian noise (AWGN) [7].

At the receiver, the signals u(m)(t) received from the m-th antenna (m = 0,…,M – 1) are each filtered by a lowpass filter and sampled at a rate of P/T samples per second, resulting in a discrete-time signal given by

∑∑

− = − = − + = + ≡ 1 0 1 0 ) ( , ) ( , , , ) ( ) ( , ( ) S s L b m p n m p s b b n s P pT m m p n u nT x h v u (2) for m=0,1 ,…, M-1, p=0,1,…, P-1, and n = 0,1, 2,…, where h is the poly-phase discrete-time equivalent channel and L is the channel memory. The signal

u

n(m,p) is then fed into the proposed receiver to be discussed in the next section.

III. PROPOSED RECEIVER ALGORITHM As shown in Fig. 1, the proposed receiver consists of a two-step blind channel estimator and a frequency-domain linear diversity combiner. The two-step blind channel estimator produces an accurate estimate of the poly-phase discrete-time equivalent channel. The linear diversity combiner combines the frequency-domain received signals of all antenna elements on a per-subcarrier basis using weightings derived from the channel estimates using the minimum mean-square error (MMSE) criterion. The output is finally detected and decoded to obtain the decoded information bits.

A. Two-Step Blind Channel Estimation The proposed blind channel estimation algorithm consists of two steps. In the first step, an initial time-domain channel estimate is obtained using a new multi-user generalization of the subspace approach proposed in [8]. In

the second step, a refined frequency domain channel estimate is obtained by appropriately transforming and scaling the initial channel estimate. The resulting channel estimation algorithm is referred to as the subspace-MMSE channel estimates. Mathematically, the input to the blind channel estimator is an NP-dimensional poly-phase vector given by

[

mT

]

T P T m m ( ) 1 ) ( 0 ) ( − ≡ u u u L , (3) where T m p N n m p n m p [u u( ) 1, ] ) ( , ) ( + − = L u (4)

In this paper, the N components in

u

(mp ) are assumed to be samples of a particular OFDM symbol after the CP is discarded. Let (m)

u

R be the estimated covariance matrix of u(m), and

let

n

(mi ), i = 1,2,…,NP – S(L+N) be the eigenvectors corresponding to the smallest eigenvalues of (m)

u

R . Following the derivations in [8], initial estimates ( ) , , ~m p s b h of ( ) , , m p s b h that are accurate to within a scaling constant are obtained by minimizing ~( ) ( )~(m) s m H m s Q h h subject to ~(m) =1 s Hh C (linear constraint) or ~( ) 1 = m s h (quadratic constraint), where C is an arbitrary PL-dimensional vector,

[

m

]

T P s m s m s ) (,0) (,)1 ( ~ ~ ~ − = h h h L (5) is the initial time-domain estimate of the poly-phase discrete-time equivalent channel response between the s-th user and the m-th antenna, in which ] ~ ~ [ ~ ( ) , , 1 ) ( , , 0 ) ( , msp Lmsp m p s = h L hh , (6) and Q(m) is a matrix function [8] of (m)

i

n

, i = 1,2,…,NP – S(L+N).

After the initial time-domain channel estimates are obtained, refined frequency-domain channel estimates are obtained by first taking the DFT of (m)

p u to obtain (m) p U . Let

[

mT

]

T P T m T m m ( ) 1 ) ( 1 ) ( 0 ) ( ... − = U U U U , (7) we have ) ( ) ( ) (m HmX Vm U = + , (8) where T T S T ] [ 0 −1 = X X X L , (9) in which

[

]

T s N s s = X0, L X −1, X (10) is the vector of transmitted subsymbols of the s-th user and V(m) is a Gaussian random vector. The matrix H(m) is the multi-user poly-phase

frequency-domain channel matrix of the m-th antenna that has P block rows and S block

(3)

columns. The (p,s)-th block element of H(m) is an N×N diagonal matrix whose diagonal entries are the DFT values of

h

(s,mp).

As mentioned earlier, suitable scaling factors are necessary for obtaining the final frequency-domain channel estimates. Let

) ( , , ) ( , ) ( , , ~ ˆ m p s k m s k m p s k C H H = (11) be the final frequency-domain channel estimate, where ( ) , , ~ m p s k

H , k = 0,…,N – 1, are the initial frequency-domain channel estimates obtained by taking the DFT of ( ) , ~m p s h , and ( ) , m s k C are the appropriate scaling factors to be determined. Define the mean-square error (MSE) as

      ≡ ( ) ( ) 2 ) (m E Um Hˆ mX J (12) where Hˆ(m)is an estimate of H(m) obtained

using by replacing the entries of H(m) with

) ( , , ˆ m p s k

H . Substituting (11) into (12), we have

      = ( ) ( ) ( ) 2 ) ( m ~ m m k m E J U H α (13) where

[

mT

]

T S T m m ( ) 1 ) ( 0 ) ( − ≡α α α L (14) in which

[

m

]

T s N m s N m s m s m s ) C0(, )X0(, ) C( 1), X( 1), ( − − ≡ L α (15)

The scaling factors ( ) ,

m s k

C are found by first computing the MMSE solution for α(m) given

by [9]

( )

( ) 1 ( ) ) (m R~ m ~pm α = − (16) where

(

( ) ( )

)

) ( ~ ~ ~m EHmHHm R ≡ (17) and

(

( ) ( )

)

) ( ~ ~m EHmHUm p ≡ . (18) The scaling factors are then given by

) ( , ) ( , 1 m s k X m s k C α σ ≡ (19) where σX2 is the average energy of the QPSK

subsymbols. ( ) ,

m s k

α are the components of αs(m).

Note that in practice, the statistical expectations in (17) and (18) can be replaced by averages over several OFDM symbols.

Note that in the proposed receiver, the channels are separately estimated for each antenna using over-sampled received signals. When M > S, it is straightforward to extend the proposed algorithm so that all channels are jointly estimated using chip-spaced (P = 1) received signal samples1.

1 Joint estimation using over-sampled received

signal is not considered in this paper due to its high complexity.

B. Frequency-Domain Linear Diversity Combining

After the final channel estimates are obtained, the received signals from each antenna are linearly combined in the frequency domain on a per-subcarrier basis in order to combat signal fading and cancel interference. The weightings for linear combination are obtained based on the final channel estimates and the MMSE criterion. Mathematically, assuming that user 0 is the desired user, the output of the linear combiner is an N-dimensional vector estimate of X0 that is

given by U W X H 0 0 ˆ = , (20) where

[

(0)T (M1)T

]

T = U U U L , (21)

and W0 is an MNP×N weighting matrix that

minimizes the MSE of each component of ˆX0.

It can be shown that W0 = R-1P, where

]

[ H

E UU

R= (22) and P is an MNP×N matrix obtained by stacking the first block column of Hˆ(0) to

) 1 (

ˆ M

H . IV. SIMULATION RESULTS

The performance of the proposed receiver algorithms is evaluated using computer simulation. User information bits are first encoded using a convolutional encoder and mapped onto N=64 QPSK subsymbols. NCP

is set to 16 and a 35% roll-off square-root raised cosine function is used for pulse shaping. The wireless channels have power-delay profiles following the Typical Urban (TU) channel models [10]. The receiver filters used in the simulations are also 35% roll-off square-root raised cosine filters. The carrier frequency is assumed to be 900 MHz. No frequency offset is assumed between the transmitter and the receiver. The maximum normalized Doppler frequency (defined as the maximum Doppler frequency normalized by the OFDM symbol period) is 0.025, which corresponds a vehicle speed of 40 km/h. Unless otherwise stated, the number of active users is fixed at S = 2.

The normalized mean-square error (NMSE), defined as

∑∑∑∑

∑∑∑∑

− = − = − = − = − = − = − = − = − ≡ 1 0 1 0 1 0 1 0 2 ) ( , , 1 0 1 0 1 0 1 0 2 ) ( , , ) ( , , ˆ M m S s P p L k m p s k M m S s P p L k m p s k m p s k H H H NMSE

,

(23)

of the proposed channel estimation algorithm and previous channel estimation algorithms are

(4)

shown in Fig. 2 for the TU channel with as functions of the number of observation symbols. Here the signal-to-interference ratio (SIR) is 10 dB and Eb/N0 is 20dB, where Eb is the energy

per transmitted bit and N0/2 is the two-sided

power spectral density of the AWGN. The over-sampling factor P=4 and number of receiver antennas M=2. It can be seen from Fig. 2 that the proposed method requires 100 OFDM symbols to achieve NMSE<0.1, while the conventional subspace approach with linear and quadratic constratins [8] need about 250 and 200 OFDM symbols, respectively.

The decoded bit error rate (BER) of the proposed receiver with over-sampling factor P = 4 and number of receiver antennas M = 2 is shown in Fig. 3(a) as functions of Eb/N0 and Fig.

3(b) as functions of SIR for the TU channel. In Fig. 3(a) SIR is fixed at 4 dB and in Fig. 3(b) Eb/N0 is fixed at 30 dB. The performance of

linear diversity combiners using the “perfect” channel estimates as well as channel estimates obtained using the conventional subspace approach with linear and quadratic constraints are also shown in this figure as baselines for comparison. It can be seen that the proposed receiver outperforms the conventional subspace approaches by 1 to 3 dB. This is because in the proposed approach, the initial channel estimates obtained using the subspace approach are appropriately scaled before being used to compute the weights for diversity combining.

In Fig. 4, the decoded BER of the proposed receiver with M = 3 is shown as functions of (a) Eb/N0 and (b) SIR for the TU

channel. An additional curve labeled as “joint channel estimation” is also shown in the figures. This curve is obtained by letting P = 1 and jointly estimating all channels as mentioned in Section III. Comparing Fig. 4 to Fig. 3, it can be seen that increasing the number of antennas from M = 2 to M = 3 achieves significant performance gain as expected. Furthermore, it can also be seen that when M > S, joint estimation can be performed instead of over-sampling, although separately estimating the channels for each antenna using P = 4 achieves better performance.

V. CONCLUSION

A receiver algorithm for OFDM with receiver diversity is proposed in this paper. The proposed receiver consists of the two-step subspace-MMSE blind channel estimator and a linear frequency-domain diversity combiner. The first step of the subspace-MMSE channel estimator uses a new multi-user generalization of the subspace-based blind channel estimator to obtain an initial time-domain channel

estimate. In the second step, the initial channel estimates are appropriately transformed and scaled to obtain the refined final frequency-domain channel estimates. The linear diversity combiner then computes the optimal (MMSE) combination weightings using the refined channel estimates. Simulation results show that performance gains of 1 – 3 dB is achievable over conventional subspace channel estimators.

REFERENCES

[1] R.V. Nee and R. Prasad, OFDM for Wireless Multimedia Communications, Artech House, 2000.

[2] J. C. Liberti and T. S. Rappaport, Smart Antennas for Wireless Communications: IS-95 and Third Generation CDMA Application, Prentice Hall, 1999.

[3] L.Tong, G. Xu, and T. Kailaith, “ Fast blind equalization via antenna arrays,” ICASSP-93, vol.4, pp. 272-275

[4] B. Muquet, M. de Courville, P. Duhamel and V. Buzenac, “A subspace based blind and semi-blind channel identification method for OFDM systems,” SPAWC '99, pp. 170–173

[5]C. Li and S. Roy, “A subspace blind channel estimation method for OFDM systems without cyclic prefix,” VTC 2001 Fall, vol.4, pp.2148-2152

[6]X. Cai and A.N. Akansu, “A subspace method for blind channel identification in OFDM systems,” ICC 2000, vol. 2 , pp. 929 –933

[7] P. Dent, G.E. Bottomley, and T. Croft, “Jakes fading model revisited,” Electronics Letters, vol.29, no.13, pp.1162-1163, June 1993.

[8] E. Moulines, P. Duhamel, J. F. Cardoso, and S. Mayrargue, “Subspace methods for the blind identification of multichannel FIR filters,” IEEE Trans. Signal Processing, vol.43, no.2, Feb. 1995, pp. 516-525

[9] A. Papoulis, Probability, Random Variables, and Stochastic Processes, 3rd Ed.,

McGraw-Hill, 1991.

[10] 3G TR 25.943: 3rd Generation Partnership Project; Technical Specification Group(TSG) RAN WG4; Deployment aspects.

[11] G. Xu, H. Liu, L. Tong, and T. Kailath, “A Least-Squares Approach to Blind Channel Identification,” IEEE Trans. On Signal Processing, Vol. 43, pp. 2982 – 2993, December 1995.

(5)

x0(t) u(0)(t)

:

: multi- user s conv. enc. S/P N-pt P/S Add q(.) xs(t) path AWGN 0

and QPSK IDFT CP : fading : channel xS-1(t) u(M-1)(t)

AWGN M-1

Transmitter and channel

un ,p(0 ) u(0 )(t) L P F rem o v e S /P N -p t k T /P C P D F T L in ea r F req u e n cy D eco d in g D o m a in an d D iv ersit y D et ect io n un ,p(M -1 ) C o m b in in g u(M -1 )(t) L P F rem o v e S /P N -p t k T /P C P D F T

tw o- ste p b lin d c h a n n e l e stim a tio n

su b sp a ce - b ased M M S E in itial sc alin g estim a tio n

Receiver Fig.1. A multi-user OFDM transmission system with receiver diversity.

0 0.1 0.2 0.3 0.4 0.5 0.6 0 50 100 150 200 250 300 350 400 Number of Observations NM SE subspace-linear constraint subspace-quadratic constraint proposed approach

Fig.2. The normalized mean square error (NMSE) as functions of the number of observation symbols.

1.E-06 1.E-05 1.E-04 1.E-03 1.E-02 1.E-01 1.E+00 5 10 15 20 25 Eb/No(dB) D

ecoded BER subspace-linear constraint

subspace-quadratic constraint proposed approach perfect channel estimate

(a) 1.E-06 1.E-05 1.E-04 1.E-03 1.E-02 1.E-01 1.E+00 5 10 15 20 25 SIR(dB) D ecoded BE R subspace-linear constraint subspace-quadratic constraint proposed approach perfect channel estimate

(b) Fig.3 (a) BER versus Eb/N0 and (b) BER versus SIR for TU channel.

1.E-06 1.E-05 1.E-04 1.E-03 1.E-02 1.E-01 1.E+00 5 10 15 20 25 Eb/No(dB) D ecoded BER subspace-linear constraint subspace-quadratic constraint joint channel estimation proposed approach perfect channel estimate

(a) 1.E-06 1.E-05 1.E-04 1.E-03 1.E-02 1.E-01 1.E+00 5 10 15 20 25 SIR(dB) D ecoded BE R subspace-linear constraint subspace-quadratic constraint joint channel estimation proposed approach perfect channel estimate

(b)

Fig.4. Comparison of the system performance for different channel estimation algorithms when M =3:

參考文獻

相關文件

He proposed a fixed point algorithm and a gradient projection method with constant step size based on the dual formulation of total variation.. These two algorithms soon became

The aim of the competition is to offer students a platform to express creatively through writing poetry in English. It also provides schools with a channel to

Step 1: With reference to the purpose and the rhetorical structure of the review genre (Stage 3), design a graphic organiser for the major sections and sub-sections of your

• Content demands – Awareness that in different countries the weather is different and we need to wear different clothes / also culture. impacts on the clothing

Guiding students to analyse the language features and the rhetorical structure of the text in relation to its purpose along the genre egg model for content

Wang, Solving pseudomonotone variational inequalities and pseudocon- vex optimization problems using the projection neural network, IEEE Transactions on Neural Networks 17

volume suppressed mass: (TeV) 2 /M P ∼ 10 −4 eV → mm range can be experimentally tested for any number of extra dimensions - Light U(1) gauge bosons: no derivative couplings. =&gt;

Define instead the imaginary.. potential, magnetic field, lattice…) Dirac-BdG Hamiltonian:. with small, and matrix