Abstract:
A method for channel estimation of a signal, comprises the steps: estimating a channel response for pilot carriers of the signal; and estimating a channel response for non-pilot carriers of the signal as a function of the channel response for the pilot carriers of the signal and channel estimation coefficients for the pilot carriers, wherein a symbol of the signal is decoded as a function of the estimated channel response for the non-pilot carriers, and wherein certain ones of the channel estimation coefficients are updated as a function of the decoded symbol.

Description:
FIELD OF INVENTION 
       [0001]    This invention relates to methods for channel estimation of orthogonal frequency divisional multiplexing modulation signals, and, in particular, to methods for channel estimation using the scattered pilots of the signals. 
       BACKGROUND 
       [0002]    Orthogonal frequency division multiplexing (“OFDM”) is a multi-carrier transmission technique that uses orthogonal subcarriers to transmit information within an available spectrum. Since the subcarriers are orthogonal to one another, they may be spaced much more closely together within the available spectrum than, for example, the individual channels in a conventional frequency division multiplexing (“FDM”) system. 
         [0003]    In an OFDM system, the subcarriers may be modulated with a low-rate data stream before transmission. It is advantageous to transmit a number of low-rate data streams in parallel instead of a single high-rate stream since low symbol rate schemes suffer less from inter-symbol interference (“ISI”) caused by multipath fading. For this reason, many modern digital communications systems are turning to OFDM as a modulation scheme for signals that need to survive in environments having multipath or strong interference. Many transmission standards have already adopted the OFDM system, including the IEEE 802.11a standard, the Digital Video Broadcasting Terrestrial (“DVB-T”), the Digital Audio Broadcast (“DAB”), and the Digital Television Broadcast (“T-DMB”). 
         [0004]    At the transmitter side for OFDM signals, the data is encoded, interleaved, and modulated to form data symbols. Overhead information is added, such as pilot symbols. The symbols (data plus overhead) are organized into OFDM symbols. Each symbol is allocated to represent a component of a different orthogonal frequency. An inverse fast Fourier transform (“IFFT”) is applied to the OFDM symbol to generate time samples. Cyclic extensions are then added to the signal and passed through a digital-to-analog converter. Finally, the transmitter transmits the signal to a receiver through a channel (e.g., over the air). 
         [0005]    When the receiver receives the signal, the inverse operations are performed on the received signal. The received signal is passed through to an analog-to-digital converter. Also, any cyclic extensions are removed from the signal. The receiver performs a FFT on the received signal to recover the frequency components of the signal, i.e., the data symbols. Error correction may be applied to the data symbols to compensate for variations in phase and amplitude caused during the propagation of the signal along the channel. The data symbols are then demodulated, de-interleaved, and decoded, to yield the transmitted data. 
         [0006]    The variations in phase and amplitude resulting from propagation along the channel are referred to as the channel response. The channel response is usually frequency and time dependent. If the receiver can determine the channel response, the received signal can be corrected to compensate for the channel degradation. The determination of the channel response is called channel estimation. The inclusion of pilot symbols in each OFDM symbol and/or in each subcarrier allows the receiver to carry out channel estimation. The pilot symbols are transmitted with a value known to the receiver. When the receiver receives the OFDM symbol, the receiver compares the received value of the pilot symbols with the known transmitted value of the pilot symbols to estimate the channel response. 
         [0007]    Since the channel response can vary with time and with frequency, the pilot symbols are scattered amongst the data symbols to provide as complete a range as possible of channel response over time and frequency. The set of frequencies and times at which pilot symbols are inserted is referred to as a pilot pattern.  FIG. 1  illustrates a pilot distribution pattern of the DVB-T system. Referring to  FIG. 1 , the pilot symbols are scattered amongst the data carrier symbols along the time domain (y-axis) and the frequency domain (x-axis) forming a grid to enable two-dimensional interpolation. The solid black circles represent the pilot symbols, and the empty circles represent the data carrier symbols. The variable K represents the number of subcarriers in the frequency domain. As an example, for DVB-T systems, in the 2K mode, there are a total of 1705 subcarriers; and in the 8K mode there are a total of 6817 subcarriers. 
         [0008]      FIG. 2  illustrates a flow chart of the prior art for channel estimation. The channel transfer function H(m,n) at the pilot cells is computed  40  as a function of the FFT output of the signal. Next, time-domain interpolation  42  is applied, providing time-domain interpolator coefficients. The output of that time domain interpolation is inputted to a frequency domain interpolation  44 . The frequency-domain interpolation  44  computes the channel transfer function estimates at all non-pilot tones. After frequency-domain interpolation, the estimates of all the transfer functions at all the data carriers are available either through frequency-domain interpolation for all the non-pilot tones or the time-domain interpolator for the non-pilot cells of all the scattered pilot tones. The channel estimation results can be sent to error correction and/or further processing of the received signal. 
         [0009]    This prior art method takes advantage of the scattered pilot position. Interpolation in the time domain is performed first to increase the available carriers for interpolation in frequency domain. As such, this method is suitable for a static environment, where carrier statistics do not change between several symbols in time. However, such method is not suitable for a mobile environment, where the carrier statistics can change significantly, even within a span of a few symbols. Therefore, it is desirable to provide new methods for channel estimation that are suitable for a mobile environment, as well as static environments. 
       SUMMARY OF INVENTION 
       [0010]    An object of this invention is to provide methods for channel estimation of signals that are suitable for dynamic environments. 
         [0011]    Another object of this invention is to provide methods for channel estimation using a two dimensional adaptive interpolation filter. 
         [0012]    Yet another object of this invention is to provide methods for channel estimation that use dynamic coefficients to track channel variations in both the frequency domain and the time domain. 
         [0013]    Briefly, the present invention relates to a method for channel estimation of a signal, comprising the steps: estimating a channel response for pilot carriers of the signal; and estimating a channel response for non-pilot carriers of the signal as a function of the channel response for the pilot carriers of the signal and channel estimation coefficients for the pilot carriers, wherein a symbol of the signal is decoded as a function of the estimated channel response for the non-pilot carriers, and wherein certain ones of the channel estimation coefficients are updated as a function of the decoded symbol. 
         [0014]    An advantage of this invention is that methods for channel estimation of signals are provided that are suitable for dynamic environments. 
         [0015]    Another advantage of this invention is that methods for channel estimation are provided using a two dimensional adaptive interpolation filter. 
         [0016]    Yet another advantage of this invention is that methods for channel estimation are provided that use dynamic coefficients to track channel variations in both the frequency domain and the time domain. 
     
    
     
       DESCRIPTION OF THE DRAWINGS 
         [0017]    The foregoing and other objects, aspects, and advantages of the invention will be better understood from the following detailed description of the preferred embodiment of the invention when taken in conjunction with the accompanying drawings in which: 
           [0018]      FIG. 1  illustrates a pilot distribution pattern of the DVB-T system. 
           [0019]      FIG. 2  illustrates a prior art method for channel estimation using a two-step interpolation process. 
           [0020]      FIG. 3  illustrates a method of the present invention for channel estimation. 
           [0021]      FIGS. 4   a - 4   c  illustrate a pilot pattern of a signal. 
           [0022]      FIG. 5  illustrates outer corner points of a 16 QAM constellation for use in updating channel estimation coefficients. 
           [0023]      FIG. 6  illustrates outer corner points of a 64 QAM constellation for use in updating channel estimation coefficients. 
       
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0024]    In the following detailed description of the embodiments, reference is made to the accompanying drawings, which form a part hereof, and in which is shown by way of illustration of specific embodiments in which the present invention may be practiced. The following embodiments relate to channel estimation of an OFDM signal. However, it is understood by a person having ordinary skill in the art that the present invention can be applied to other types of received signals for channel estimation. 
         [0025]      FIG. 3  illustrates a method of the present invention for channel estimation. Here, a receiver receives the signal via an antenna in the time domain. A Fast-Fourier transform (“FFT”) is applied to the signal to transform the time domain signal to a frequency domain signal. Next, channel estimation  50  is applied to the frequency domain signal. 
         [0026]    During channel estimation  50 , pilot symbols Y P (m,n) are selected  54 , along with corresponding channel estimation coefficients C k (m,n). The pilot symbols can be selected from a pilot buffer  52 , which stores the pilot pattern of the signal. The channel estimation coefficients can be selected from a coefficient buffer  56 , which stores the channel estimation coefficients. Channel estimation coefficients (also known as “interpolation coefficients” or “pilot coefficients”) are used to process and interpret the incoming data. As known by a person having ordinary skill in the art, there are several methods for determining channel estimation coefficients. 
         [0027]    The pilot buffer  52  and the coefficient buffer  56  size can be determined by the size of the window for training. The larger the window size used for training, the longer training generally takes since there are more values to be taken into consideration. 
         [0028]    Once the pilot symbols and channel estimation coefficients are determined, timing offset compensation can be applied  58 . Next, the channel estimation for the signal H(m,n) is calculated  60 . Once the channel estimate H(m,n) is calculated, equalization is applied  62  to obtain a frequency domain equalizer X(m,n)=Y(m,n)/H(m,n). Next, a slicer can determine the symbol  64  for output X d (m,n). The slicer output can be outputted to a next stage for decoding of the symbol by a receiver, e.g., to a forward error correction module. The slicer output can also be further inputted for carrier validation  66 . Carrier validation determines which channel estimation coefficients are candidates for update. 
         [0029]    The selected coefficients can be updated using a 2-D least-mean-squares algorithm or other adaptive interpolation filter that takes into account the frequency domain and time domain. For instance, the updated coefficient can be 
         [0000]        C   k+1 ( m,n )= C   k ( m,n )+μ·ε( m,n )* Y   P ( m,n ),  Equation[1]
 
         [0000]    where ε(m,n)=Ĥ(m,n)−H(m,n) and Ĥ(m,n)=Y(m,n)/X d (m,n). The updated coefficients C k+1 (m,n) can then be stored in the coefficient buffer  56  for use in the next iteration of channel estimation of the signal. Generally, for each symbol, the coefficients can be updated twice. 
         [0030]      FIGS. 4   a - 4   c  illustrate a pilot pattern of a signal for selecting pilots and channel response coefficients. In particular,  FIG. 4   a  illustrates a pilot pattern of a signal. The pilot pattern can be graphed in two dimensions to illustrate symbols and pilot symbols of the signal that are scattered within the signal at known locations. An axis of the graph is for the frequency domain carrier number (the horizontal axis in this example) and the other axis is for the time domain symbol number. The origin of the graph can be denoted (0,0), and be incrementally increased along each of the axes. 
         [0031]      FIG. 4   b  illustrates a single time domain symbol number along a frequency domain carrier number axis. A single time domain symbol number  61  can have multiple frequency domain carrier numbers. Here, pilot symbols can be spaced every 11 carriers from each other. For instance, between pilot symbols  62 , the carriers can be counted off from 0 to 10. After the second pilot symbol  62 , another 0 to 10 can be counted off (not shown), until the next pilot symbol occurs. This pattern can be repeated for this time domain symbol number  61  and for other time domain symbol numbers of the signal. 
         [0032]      FIG. 4   c  illustrates the pilot pattern of the signal. Here, a window  68  can circumscribe the area to be used for channel estimation of a symbol  63 . Pilot symbols  64  can be used for channel estimation of the non-pilot symbol  63 , which are all located within the window  68 . In this example, six pilot carriers are used for channel estimation. However, it is understood that other numbers of pilot symbols can be used for channel estimation depending on the performance needs of the receiver system. 
         [0033]    The channel estimation for the m-th symbol and the n-th carrier can be denoted H(m, n). The carriers that participate in the calculation can form a window  68  consisting of 8 symbols by 9 carriers. The window size can vary depending on the performance requirements of the system. 
         [0034]    The targeted channel estimation H(m,n) can be positioned in the middle of the window  68 . Within the window  68 , there are total six pilots (e.g., the pilots  64 ) that can participate in the channel estimation calculation. The signals received at the six pilot symbols  64  for the nine carriers can be denoted as Y P (m−3,n−1), Y P (m−2,n−4), Y P (m,n+2), Y P (m+1,n−1), Y P (m+2,n−4), and Y P (m+4,n+2). 
         [0035]    Furthermore, for such pilot pattern, the pilot positions relative to each of the non-pilot carriers can be denoted as follows: 
         [0000]    
       
         
               
               
               
               
               
               
               
             
           
               
                   
               
               
                 #Carrier  
                 Pilot1 
                 Pilot2 
                 Pilot3 
                 Pilot4 
                 Pilot5 
                 Pilot6 
               
               
                   
               
             
             
               
                  0 
                 m − 3, n − 4 
                 m − 1, n + 2 
                 m, n − 1 
                 m + 1, n − 4 
                 m + 3, n + 2 
                 m + 4, n − 1 
               
               
                  1 
                 m − 2, n + 4 
                 m − 1, n + 1 
                 m, n − 2 
                 m + 2, n 
                 m + 3, n + 1 
                 m + 4, n − 2 
               
               
                  2 
                 m − 2, n + 3 
                 m − 1, n 
                 m, n − 3 
                 m + 2, n + 1 
                 m + 3, n 
                 m + 4, n − 3 
               
               
                  3 
                 m − 2, n + 2 
                 m − 1, n − 1 
                 m, n − 4 
                 m + 2, n + 2 
                 m + 3, n − 1  
                 m + 4, n − 4 
               
               
                  4 
                 m − 3, n + 4 
                 m − 2, n + 1 
                 m − 1, n − 2 
                 m + 1, n 
                 m + 2, n + 1 
                 m + 3, n − 2 
               
               
                  5 
                 m − 3, n + 3 
                 m − 2, n 
                 m − 1, n − 3 
                 m + 1, n + 1 
                 m + 2, n 
                 m + 3, n − 3 
               
               
                  6 
                 m − 3, n + 2 
                 m − 2, n − 1 
                 m − 1, n − 4 
                 m + 1, n + 2 
                 m + 2, n − 1 
                 m + 3, n − 4 
               
               
                  7 
                 m − 3, n + 1 
                 m − 2, n − 2 
                 m, n + 4 
                 m + 1, n + 1 
                 m + 2, n − 2 
                 m + 4, n + 4 
               
               
                  8 
                 m − 3, n 
                 m − 2, n − 3 
                 m, n + 3 
                 m + 1, n 
                 m + 2, n − 3 
                 m + 4, n + 3 
               
               
                  9 
                 m − 3, n − 1 
                 m − 2, n − 4 
                 m, n + 2 
                 m + 1, n − 1 
                 m + 2, n − 4 
                 m + 4, n + 2 
               
               
                 10 
                 m − 3, n − 2 
                 m − 1, n + 4 
                 m, n + 1 
                 m + 1, n − 2  
                 m + 3, n + 4 
                 m + 4, n + 1 
               
               
                   
               
             
          
         
       
     
         [0036]    For example, if the channel estimation H(3, 9), m=3 and n=9, then the six pilot symbols are denoted as follows: Yp(0,n−1), Yp(1,n−4), Yp(3, n+2), Yp(4,n−1), Yp(5,n−4), Yp(7,n+2) and correspondent coefficients are denoted as c(9,0) to c(9,5). Therefore, H(3,n)=C(9,0)*Yp(0,n−1)+C(9,1)*Yp(1,n−4)+C(9,2)*Yp(3, n+2)+C(9,3)*Yp(4,n−1)+C(9,4)*Yp(5,n−4)+C(9,5)*Yp(7,n+2). 
         [0037]      FIG. 5  illustrates outer corner points of a 16-QAM constellation for use in updating channel estimation coefficients. In the above approach, for better performance, not every slicer output may be used to update the channel estimation coefficients. During carrier validation, specific slicer outputs are selected from the slicer output for channel estimation coefficients. Generally, the slicer can provide a quadrature amplitude modulation (“QAM”). Points along the outer ring or corner of the QAM constellation can be selected for use in updating the channel estimation coefficients since the signal-to-noise ratio (“SNR”) along the outer ring or corner is typically higher than points within the QAM constellation. 
         [0038]    For instance, in a 16-QAM constellation, points  72  at the outer ring of the 16-QAM constellation are selected for use in the channel estimation coefficient update. Since different QAM constellations have different levels of noise endurance level, the points used for channel estimation coefficient update can vary. 
         [0039]      FIG. 6  illustrates outer corner points of a 64-QAM constellation for use in updating channel estimation coefficients. In a 64-QAM constellation points  80  can be selected for use in updating the channel estimation coefficients. 
         [0040]    While the present invention has been described with reference to certain preferred embodiments or methods, it is to be understood that the present invention is not limited to such specific embodiments or methods. Rather, it is the inventor&#39;s contention that the invention be understood and construed in its broadest meaning as reflected by the following claims. Thus, these claims are to be understood as incorporating not only the preferred methods described herein but all those other and further alterations and modifications as would be apparent to those of ordinary skilled in the art.