Abstract:
An improved OFDM receiver is realized by employing a simplified delay function for the transmissions channel. The simplified delay function yields a simplified frequency-domain correlation that is applied to develop an Eigen matrix U that is used in developing estimates of the channels. Those channel estimates are used in the receiver to develop the output signals.

Description:
RELATED APPLICATIONS 
     This application is a continuation of U.S. patent application Ser. No. 10/875,597, filed on Jun. 24, 2004, now U.S. Pat. No. 7,369,487, which is a continuation of U.S. patent application Ser. No. 09/535,945, filed Mar. 27, 2000, now U.S. Pat. No. 6,795,392, Sep. 21, 2004. 
    
    
     BACKGROUND OF THE INVENTION 
     This invention relates to channel estimation, and more particularly for channel estimation in clustered OFDM receivers. 
     Orthogonal frequency division multiplexing (OFDM) has been shown to be an effective technique for combating multipath fading and is, therefore, a promising technique for wideband wireless packet data. Recently, clustered OFDM has been proposed to provide in-band diversity gain with wideband dispersive fading channels and to thus improve system performance. 
     For clustered OFDM in high rate wireless data systems, each user accesses several OFDM clusters located at different frequencies. This is illustrated in  FIG. 1 , where a wideband OFDM signal is divided into many non-overlapped clusters of tones in frequency, and each user accesses several clusters of tones. For example, in the  FIG. 1  arrangement User  1  utilizes the first, fifth, ninth, and thirteenth clusters; and Users  2 ,  3 , and  4  use other clusters. In a transmitter, an error correction code such as a Reed-Solomon code or a convolutional code is used to create frequency diversity. Without channel information, differential demodulation has to be used instead of coherent demodulation, suffering a 3-4 dB loss in signal-to-noise ratio (SNR) performance. This is demonstrated in an article by Y. (Geoffrey) Li, L. J. Cimini, Jr., and N. R. Sollenberger, titled “Robust channel estimation for OFDM systems with rapid dispersive fading Channels,”  IEEE Trans. On Comm ., vol. 46, pp. 902-915, July 1998, which is hereby incorporated by reference. This reference indicates that channel estimation is desired for clustered OFDM to achieve high performance. 
     For classical OFDM systems, either pilot-symbol-aided or decision-directed channel estimators are used to obtain information. Similar parameter estimators are used to estimate the coefficients for the minimum-mean-square error diversity combiner (MMSE-DC) for OFDM systems with antenna arrays to suppress co-channel interference, or to estimate channel information required by the decoder of space-time code based transmitter diversity. 
     Prior art has shown that the optimum transform for channel estimation is the eigen matrix of the channel frequency-domain correlation matrix. Obviously, the optimum transforms depend on the channel delay profiles that vary with environments. Since there may be over a hundred contiguous tones for classical OFDM systems, the discrete Fourier transform (DFT) can be used instead of the optimum transforms, with negligible edge effects. Unfortunately, in clustered OFDM, each cluster contains many fewer tones than in classical OFDM, and those tones that are on the edge of a cluster constitute a large portion of the total number of tones in each cluster. Consequently, edge effects are unsatisfactorily large if a DFT is used for the estimator in clustered OFDM. 
     SUMMARY 
     An OFDM receiver is realized by applying incoming signals that arrive at one or more antennas, over respective transmission channels, to respective FFT elements, filtering the outputs of the FFT elements, combining the filtered signals, and applying the combined signal to a threshold element. The filter parameters are developed from channel estimates based on the signals developed by the FFT elements and the output of the threshold element, exploiting the channels&#39; frequency correction both in time and frequency domain. The optimum channels estimator requires use of the eigen matrix of the channel&#39;s frequency-domain correlation matrix, which depends on the channels&#39; delay profiles. In accordance with the principles disclosed herein, a simpler realization is obtained by employing a simple estimate of the delay profile, such a rectangular profile, or exponential delay profile. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  describes clustered OFDM; 
         FIG. 2  depicts a block diagram of a receiver in accordance with the principles of this invention; 
         FIG. 3  shows the processing performed in AU block  33  of  FIG. 2 ; and 
         FIG. 4  presents a geometric explanation of the principles disclosed herein. 
     
    
    
     DETAILED DESCRIPTION 
     An OFDM signal is constructed in a transmitter by taking blocks of symbols and applying the blocks to an inverse FFT process. The signal is then transmitted, where it passes through a wireless channel before the receiver&#39;s antennas receive it. 
     The complex baseband representation of a wireless channel impulse response can be described by 
                       h   ⁡     (     t   ,   τ     )       =       ∑   k     ⁢         γ   k     ⁡     (   t   )       ⁢     δ   ⁡     (     τ   -     τ   k       )             ,           (   1   )               
where τ k  is the delay of the k th  path, and γ k (t) is the corresponding complex amplitude. Aside from the normal time variations in the communication channel between a transmitter and a receiver, when the receiver is mobile, the movement of the mobile unit adds a variation to the communication environment. When the mobile is moving rapidly, such as when in a moving car, the communication environment, correspondingly, changes rapidly. Thus, the γ k (t)&#39;s can be viewed to be wide-sense stationary (WSS), narrow-band, complex Gaussian processes with average power σ k   2 &#39;s, where the different σ&#39;s are independent of each other.
 
     The frequency response at time t of the time-varying wireless channel described by Equation (1) is 
                     H   ⁡     (     t   ,   f     )       =         ∫     -   ∞     ∞     ⁢       h   ⁡     (     t   ,   τ     )       ⁢     ⅇ       -   j2π     ⁢           ⁢   f   ⁢           ⁢   τ       ⁢     ⅆ   τ         =       ∑   k     ⁢         γ   k     ⁡     (   t   )       ⁢       ⅇ       -   j2π     ⁢           ⁢   f   ⁢           ⁢     τ   k         .                   (   2   )               
The correlation function, at different times and frequencies, that corresponds to Equation (2) can be expressed as
 
 r   H (Δ t,Δf )= E{H ( t+Δt,f+Δf ) H* ( t,f )}.  (3)
 
It can be shown that r H (Δt,Δf) can also be expressed by
 
 r   H (Δ t,Δf )=σ h   2   r   t (Δ t ) r   f (Δ f ),  (4)
 
where σ h   2  is the total average power of the channel impulse response, defined as
 
                 σ   h   2     =       ∑   k     ⁢     σ   k   2         ,         
and the terms r t (Δt) and r f (Δf) are the time-domain and frequency-domain correlations of the channel frequency response, defined as
 
                         r   t     ⁡     (     Δ   ⁢           ⁢   t     )       =       E   ⁢     {         γ   k     ⁡     (     t   +     Δ   ⁢           ⁢   t       )       ⁢       γ   k   *     ⁡     (   t   )         }         E   ⁢     {              γ   k   *     ⁡     (   t   )            2     }           ,     
     ⁢   and           (   5   )                     r   f     ⁡     (     Δ   ⁢           ⁢   f     )       =       1     σ   h   2       ⁢       ∑   k     ⁢       σ   k   2     ⁢     ⅇ       -   j2πΔ     ⁢           ⁢   f   ⁢           ⁢     τ   t                 ,           (   6   )               
respectively.
 
     A block diagram of a receiver in accordance with the principles disclosed herein is shown in  FIG. 2 . As depicted, it contains two receiving antennas, but it should be understood that the arrangement could have one antenna or many antennas. An OFDM signal generated elsewhere by a transmitter is received at antenna  11  and is applied to FFT  12 . The output signal of FFT  12  y[1,n,k] corresponds to a n,k H[1,n,k]+W 1,n,k , where a n,k  is the signal encoded in the transmitter with an inverse FFT process at time n, with OFDM tone k, H[1,n,k] corresponds to the transfer function of the channel between the transmitting antenna and receiving antenna  11 , and W 1,n,k  is the noise received at antenna  11 . The output signal of FFT  12  is applied to filter  13 , which develops the signal y[1,n,k]Ĥ*[1,n,k], where Ĥ[1,n,k] is an estimate of the channel H[1,n,k], obtained from estimation augmentation (AU) block  33 . Similarly, an OFDM signal is received at antenna  21  and is applied to FFT  22 . The output signal of FFT  22 , y[2,n,k], is applied to filter  23 , which is responsive to signal Ĥ[2,n,k] from AU block  33 . The output signals of filters  13  and  23  are combined in element  30  and applied to decision block  31 . The output signal of decision block  31  is the decoded output signal, ā[n,k], and that signal is applied to estimator block  32 . The output of estimator block  32 , which is a collection of initial channel estimates, {tilde over (H)}[i,n,k], where, as before, i refers to the antenna (i=1,2, . . . m), n refers to time, and k refers to the OFDM tones (k=1,2, . . . K). This signal is applied to AU block  33 , where augmented channel estimates Ĥ[i,n,k] are developed, as disclosed below. 
     It should be noted that during a training sequence, the signals received at antennas  11  and  21  that are applied to FFT elements  12  and  22 , respectively, and to filters  13  and  23 , respectively, interact with a signal from AU block  33  that results from application of the training signal to estimator block  32 , rather than from application of the output signal of element  31 . It should also be noted that elements  12 ,  22 ,  13 ,  23 ,  31 , and  32  are well-known, conventional, elements. 
     With respect to each antenna i, estimator  32  develops a set of estimates that can be expressed in terms of a vector 
                       H   ~     ⁡     [     n   ,   k     ]       =       [             H   ~     ⁡     [     n   ,   1     ]               ⋮               H   ~     ⁡     [     n   ,   K     ]             ]     =       [             y   ⁡     [     n   ,   1     ]       ·         a   _     *     ⁡     [     n   ,   1     ]                 ⋮               y   ⁡     [     n   ,   K     ]       ·         a   _     *     ⁡     [     n   ,   K     ]               ]     .               (   7   )               
AU element  33  processes the elements of each such vector (i.e., separately for each receiving antenna) as shown in  FIG. 3 . It exploits the above-described channel&#39;s frequency correlations in both time and frequency domain. The unitary transform U exploits the frequency-domain correlations, while the linear filters Φ(k) makes full use of the time-domain correlation, where
 
                 Φ   l     ⁡     (   k   )       =     1   -     1         M   l     ⁡     (     -   k     )       ⁢       γ   l     ⁡     [   0   ]                   
and M 1 (k) is a stable one-sided Fourier transform
 
     
       
         
           
             
               ∑ 
               
                 n 
                 = 
                 0 
               
               ∞ 
             
             ⁢ 
             
               
                 
                   γ 
                   l 
                 
                 ⁡ 
                 
                   [ 
                   n 
                   ] 
                 
               
               ⁢ 
               
                 
                   ⅇ 
                   
                     
                       - 
                       j 
                     
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     nk 
                   
                 
                 . 
               
             
           
         
       
     
     More specifically,  FIG. 3  depicts a processing that is performed on the signal developed by estimator block  32 , computing a subset of the matrix product U H {tilde over (H)} in element  41 , multiplying the subset results by Φ(k) in elements  42  and  43 , and then multiplying the result by the transform U in element  44  (where the {tilde over (H)} is the {tilde over (H)}[n,k] of equation (7), and U H  is the Hermetian of U H ). 
       FIG. 3  shows only two filters Φ(k) being employed, to illustrate the fact that some delay paths are weak enough that a computation, should it be carried out, would carry a relatively large noise component and a small signal component. In such circumstances, there is an insufficient benefit to bother with the computational burden and, accordingly, less that a full set of K filters can be employed (K/4 will typically suffice). Thus, for example, in  FIG. 3  only two filters are employed, yielding 
                       [             H   ^     ⁡     [     n   ,   1     ]                   H   ^     ⁡     [     n   ,   2     ]             ]     =     [             ∑     l   =   1     2     ⁢       (         u   11     ⁢     u     t   ⁢           ⁢   1     *       +       u   12     ⁢     u     t   ⁢           ⁢   2     *         )     ·       ∑     m   =     -   ∞       0     ⁢         Φ   1     ⁡     (   m   )       ⁢       H   ~     ⁡     [       k   -   m     ,   l     ]                           ∑     l   =   1     2     ⁢       (         u   21     ⁢     u     l   ⁢           ⁢   1     *       +       u   22     ⁢     u     l   ⁢           ⁢   2     *         )     ·       ∑     m   =     -   ∞       0     ⁢         Φ   2     ⁡     (   m   )       ⁢       H   ~     ⁡     [     k   ,     m   -   1       ]                     ]       ,           (   8   )               
which can be generalized to:
 
     
       
         
           
             
               
                 
                   
                     [ 
                     
                       
                         
                           
                             
                               H 
                               ^ 
                             
                             ⁡ 
                             
                               [ 
                               
                                 n 
                                 , 
                                 1 
                               
                               ] 
                             
                           
                         
                       
                       
                         
                           
                             
                               H 
                               ^ 
                             
                             ⁡ 
                             
                               [ 
                               
                                 n 
                                 , 
                                 2 
                               
                               ] 
                             
                           
                         
                       
                       
                         
                           ⋮ 
                         
                       
                       
                         
                           
                             
                               H 
                               ^ 
                             
                             ⁡ 
                             
                               [ 
                               
                                 n 
                                 , 
                                 K 
                               
                               ] 
                             
                           
                         
                       
                     
                     ] 
                   
                   = 
                   
                     
                       [ 
                       
                         
                           
                             
                               
                                 ∑ 
                                 
                                   l 
                                   = 
                                   1 
                                 
                                 K 
                               
                               ⁢ 
                               
                                 
                                   ( 
                                   
                                     
                                       
                                         u 
                                         11 
                                       
                                       ⁢ 
                                       
                                         u 
                                         
                                           l 
                                           ⁢ 
                                           
                                               
                                           
                                           ⁢ 
                                           1 
                                         
                                         * 
                                       
                                     
                                     + 
                                     
                                       
                                         u 
                                         12 
                                       
                                       ⁢ 
                                       
                                         u 
                                         12 
                                         * 
                                       
                                     
                                   
                                   ) 
                                 
                                 · 
                                 
                                   
                                     ∑ 
                                     
                                       m 
                                       = 
                                       
                                         - 
                                         ∞ 
                                       
                                     
                                     0 
                                   
                                   ⁢ 
                                   
                                     
                                       
                                         Φ 
                                         1 
                                       
                                       ⁡ 
                                       
                                         ( 
                                         m 
                                         ) 
                                       
                                     
                                     ⁢ 
                                     
                                       
                                         H 
                                         ~ 
                                       
                                       ⁡ 
                                       
                                         [ 
                                         
                                           
                                             k 
                                             - 
                                             m 
                                           
                                           , 
                                           l 
                                         
                                         ] 
                                       
                                     
                                   
                                 
                               
                             
                           
                         
                         
                           
                             
                               
                                 ∑ 
                                 
                                   l 
                                   = 
                                   1 
                                 
                                 K 
                               
                               ⁢ 
                               
                                 
                                   ( 
                                   
                                     
                                       
                                         u 
                                         21 
                                       
                                       ⁢ 
                                       
                                         u 
                                         
                                           l 
                                           ⁢ 
                                           
                                               
                                           
                                           ⁢ 
                                           1 
                                         
                                         * 
                                       
                                     
                                     + 
                                     
                                       
                                         u 
                                         22 
                                       
                                       ⁢ 
                                       
                                         u 
                                         
                                           l 
                                           ⁢ 
                                           
                                               
                                           
                                           ⁢ 
                                           2 
                                         
                                         * 
                                       
                                     
                                   
                                   ) 
                                 
                                 · 
                                 
                                   
                                     ∑ 
                                     
                                       m 
                                       = 
                                       
                                         - 
                                         ∞ 
                                       
                                     
                                     0 
                                   
                                   ⁢ 
                                   
                                     
                                       
                                         Φ 
                                         2 
                                       
                                       ⁡ 
                                       
                                         ( 
                                         m 
                                         ) 
                                       
                                     
                                     ⁢ 
                                     
                                       
                                         H 
                                         ~ 
                                       
                                       ⁡ 
                                       
                                         [ 
                                         
                                           
                                             k 
                                             - 
                                             m 
                                           
                                           , 
                                           l 
                                         
                                         ] 
                                       
                                     
                                   
                                 
                               
                             
                           
                         
                         
                           
                             ⋮ 
                           
                         
                         
                           
                             
                               
                                 ∑ 
                                 
                                   l 
                                   = 
                                   1 
                                 
                                 K 
                               
                               ⁢ 
                               
                                 
                                   ( 
                                   
                                     
                                       
                                         u 
                                         K 
                                       
                                       ⁢ 
                                       
                                         u 
                                         
                                           l 
                                           ⁢ 
                                           
                                               
                                           
                                           ⁢ 
                                           1 
                                         
                                         * 
                                       
                                     
                                     + 
                                     
                                       
                                         u 
                                         
                                           K 
                                           ⁢ 
                                           
                                               
                                           
                                           ⁢ 
                                           2 
                                         
                                       
                                       ⁢ 
                                       
                                         u 
                                         
                                           l 
                                           ⁢ 
                                           
                                               
                                           
                                           ⁢ 
                                           2 
                                         
                                         * 
                                       
                                     
                                   
                                   ) 
                                 
                                 · 
                                 
                                   
                                     ∑ 
                                     
                                       m 
                                       = 
                                       
                                         - 
                                         ∞ 
                                       
                                     
                                     0 
                                   
                                   ⁢ 
                                   
                                     
                                       
                                         Φ 
                                         K 
                                       
                                       ⁡ 
                                       
                                         ( 
                                         m 
                                         ) 
                                       
                                     
                                     ⁢ 
                                     
                                       
                                         H 
                                         ~ 
                                       
                                       ⁡ 
                                       
                                         [ 
                                         
                                           
                                             k 
                                             - 
                                             m 
                                           
                                           , 
                                           l 
                                         
                                         ] 
                                       
                                     
                                   
                                 
                               
                             
                           
                         
                       
                       ] 
                     
                     . 
                   
                 
               
               
                 
                   ( 
                   
                     8 
                     ⁢ 
                     a 
                   
                   ) 
                 
               
             
           
         
       
     
     It can be shown that optimum transform matrix to be used in the  FIG. 2  arrangement, U opt , is the eigen matrix of the channel&#39;s frequency-domain correlation matrix, R f , which is defined as 
                     R   f     =       [             r   f     ⁡     [   0   ]               r   f     ⁡     [     -   1     ]           …           r   f     ⁡     [     1   -   K     ]                   r   f     ⁡     [   1   ]               r   f     ⁡     [   0   ]           …           r   f     ⁡     [     2   -   K     ]               ⋮       ⋮       ⋱       ⋮               r   f     ⁡     [     K   -   1     ]               r   f     ⁡     [     K   -   2     ]           …           r   f     ⁡     [   0   ]             ]     .             (   9   )               
That is,
 
R f U opt =U opt D,  (10)
 
where D is a diagonal matrix. The channel&#39;s frequency-domain correlation depends on delay profiles that are different for different environments. Therefore, the optimum transforms or bases for estimators are very difficult to obtain; particularly in a changing environment that is sometimes associated with cellular telephony (e.g., when the cell phone is used in a car).
 
     For classical OFDM, it has been demonstrated that, with negligible performance degradation, the unitary transform can be substituted by the DFT; that is, 
                     U   DFT     =       1     K       ⁢         (     exp   ⁡     (     j2π   ⁢           ⁢         k   1     -     k   2       K       )       )         k   1     ,       k   2     =   1       K     .               (   11   )               
However, for clustered OFDM with small clusters, the tones that are on edge are a large portion of the tones per cluster. Therefore, as indicated above, the edge effects would cause a significant performance degradation if the DFT is used in the estimator.
 
     Although generally the delay profiles of a particular environment are not initially known, some reasonable profiles can be created that lead to transforms that perform quite well. 
     The simplest delay profile that provides good results is a rectangular profile, which can be expressed as 
                       σ   rec     ⁡     (   τ   )       =     {             1     2   ⁢     τ   max         ,             if   ⁢           ⁢        τ          ≤     τ   max                 0   ,         otherwise                   (   12   )               
where τ max  is half of the maximum delay span. The delay spread of the rectangular delay profile is τ=τ max /√{square root over (3)}. The frequency-domain correlation function can be obtained by
 
                       r   rec     ⁡     (     Δ   ⁢           ⁢   f     )       =         ∫     -     τ   max         τ   max       ⁢         σ   rec     ⁡     (   t   )       ⁢     ⅇ       -   j2πΔ     ⁢           ⁢   f   ⁢           ⁢   τ       ⁢     ⅆ   τ         =         sin   ⁡     (     2   ⁢   πΔ   ⁢           ⁢   f   ⁢           ⁢     τ   max       )         2   ⁢   πΔ   ⁢           ⁢   f   ⁢           ⁢     τ   max         .               (   13   )               
Based on r rec (Δf), the optimum transform for the rectangular profile, U rec , can be obtained by the means of eigen-decomposition, which is a well known technique.
 
     Thus, by using equation (13), the various elements in the R f  matrix are computed, and once the matrix is known, employing the eigen-decomposition technique provides the matrix U rec . 
     Another profile that provides good results is the exponential delay profile, which is defined as 
                       σ   exp     ⁡     (   τ   )       =     {               1     τ   _       ⁢     ⅇ     -       τ   +     τ   _       τ           ,             if   ⁢           ⁢        τ          ≥     -     τ   _                   0   ,         otherwise                   (   14   )               
where  τ  is the delay spread. Then, the frequency-domain correlation function is
 
                       r   exp     ⁡     (     Δ   ⁢           ⁢   f     )       =         ∫     -     τ   max         τ   max       ⁢         σ   exp     ⁡     (   t   )       ⁢     ⅇ       -   j2πΔ     ⁢           ⁢   f   ⁢           ⁢   τ       ⁢     ⅆ   τ         =         ⅇ     j2πΔ   ⁢           ⁢   f   ⁢           ⁢     τ   _             j2πΔ   ⁢           ⁢   f   ⁢           ⁢     τ   _       +   1       .               (   15   )               
Based on it, U exp , can be obtained in the manner analogous to the one described above.
 
     It has been demonstrated experimentally that U rec  and U exp , which we call the rectangular and exponential transforms, respectively, are robust to other channel delay profiles. This robustness can be appreciated by viewing  FIG. 4 . Since each delay profile is specified by the average power of each path and delay, an ellipse can represent the average power in the different directions. For example, in  FIG. 4 , the average power on each direction for delay profile I can be shown by the solid ellipse with eignvectors v 1 , v 2 . For each outcome of delay profile I, the channel parameters can be represented by α 1 v 1 +α 2 v 2 , where α 1  and α 2  are time varying for a time-varying channel. It can be observed that E|α 1 | 2  is much larger than E|α 2 | 2  for delay profile I. Hence, α 1 v 1  alone is a good approximation of the channel information. Note that v 1  and v 2  can still be used to decompose other delay profiles, such as profile II. But, the error will be very large if α 1 v 1  alone is used for the approximation. Therefore, the optimum decomposition transform for one delay profile is not necessarily optimum for another delay profile. Consequently, it is desired to have a decomposition transform that has good, not necessarily the best, performance for all expected delay profiles with certain constrains. The (u 1 ,u 2 ) transform in the figure is such a robust transform, just like U rec  or U exp , disclosed above.