ICALMAN FILTER FOR CHANNEL ESTIMATION IN OFDM SYSTEMS

BACKGROUND AND SUMMARY OF THE DISCLOSURE

[0001] The general field is a Kalman filter and more specifically an application of

Kalman filtering algorithm in an OFDM based communication system.

[0002] Orthogonal Frequency Division Multiplexing OFDM has been widely applied in wireless communication systems such as DVB-T/H, 802.1 Ix wireless LAN and 802.16 wireless MAN due to its high bandwidth efficiency and robustness to multipath fading. Due to the fact that the wideband wireless channel is frequency selective and time varying, channel estimation must be performed continuously and the received OFDM subcarriers must be corrected by the estimated CTFs. Figure 1 shows a generic OFDM receiver.

[0003] In DVB systems, channel estimation is performed by inserting known scattered pilots at predefined subcarrier locations in each OFDM symbol (see ETSI EN 300 744 V.1.4.1 "Digital Video Broadcasting (DVB): Framing Structures, channel coding, and modulation for digital terrestrial television"), normally referred to as "comb-type" pilot channel estimation.

[0004] Figure 2 shows the scattered pilots insertion in DVB-T transmitters. The PPS pilots and the continual pilots are not shown for sake of clarity. The comb-type channel estimation consists of algorithms to first estimate the channel transfer functions at the pilot locations and then to interpolate the channel transfer function in time and frequency domain to get the channel estimates for all the OFDM subcarrier locations.

[0005] As shown in Figure 2, in comb-type pilot based channel estimation the ^ scattered pilots are inserted uniformly into the OFDM spectrum according to the following rules: [0006] For the symbol of index ^l (ranging from 0 to 67), carriers for which index k belongs to the subset i ^{k =z K} _mm +3x (/ mod 4) + 12/? | p = int, p ≥ 0,k e [K _mm ,K _m J} _are scattered pilots. [0007] Where ^p is an integer that takes all possible values greater than or equal to zero, provided that the resulting value for k does not exceed the valid range

[0008] Assume that for current symbol of index /, the N ₅ inserted scattered pilots according to the above rule are: X^s = 0,1,...N -1 , the corresponding received

subcarriers at the scattered pilot locations are: Y _x , s = O,1,...N -1 , the channel frequency response at the pilot subcarrier locations can be represented as: H _x , s = 0,1,... N -I ₅ then the Least-Square estimate of the channel frequency response at the pilot subcarrier

locations is given by: ^H " =-^' ^{s = o} >h- ^N , ^{- 1}

[0009] The above LS estimation is sensitive to noise and ICI, MMSE estimation is known to provide better performance than LS estimation. However, MMSE estimation requires matrix inversion at each iteration, thus not practical for implementation.

[00010] In this disclosure, a simplified Kalman filter is provided which reduces the noise effects of the LS estimation. Simulation shows that the simplified Kalman filter is very effective in removing the noise effects, and the overall system performance will be improved by up to 2dB.

[00011] A scalar Kalman filter is applied for a Least-Square estimated value H _s at s.

The filter has an input for receiving H _s , a filter equation and an output for the corrected estimated value H/ for the Jc" ¹ variable. The filter equation is H/ = K _gain S _n [k] wherein: correction S _n [k] = S + K _n ( H ₃ -S); prediction of the correction S = K _a S _n [K]; Kalman filter gain K _n = P Z ( I + P); minimum predication MSE P = K _a ² P _n [Jc] + K _b ; minimum MSE P _n [Ic] = P ( I - K _n ); and K _{a s} K _gam and K _b are constants.

[00012] A receiver includes an OFDM demodulator, a channel corrector and a channel estimator; and wherein the channel estimator is a Least-Square estimator of a channel frequency response H ₈ of a subcarrier k. The channel estimator includes the simplified Kalman filter. The constants K _gam , K _a and K _b may be selected as a function of the modulation mode of the subcarrier. The channel estimator processes scattered pilots whose locations s repeats its pattern every r symbols; and the channel estimator includes r *N _S Kalman filters.

[00013] The filter gain K _n may also be a constant selected as a function of the modulation mode of the subcarrier. The filter equation is performed in software.

[00014] These and other aspects of the present disclosure will become apparent from the following detailed description of the disclosure, when considered in conjunction with accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[00015] Figure 1 is a block diagram of an Orthogonal Frequency Division Multiplexing

(OFDM) receiver, according to the prior art.

[00016] Figure 2 is a diagram of scattered pilot plots insertion locations in DVB-T transmitters.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[00017] In the proposed channel estimation algorithm, for the current OFDM symbol of index ^l (ranging from 0 to 67), the Least-Square estimate of the channel frequency

response at the pilot subcarrier locations ^{s = ~} Jc ^~ ' ^{lϊ = 0} ' ¹ '--^, ^~ ^ can be further processed by individual Kalman smoothing filters to reduce the noise and ICI effects before the LS estimate is used in time / frequency domain interpolation.

[00018] Since the scattered pilot location repeats its pattern every 4 ^th symbol, there will be a total ofW _, > _mod4 + N _5i(/+l)mod4 + N, ?,(/+2)mod4 +N, ι,(/+3)mod4 ) individual Kalman filters. If a different repeat pattern is used, the number of Kalman filters would match the repeat pattern.

[00019] The general form of a scalar Kalman filter is described in the following equations (see "Fundamentals of Statistical Signal Processing Estimation Theory," Steven M. Kay, PTR Prentice-Hall, Inc., 1993).

λ λ

[00020] Prediction: First order Markov process: s[n \ n - 1] = a s[n - 11 n - 1] [00021] Minimum prediction MSE: P[n\ n-l] = a ² P[n-\ \ «-l]+σ _H ²

P[n\ n~\]

[00022] Kalman Gain: ^"1 = σ _n ² +P[n\ n- \]

[00023] Correction: ^s & \ n] = s[n \ n-\] + n - 1] | _{Where x} [ _n ] _{is me} input data at the n ^th iteration

[00024] Minimum MSE: P[n | n] = (l - K[n])p[n \ n-\]

[00025] The simplifying assumptions of the present design are: [00026] all the scattered pilots are supposed to be uncorrelated, characterized by the first order Markov process;

[00027] the measurement noise variance ^σ « is supposed to be the same for all carriers;

[00028] the signal noise variance ^σ « is supposed to be the same for all carriers; and [00029] from the previous assumptions since the Kalman gain converges to a constant after a few iterations, it will be assumed to be a constant.

[00030] Based on the simplifying assumptions, every pilot carrier will be filtered independently by a scalar Kalman filter. The scalar Kalman filter equations, for the

k"' Kalman filter, corresponding to the scattered pilot located at the k' ^h subcarrier, become:

[00031] S = K ₀ S _n [Ic]

[00032] P = K _a ² P _n [k]+K _b

[00033] K _H ~

[00034] S _n [k] = S + K _U (HS - S

[00035] P _n [/c] = p(i -K _n )

[00036] H* = κ _gain s _n [k]

[00037] Where the filtering will take place on symbol bases.

[00038] {/c = ^ _min +3x (/mod 4) + 12^ | p = int,p > 0,A: _e [^ _min ;ϋ: _niax ]} . r rk

[00039] Hs is the LS estimate on the scattered pilot location ^s , and ^H s is the Kalman filter smoothed output of H., . [00040] In the above equations, ^K a , ^K h and ^- ≠« are constants and the calculation of

Kalman gain factor ^ requires divisions. It is found that ^n will converge to its steady state value over a few OFDM symbols. In order to simplify the implementation, ^« is also set as a constant. The above constants can be set by evaluating the performance in various multipath fading channels and noise conditions. It has also been found that one may set the Kalman constants differently for different modulation modes, such as QPSK, 16 QAM and 64 QAM to achieve better smoothing performance. In a preferred embodiment, the Kalman filter constants are set according to the modulation mode whenever a valid tps frame is decoded.

[00041] Although the present disclosure has been described and illustrated in detail, it is to be clearly understood that this is done by way of illustration and example only and is not to be taken by way of limitation. The scope of the present disclosure is to be limited only by the terms of the appended claims.