# Patent

## Title
Compensation for residual frequency offset, phase noise and sampling phase offset in wireless networks

## Abstract

Improved performance, particularly gain in signal-to-noise ratio (SNR), in high-bandwidth Orthogonal Frequency Division Multiplexing (OFDM) receivers, software and systems is achieved by compensating channel estimates not only for carrier frequency offset and phase noise, but also for interference caused by sample phase jitter. At high bandwidths, e.g., using 256 quadrature amplitude modulation (QAM) symbol constellation, significant SNR improvement is gained by determining and applying a corresponding compensation to each data sub-carrier channel, the compensation preferably including a term that increases linearly with the sub-carrier index.

## Background
RELATED APPLICATION
This application is a continuation of U.S. application Ser. No. 10/193,439, filed Jul. 10, 2002 which claims the benefit of U.S. Provisional Application No. 60/356,475, filed Feb. 13, 2002. The disclosures of the above applications are incorporated herein by reference in their entirety.


TECHNICAL FIELD
The invention is in the field of wireless communications and, more specifically, pertains to improved performance in an OFDM receiver physical layer implementation by fine tuning each channel estimate to compensate for sample phase jitter.
BACKGROUND OF THE INVENTION
The wireless local area network or WLAN is expanding rapidly into a wide variety of implementations and applications. This rapid growth is attributable to several factors, including improved accuracy (lower BER), increased bandwidth and falling costs. While wireless networking was considered fairly exotic and certainly expensive just a few years ago, it is rapidly gaining users in all markets. Commercial enterprises can avoid considerable wiring costs by deploying wireless networks in their buildings and campuses. Even families and home office workers now enjoy the benefits of wireless networks, as the cost of an access point has fallen below $100 at retail and an individual WLAN “station” costs around $50. (A station or “client” has a MAC and a PHY, and connects to the wireless medium. Common implementations include standard PC-type circuit boards and PCM cards.)
High manufacturing volumes, lower costs, and technical improvements to a large degree can all be traced to standardization. The IEEE established the 802.11 Working Group in 1990, and has promulgated various standards in this area in recent years. In 1999, the IEEE-SA Standards Board approved the 2.4 GHz, 11 Mbps 802.11b and the 5 GHz, 54 Mbps 802.11a high-rate PHY extensions. These two standards have relatively identical MAC layers, but different PHY layers. The IEEE Standard 802.11 (1999), the IEEE Standard 802.11a (1999) and 802.11b (1999) high-rate PHY Supplements, and the 802.11g (draft 2002) high-rate PHY Supplement are incorporated herein fully by reference.
The lower bandwidth 802.11b standard was first to be widely implemented, fueling considerable growth and competition in the WLAN industry. That system has several drawbacks, however. The 2.4 GHz (unlicensed) band is very congested, hosting everything from wireless telephones to Bluetooth transceivers to microwave ovens. (Although the maximum packet length in the 802.11 protocol was designed to operate between the 8 msec pulses of the microwave oven magnetron.) The 2.4 Gz system provides limited numbers of channels (three non-overlapping) and bandwidth limited to 11 Mbps best case.
The 5 GHz (“Wi-Fi5”) band is relatively clean. The 802.11a extension provides for 8 non-overlapping channels (plus 4 channels in the upper band), and improved bandwidth up to 54 Mbps. Systems can provide higher bandwidths, and still be compliant, as long as they implement at least the mandatory data rates, namely 6, 12, and 24 Mbps. Some manufacturers are offering “dual band” systems that implement both 802.11b and 802.11a standards. Because of differences in the PHY layer, particularly different frequency radios and modulation schemes, dual band systems essentially have to implement both types of systems in one package.
Another extension of the basic 802.11 architecture is the 802.11g proposal (not yet a standard), which is something of a hybrid. It operates in the 2.4 GHz band, like 802.11b, but uses orthogonal frequency division multiplexing OFDM in the PHY layer, like 802.11a, to achieve data rates in excess of 20 Mbps. (802.11g also employs Complementary Code Keying (CCK) like 802.11b for data rates below 20 Mbps. In fact it has a variety of operating modes). Final ratification of the 802.11g protocol is expected in 2003. It is attractive in part because the 2.4 GHz band is largely available world-wide. Some predict that combination 802.11a/g designs will soon supplant 802.11a/b. Indeed, the present invention is applicable to 802.11a/g combination designs (as well as each of them separately).
As noted, both 802.11a and 802.11g protocols employ OFDM encoding. Briefly, OFDM works by dividing one high-speed data carrier into multiple low-speed sub-carriers which are used for transmission of data, in parallel. Put another way, the data stream is divided into multiple parallel bit streams, each transmitted over a different sub-carrier having a lower bit rate. In the case of 802.11a/g there are 52 such sub-carriers, 48 of which are used to carry data. (The other four are pilot sub-carriers, discussed later.) These sub-carriers are orthogonal to each other, so they can be spaced closer together than in conventional frequency-division multiplexing. Mathematically, the integral of the product of any two orthogonal sub-carriers is zero. This property allows separating the sub-carriers at the receiver without interference from other sub-carriers. OFDM systems and circuits are described in greater detail in, for example, U.S. Pat. Nos. 5,345,440; 5,889,759 and 5,608,764 each incorporated herein fully by this reference.
In OFDM systems, carrier frequency offset and noise can produce large degradations of the Bit Error Rate (BER) performance. Indeed they not only produce extra noise due to Inter-Carrier Interference (ICI) but also a parasitic rotation of the symbols which also increases the BER as further discussed later. Carrier frequency offset means any difference in frequency between the carrier frequency generators in the transmitting and receiving circuitry.
U.S. Pat. No. 6,198,782 to De Courville et al. describes methods and apparatus for carrier and clock frequency offset compensation. De Courville obtains a ML estimate jointly for carrier and clock frequency offsets. However, the approach in the 782 patent first removes the channel using equalization for coherent modulation systems (col. 5, line 5). The equalization leads to different noise variance on each subcarrier (i.e. non-white noise). This factor apparently is not considered in the derivation of the ML estimator in the patent (col. 7, line 7).
Several methods are known for estimating and compensating a carrier frequency offset. See for example, U.S. Pat. No. 5,450,456 to Mueller. These techniques are useful, but they do not address sample phase noise or “jitter”, in other words discrepancies between the sample rate in a transmitter and a receiver.
SUMMARY OF THE INVENTION
We have discovered improved methods and apparatus to improve performance by compensating channel estimates in an OFDM receiver. The method in one embodiment calls for determining an initial channel estimate responsive to the “training signal” in the preamble of a received packet of OFDM symbols; compensating the initial channel estimate to adjust for carrier frequency offset; and further compensating the initial channel estimate to compensate for sampling phase offset encountered at the receiver A/D converter. Preferably, the compensation to accommodate sampling phase jitter includes determining a specific compensation term for each sub-carrier of the OFDM symbols. More specifically, each sub-carrier specific compensation term increases linearly as a function of the sub-carrier index.
The present invention obtains the ML estimates before equalization such that the additive noise remains white. Furthermore, the ML estimates derived in prior art, such as De Courville, consist of pure phase factors with unit magnitude. The present invention, by contrast, models the distortion by complex factors to allow compensation of the common phase error (due to phase noise) and compensation of the average value of the sampling clock jitter (i.e., the average sampling phase offset for each OFDM symbol).
The compensated channel estimates are given by

{tilde over (H)}k=(A+kB)Ĥk 

where A and B are complex numbers. This compensation method has a constant term A to account for residual carrier frequency offset and phase noise, and a second term kB that increases linearly with the sub-carrier index to account for sampling phase offsets. Maximum likelihood techniques can be used to estimate the terms A and B.
Compensation in accordance with the invention can be implemented in hardware, software, or a combination of the two. It can be realized in one or more integrated circuits to minimize size and power requirements, with on-board and/or external memory facilities.
Additional aspects and advantages of this invention will be apparent from the following detailed description of particular embodiments thereof, which proceeds with reference to the accompanying drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a simplified block diagram of an OFDM transmitter PMD
FIG. 2 is a diagram of an OFDM PPDU frame.
FIG. 3 is a simplified block diagram of an OFDM receiver PMD.
FIG. 4 Calculation flow diagram for improved compensation for common phase error and sampling phase drift.
FIG. 5 is a plot of simulation results at 24 Mbps.
FIG. 6 is a plot of simulation results at 54 Mbps.
FIG. 7 is a plot of simulation results at 72 Mbps.
FIG. 8 is a plot of simulation results at 72 Mbps with 2 degrees rms phase noise.
FIG. 9 is a simplified block diagram of a transceiver incorporating the transmitter of FIG. 1 and the receiver of FIG. 3.
FIG. 10 is an exemplary channel estimate compensation method according to the present disclosure.
FIG. 11 is another exemplary channel estimate compensation method according to the present disclosure.



DETAILED DESCRIPTION OF THE EMBODIMENTS
FIG. 1 is a simplified block diagram of an OFDM transmitter PMD compliant with the IEEE 802.11a standard. This illustrates generally a representative environment or application in connection with which the present invention can be used. In FIG. 1, an outbound PPDU, i.e. a data unit, is input at 100. This data unit, described in greater detail below, has a preamble, a header, data portion, tail, pad bits etc. The bit stream is input to a convolutional encoder 102. The information preferably is encoded using convolutional encoding rate R=1⁄2, 2⁄3, or 3⁄4 depending on the specified data rate, and using known polynomials.
Next the encoded data is input to bit interleaving and mapping block 104. Bit interleaving is accomplished by a block interleaver with a block size corresponding to the number of bits in a single OFDM symbol, NCBPS, as detailed in the 802.11a standard at 17.3.5.6. The first permutation ensures that adjacent coded bits are mapped onto nonadjacent sub-carriers. The second permutation step ensures that adjacent coded bits are mapped alternately onto less and more significant bits of the constellation and, thereby, long runs of low reliability (LSB) bits are avoided.
Block 104 in FIG. 1 also represents mapping the data, in other words symbol modulation. The encoded and interleaved binary serial input data is divided into groups of bits, each group sized according to the selected modulation (1, 2, 4 or 6 bits). For example, 64-QAM modulation maps 6-bit quantities onto the constellation. The same procedures can be extended to higher rate encoding, e.g. 256-QAM, in which case each group of 8 bits of the serial data is mapped onto one complex number (I+jQ) corresponding to a location on the 256-QAM constellation. The output values are multiplied by a normalization factor, depending on the base modulation mode (for 64-QAM, it is 1/√{square root over (42)}) to achieve the same average power for all mappings.
Each group of 48 complex numbers is associated with one OFDM symbol. Thus 48×6=288 data bits are encoded per OFDM symbol in the case of 64-QAM constellation bit encoding. The symbol duration is 4.0 μsec. Each group of 48 numbers is mapped to a corresponding one of 48 useful sub-carriers, frequency offset index numbers −26 to +26. Accordingly each sub-carrier (except the pilot sub-carriers) will be modulated by one complex number for each OFDM symbol in the current data unit.
In each symbol, four of the sub-carriers are dedicated to pilot signals to assist in coherent detection. They are also used in the accordance with the present invention for compensating the channel estimates to adjust for sample phase jitter. The pilot signals are put in sub-carriers −21, −7, 7 and 21 according to the industry standard. The pilots are BPSK modulated by a pseudo binary sequence to prevent the generation of spectral lines.
The inverse FFT 106 receives all 52 sub-carrier signals and combines them to form a time domain digital signal. Next, a guard interval (not shown) is inserted. The guard interval is to increase immunity to multipath by extending the length of the transmitted symbol. (It is also known as CP or cyclic prefix.) The window length used in the demodulator in the receiver to decode the symbol is that of the active symbol length, in other words excluding the guard interval period. Symbol wave shaping follows, block 108, and then modulation onto I and Q phase quadrature carriers at 110, and finally the combined signal is modulated onto the radio frequency carrier fc for transmission from antenna 112. To summarize mathematically, as noted above, the transmitted time-domain signal (after D/A conversion at rate 1/T) is represented by




  
    
      
        
          x
          ⁢
          
            
          
          ⁢
          
            (
            t
            )
          
        
        =
        
          
            1
            N
          
          ⁢
          
            
          
          ⁢
          
            
              ∑
              
                k
                =
                0
              
              
                N
                -
                1
              
            
            ⁢
            
              
            
            ⁢
            
              
                X
                k
              
              ⁢
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      π
                      ⁢
                      
                        
                      
                      ⁢
                      kt
                    
                    NT
                  
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where Xk are the frequency-domain data symbols. In other words, the N values Xk represent the respective values of the discretely-varying (e.g. QPSK or QAM) signals modulating the OFDM carriers.

Before describing the receiver, we examine more closely the structure of the data unit frame and how it is designed to assist the receiver. FIG. 2 is a block diagram illustrating the structure of a PLCP protocol data unit (PPDU) frame, in accordance with the IEEE 802.11a standard. In particular, this frame structure is a part of the IEEE 802.11a physical layer extension to the basic 802.11 protocol. The 802.11a extension defines requirements for a PHY operating in the 5.0 GHz unlicensed frequency bands and data rates ranging from 6 Mbps to 54 Mbps.
Under this protocol, the PPDU (PLCP protocol data unit) frame consists of a PLCP preamble and signal and data fields as illustrated in FIG. 2. The receiver uses the PLCP preamble to acquire the incoming OFDM signal and synchronize the demodulator. The PLCP header contains information about the PSDU (PLCP service data unit) or payload from the sending OFDM PHY. The PLCP preamble and the signal field are always transmitted at 6 Mbps, binary phase shift keying, modulated using convolutional encoding rate R=1⁄2.
The PLCP preamble 202 is used to acquire the incoming signal and train and synchronize the receiver. The PLCP preamble consists of 12 symbols, 10 of which are short symbols, and 2 long symbols. The short symbols are used to train the receiver's AGC and obtain a course estimate of the carrier frequency and the channel. The long symbols are used to fine-tune the frequency and channel estimates. Twelve sub-carriers are used for the short symbols and 53 for the long. The training of an OFDM is accomplished in 16 microseconds. This is calculated as 10 short symbols times 0.8 microseconds each, plus 2 long training symbols at 3.2 microseconds each, plus the guard interval. See IEEE standard 802.11a (1999) Section 17.3.3. These training symbols, as noted above, provide for a channel and frequency offset estimation, but do not compensate for other factors such as sampling frequency jitter.
Referring again to FIG. 2, the preamble field 202 is followed by a signal field 204 which consists of one OFDM symbol. This contains the rate and length fields as requested by the MAC. The rate field conveys information about the type of modulation and the coding rate as used in the rest of the packet. The encoding of the SIGNAL single OFDM symbol is performed with BPSK modulation of the sub-carriers and again using convolutional coding at R=1⁄2. The SIGNAL field is composed of 24 bits, with bits 0 to 3 encoding the rate, bit 4 reserved, and bits 5-16 encoding the length of the packet, with the LSB being transmitted first. A single parity bit and 6-bit tail field complete the SIGNAL symbol. Finally, the SIGNAL field 204 is followed by the data 206 comprising a variable number of OFDM symbols including the SERVICE field still forming part of the PLCP Header, consistent with the length specified in the SIGNAL field 204.
Referring now to FIG. 3, a simplified block diagram of a receiver is shown with the RF receiving antenna 118 at the left. The receiver includes a low-noise amplifier 120, IF detector 122 driver by a local oscillator, and automatic gain control circuit (AGC) 124 as are well known. The resulting signal is input to an IQ detector 130 to recover I and Q phase quadrature analog signals, which are used by AFC clock recover 132 to adjust local oscillator 134 to synchronize with received signals. The recovered signals are converted to digital data by A/D sampling (not shown), guard interval removed 136, and the stream of data is converted to parallel form for input to FFT 140.
The FFT (implementation of the Discrete Fourier Transform) demodulates the data from the sub-carrier signals to recover the 52 signals which in turn are serialized and then input to block 142 for bit de-interleaving and de-mapping (from the constellation) back into a serial binary stream, which then undergoes convolutional decoding 144 to recover the inbound data unit PPDU 150 transmitted by an incident OFDM transmitter arranged in accordance with the transmitter 180 shown in FIG. 1. Further details of this type of receiver are known, but the need remains for improvements in performance especially at higher data rates, i.e. above 54 Mbps which is not currently considered by the IEEE 802.11a (1999) and 802.11g (2002 draft) standards.
The OFDM system can be modeled as follows. The transmitted time-domain signal (after D/A conversion at rate 1/T) is represented by e.g. n(1) discussed above,
where Xk are the frequency-domain data symbols. In other words, the N values Xk represent the respective values of the discretely-varying (e.g. QPSK or QAM) signals modulating the OFDM carriers.
Multipath is a performance concern that also must be taken into account. Multipath occurs when the direct path of the transmitted signal is combined with reflected signal paths, resulting in a corrupted signal at the receiver. The delay of the reflected signals, a function of the propagation environment, typically around 50-300 nanoseconds, is commonly known as delay spread. We model the transmitted signal as distorted by a multipath channel with impulse response h(t). Moreover, at the receiver, residual frequency offset and phase noise contribute to a multiplicative distortion ejφ(t). Finally, white Gaussian noise v(t) is added to form the received signal y(t).

y(t)=ejφ(t)[h(t)*x(t)]+v(t).  (2)

The received signal is sampled at the A/D converter (at rate 1/T) with some jitter (represented by sn) on the sampling phase. Thus, the A/D output can be written as




  
    
      
        
          
            
              
                y
                n
              
              =
              
                y
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      [
                      
                        n
                        +
                        
                          s
                          n
                        
                      
                      ]
                    
                    ⁢
                    T
                  
                  )
                
              
            
          
        
        
          
            
              =
              
                
                  
                    e
                    
                      j
                      ⁢
                      
                        
                      
                      ⁢
                      
                        φ
                        n
                      
                    
                  
                  ⁢
                  
                    ∫
                    
                      h
                      ⁢
                      
                        
                      
                      ⁢
                      
                        (
                        τ
                        )
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        x
                        ⁡
                        
                          (
                          
                            
                              
                                [
                                
                                  n
                                  +
                                  
                                    s
                                    n
                                  
                                
                                ]
                              
                              ⁢
                              T
                            
                            -
                            τ
                          
                          )
                        
                      
                      ⁢
                      
                        d
                        τ
                      
                    
                  
                
                +
                
                  v
                  n
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




where φn=([n+sn]T) and vn=v([n+sn]T). After simplification, we have





  
    
      
        
          y
          n
        
        =
        
          
            
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    φ
                    n
                  
                
              
              ·
              
                1
                N
              
            
            ⁢
            
              
            
            ⁢
            
              
                ∑
                
                  l
                  =
                  0
                
                
                  N
                  -
                  1
                
              
              ⁢
              
                
              
              ⁢
              
                
                  H
                  l
                
                ⁢
                
                  X
                  l
                
                ⁢
                
                  e
                  
                    j
                    ⁢
                    
                      
                        2
                        ⁢
                        
                          
                        
                        ⁢
                        π
                        ⁢
                        
                          
                        
                        ⁢
                        
                          l
                          ⁡
                          
                            (
                            
                              n
                              +
                              
                                s
                                n
                              
                            
                            )
                          
                        
                      
                      N
                    
                  
                
              
            
          
          +
          
            v
            n
          
        
      
    
    
      
        (
        4
        )
      
    
  




where





  
    H
    l
  
  =
  
    ∫
    
      h
      ⁢
      
        
      
      ⁢
      
        (
        τ
        )
      
      ⁢
      
        e
        
          
            -
            j
          
          ⁢
          
            
              2
              ⁢
              
                
              
              ⁢
              
                π
                /
                τ
              
            
            NT
          
        
      
      ⁢
      
        
          d
          τ
        
        .
      
    
  




For data detection, the DFT (Discrete Fourier Transform) of Yk is computed and is given by




  
    
      
        
          
            
              
                Y
                k
              
              =
              
              ⁢
              
                
                  ∑
                  
                    n
                    =
                    0
                  
                  
                    N
                    -
                    1
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    y
                    n
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    e
                    
                      
                        -
                        j
                      
                      ⁢
                      
                        
                      
                      ⁢
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      π
                      ⁢
                      
                        
                      
                      ⁢
                      
                        kn
                        /
                        N
                      
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    1
                    N
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      ∑
                      
                        l
                        =
                        0
                      
                      
                        N
                        -
                        1
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        H
                        l
                      
                      ⁢
                      
                        X
                        l
                      
                      ⁢
                      
                        
                          ∑
                          
                            n
                            =
                            0
                          
                          
                            N
                            -
                            1
                          
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            e
                            
                              j
                              ⁢
                              
                                
                              
                              ⁢
                              2
                              ⁢
                              
                                
                              
                              ⁢
                              π
                              ⁢
                              
                                
                              
                              ⁢
                              
                                
                                  n
                                  ⁡
                                  
                                    (
                                    
                                      l
                                      -
                                      k
                                    
                                    )
                                  
                                
                                /
                                N
                              
                            
                          
                          ⁢
                          
                            e
                            
                              j
                              ⁢
                              
                                
                              
                              ⁢
                              
                                (
                                
                                  
                                    φ
                                    n
                                  
                                  +
                                  
                                    2
                                    ⁢
                                    
                                      
                                    
                                    ⁢
                                    
                                      
                                        π
                                        /
                                        
                                          s
                                          n
                                        
                                      
                                      /
                                      N
                                    
                                  
                                
                                )
                              
                            
                          
                        
                      
                    
                  
                
                +
                
                  V
                  k
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    1
                    N
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    H
                    k
                  
                  ⁢
                  
                    X
                    k
                  
                  ⁢
                  
                    
                      ∑
                      
                        n
                        =
                        0
                      
                      
                        N
                        -
                        1
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      e
                      
                        j
                        ⁢
                        
                          
                        
                        ⁢
                        
                          (
                          
                            
                              φ
                              n
                            
                            +
                            
                              2
                              ⁢
                              
                                
                              
                              ⁢
                              π
                              ⁢
                              
                                
                              
                              ⁢
                              
                                
                                  ks
                                  n
                                
                                /
                                N
                              
                            
                          
                          )
                        
                      
                    
                  
                
                +
                
                  W
                  k
                
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




where Vk is the DFT of vn and Wk represents the intercarrier interference (ICI) and AWGN. If |φn+2πksn/N|<<1,





  
    
      
        
          Y
          k
        
        ≈
        
          
            
              H
              k
            
            ⁢
            
              
                X
                k
              
              ⁡
              
                [
                
                  1
                  +
                  
                    
                      j
                      N
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          n
                          =
                          0
                        
                        
                          N
                          -
                          1
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        φ
                        n
                      
                    
                  
                  +
                  
                    j
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        
                          2
                          ⁢
                          
                            
                          
                          ⁢
                          π
                          ⁢
                          
                            
                          
                          ⁢
                          k
                        
                        N
                      
                      ·
                      
                        1
                        N
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          n
                          =
                          0
                        
                        
                          N
                          -
                          1
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        s
                        n
                      
                    
                  
                
                ]
              
            
          
          +
          
            
              W
              k
            
            .
          
        
      
    
    
      
        (
        6
        )
      
    
  




This equation (6) suggests that the channel estimates Ĥk can be compensated by multiplying the channel estimates by an estimate of the factor given in square brackets above. However, we have discovered that improved performance, especially at high data rates, can be achieved by using the following “affine” compensation factor. Here, “affine” means “linear plus constant”. The compensating factor consists of a term that is linear with sub-carrier index (kB) plus a constant (A). The compensated channel estimates thus are given by

{tilde over (H)}k=(A+kB)Ĥk  (7)

where A and B are complex numbers. This compensation method has a constant term A to account for residual carrier frequency offset and phase noise, and a second term kB that increases linearly with the sub-carrier index to account for sampling phase offsets. The “average” value of the jitter over one OFDM symbol results in the “sampling phase offset” for which we compensate. The next section describes maximum likelihood estimates for A and B.

Maximum Likelihood Compensation of Channel Estimates

From the pilot tones, Xk, kεK(cursive), the maximum likelihood estimates for A and B have been derived; the results are




  
    
      
        
          A
          ML
        
        =
        
          
            
              
                m
                22
              
              ⁢
              
                r
                1
              
            
            -
            
              
                m
                12
              
              ⁢
              
                r
                2
              
            
          
          
            
              
                m
                11
              
              ⁢
              
                m
                22
              
            
            -
            
              m
              12
              2
            
          
        
      
    
    
      
        (
        8
        )
      
    
  
  
    
      
        
          B
          ML
        
        =
        
          
            
              
                -
                
                  m
                  12
                
              
              ⁢
              
                r
                1
              
            
            +
            
              
                m
                11
              
              ⁢
              
                r
                2
              
            
          
          
            
              
                m
                11
              
              ⁢
              
                m
                22
              
            
            -
            
              m
              12
              2
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




where





  
    
      
        
          m
          11
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                
                  
                    H
                    ^
                  
                  k
                
                ⁢
                
                  
                
                ⁢
                
                  X
                  k
                
              
              
            
            2
          
        
      
    
    
      
        (
        10
        )
      
    
  
  
    
      
        
          m
          12
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            k
            ⁢
            
              
                
                
                  
                    
                      H
                      ^
                    
                    k
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    X
                    k
                  
                
                
              
              2
            
          
        
      
    
    
      
        (
        11
        )
      
    
  
  
    
      
        
          m
          22
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              k
              2
            
            ⁢
            
              
                
                
                  
                    
                      H
                      ^
                    
                    k
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    X
                    k
                  
                
                
              
              2
            
          
        
      
    
    
      
        (
        12
        )
      
    
  
  
    
      
        
          r
          1
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              Y
              k
            
            ⁢
            
              
                H
                ^
              
              k
              *
            
            ⁢
            
              
            
            ⁢
            
              X
              k
              *
            
          
        
      
    
    
      
        (
        13
        )
      
    
  
  
    
      
        
          r
          2
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              kY
              k
            
            ⁢
            
              
                H
                ^
              
              k
              *
            
            ⁢
            
              
            
            ⁢
            
              
                X
                k
                *
              
              .
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




The channel estimates are then compensated according to (7) before further processing.

FIG. 4 is a block diagram illustrating calculation of the compensation for updating channel estimates to compensate for carrier phase error and sampling phase offset in accordance with the present invention. In FIG. 4 (upper left) a shift register 400 is formed of a series of delay of individual delay elements, for example, 402 so as form and coder/decoder arranged to remove the known modulation of the pilot carriers. Each delay element 402 delays the signal by one OFDM symbol. The shift register is initialized to a state of all ones starting from the SIGNAL symbol (see FIG. 2). (The term “shift register” is used here to describe the functional arrangement of these elements. While a discrete “shift register” chip or circuit element could be used, a more practical and preferred embodiment would be to implement the corresponding functionality in the receiver DSP software.) Element 404 translates zeros into ones and ones into minus ones and the resulting signals are input to a series of four multiplier circuits 410 except that one of the signals is multiplied by minus one in multiplier 412.
The receiver FFT outputs, namely, the 52 sub-carrier signals Yk1 to or through Yk52 are input at 414 to element 416 which simply extracts the four pilot sub-carriers (k=−21, −7, 7, 21). These four signals are input to the series of multipliers 410 as illustrated. The products produced by 410 are the pilot tones with the known BPSK modulation removed (i.e. the multiplications are actually sign changes depending on the shift register output). Next, each of these signals is input to a corresponding multiplier, collectively labeled 418 and multiplied by the complex conjugate of the corresponding channel estimate, for example, H*−7 indicated at 420. The details of implementing multipliers, including complex multipliers, are well known. Finally, the resulting four products are summed in summation circuit 422 to form the signal r1 at node 424.
To summarize, these elements illustrate an implementation of formula 13 above, i.e., the summation over the pilot signals of the corresponding data symbols times the complex conjugate of the corresponding channel estimates times the complex conjugates of the pilot tones. Element 404 converts the shift register output from bits (0 or 1) to +−1 to change the sign of the pilot sub-carrier signals. The pilot sub-carrier index numbers, fixed scalar quantities, are input to a series of multipliers 426 in which each of them is multiplied by the corresponding products of multipliers 418. The outputs (products) of multipliers 426 are summed in element 430 to form the quantity r1 in accordance with the equation 14 above.
The channel estimates H−21 H−7 H7 and H21, which are generated, for example only, by a channel estimator 438, are input to a series of elements 440 each of which produces a quantity equal to the square of the magnitude of the corresponding input signal. Each channel estimate is, of course, a complex number, indicating the channel frequency and nominal phase. These quantities are summed in element 442 to provide m11 in accordance with equation 10 above. The |HKXK|2 are each multiplied by the corresponding sub-carrier index in multipliers 446, respectively, and then summed in element 448 to form the quantity m12, as reflected in equation 11 above. The outputs (products) of multipliers 446 are again multiplied by the corresponding sub-carrier indexes in multipliers 450, and the resulting products are summed in element 452 so as to form the quantity m22 in accordance with equation 12 above.
The remaining multipliers and adders correspond to the computations reflected in equations 8 and 9 above. For example, r2 is multiplied by minus one times m12 at a multiplier 454, and the result is summed together with m22 times r1 at element 451 to form the numerator portion of equation 8 that determines the value of A in the A term in the channel compensation factor. The remaining elements of FIG. 4 will be apparent to the reader in view of this description taken together with equations 8 and 9 above. It should be understood that FIG. 4 merely illustrates certain calculations; it is not a hardware schematic. The illustrated calculations can be implemented in hardware, e.g. a DSP or microprocessor core, with appropriate software, or dedicated custom hardware could be used, in whole or in part. Various arrangements can be devised by those of ordinary skill in view of the present disclosure without departing from the scope of the present invention.
Simulation Results
In this section, results of simulations for an IEEE 802.11a and 802.11g compliant receiver are presented to illustrate the performance of this compensation technique. FIG. 5 is a plot of the packet error rate (PER) versus signal-to-noise ratio (SNR) for the 24 Mbps mode and 50-ns rms delay spread multipath channels. The frequency offset is Δf=210 kHz. The rms phase noise is set to 3° with a 3-dB frequency of 20 kHz. The in-phase/quadrature imbalance is set to 1° and 1% gain imbalance. The channel estimates are also adapted using slicer decisions and a single pole filter with adaptation parameter αCH= 1/16.
In all the simulations, nonlinearity from the power amplifier is not included. The CPE curves labeled W and X in FIGS. 5-8 constitute the simulation results when the

{tilde over (H)}k=AĤk 

channel estimates are compensated using only the constant term, i.e. The “no TBG” curves (labeled W and Y in FIGS. 5-8) show the simulation results when no sampling jitter was present; the “50 ps TBG” (where “ps” represents “picosecond”) curves (labeled X and Z) in FIGS. 5-8 denote that the time-based generator contributes a sampling jitter with rms value of 50 ps, i.e., sn=Σm=0nεm, where εm are i.i.d. zero-mean Gaussian random variables with σεT=50 ps (σε is the standard deviation of εm and T is the D/A sampling period).

The results shown in FIG. 5 indicate that the loss due to TBG jitter is small and that the “CPE” method (shown by curves W and X) has a gain of around 0.3 dB at 10% PER compared to the “affine” compensation method (curves Y and Z in the figure). This small gain is due to the estimation of two parameters (A and B) in the “affine” method using the 4 noisy pilot tones, while the “CPE” method needs to estimate only one parameter (A).
FIG. 6 plots simulation results at 54 Mbps mode and 25-ns rms delay spread. Here, the performance for “CPE” and “affine” methods are nearly identical in the presence of the TBG jitter (curves X and Z respectively). In other words, little performance benefit is realized under these conditions.
FIG. 7 plots simulation results for the 72 Mbps mode using 256 QAM and a rate 3⁄4 convolutional code. From the plot, there is a loss of around 2.7 dB at 10% PER using the “affine” compensation method (curve Y) compared to the “CPE” method (curve W) when no jitter is present. As mentioned earlier, this loss is caused by estimated two parameters (A and B) using the 4 pilot tones, when in fact one parameter (A) is sufficient when no jitter is present. However, when TBG jitter is included, the “affine” compensation method (curve Z) performs significantly better than the “CPE” method (curve X).
Referring now to FIG. 8, for the 72 Mbps mode with rms phase noise of 2° and a 3-dB frequency of 20 kHz, the loss of the “affine” compensation method (curve Y) with respect to the “CPE” method (curve W) is around 1.2 dB at 10% PER when no jitter is present. However, when TBG jitter is present, the “affine” method (curve Z) has a gain of around 3.1 dB at 10% PER compared to the “CPE” method (curve X). Thus the present invention is particularly advantageous at 72 Mbps, and in general appears to be useful at data rates over 54 Mbps.
Implementation of a receiver that embodies the invention requires additional circuitry (consistent with the flow diagram illustrated in FIG. 4) as compared to a conventional receiver design, with an attendant increase in power consumption. However, since the invention is most useful at higher data rates, e.g. over 54 Mbps, it could be implemented with an enable or switching circuit so that the extra circuitry to implement the above compensation of channel estimates could be turned on only when needed, thereby saving power consumption during operation at lower data rates.
Turning briefly to FIG. 9, FIG. 9 shows a transceiver 900 capable of implementing the teachings of the present invention, and includes receiver 300 described above with reference to FIG. 3 and a transmitter 180 described above with reference to FIG. 1 communicatively coupled to a network interface such as a MAC interface 910. As such, inbound PPDU (e.g. PPDU 150 in FIG. 3) recovered by the receiver 300 is conveyed to the MAC I/F 910, and outbound PPDU (e.g. PPDU 100 in FIG. 1) is relayed by the MAC I/F 910 to the transmitter 180 for transmission over a wireless medium such as air via the antenna 112. Though not shown in FIG. 9, the transceiver 900 may form an operational part of a network interface apparatus such as a PC card or network interface card capable of interfacing with the CPU or information processor of an information processing apparatus such as a desktop or laptop computer, and may be integrated within and constitute a part of such information processing apparatus. This network interface apparatus may alternatively form an operational component of a wireless communications access point such as a base station as will be appreciated by these ordinarily skilled in the art.
Referring now to FIG. 10, an exemplary channel estimate compensation method 950 begins in step 952. In step 954, an initial channel estimate is determined. For example, the initial channel estimate is responsive to training symbols in a preamble of a received packet comprising orthogonal Frequency Division Multiplexing (OFDM) symbols. In step 956, a phase of the initial channel estimate is compensated to adjust for carrier frequency offset. In step 958, the initial channel estimate is selectively compensated for sampling phase jitter. For example only, the initial channel estimate may be compensated when the received OFDM symbols have a data rate greater than 54 Mbps. The compensating and selectively compensating may include estimating a first affine complex number having a nonzero imaginary component directed to the carrier frequency offset and the sampling phase jitter. The compensated channel estimates may be based on (A+kB) times the initial channel estimate, wherein A and B are complex numbers each having a nonzero imaginary component and k is a sub-carrier index, and wherein A is based on carrier frequency offset and phase noise and kB is based on a sub-carrier index. In step 960, a wireless signal is processed based on the compensation of the initial channel estimate.
Referring now to FIG. 11, another exemplary channel estimate compensation method 970 begins in step 972. In step 974, initial channel estimates Ĥk are determined based on training symbols in a preamble of a received packet comprising OFDM symbols. In step 976, a phase of the initial channel estimates is compensated based on:

{tilde over (H)}k=(A+kB)Ĥk 

    
    
        for −26≦k≦26;
    
    


wherein A and B are complex numbers having a nonzero imaginary component. In step 978, a specific affine compensation term for each sub-carrier of the OFDM symbols is determined. For example only, maximum likelihood estimates may be used for A and B where the estimates for A and B are determined based on:




  A
  =
  
    
      A
      ML
    
    =
    
      
        
          
            
              
                m
                22
              
              ⁢
              
                r
                1
              
            
            -
            
              
                m
                12
              
              ⁢
              
                r
                2
              
            
          
          
            
              
                m
                11
              
              ⁢
              
                m
                22
              
            
            -
            
              m
              12
              2
            
          
        
        ⁢
        
          
        
        ⁢
        and
        ⁢
        
          
        
        ⁢
        B
      
      =
      
        
          B
          ML
        
        =
        
          
            
              
                -
                
                  m
                  12
                
              
              ⁢
              
                r
                1
              
            
            +
            
              
                m
                11
              
              ⁢
              
                r
                2
              
            
          
          
            
              
                m
                11
              
              ⁢
              
                m
                22
              
            
            -
            
              m
              12
              2
            
          
        
      
    
  




where:




  
    
      
        
          m
          11
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                
                  
                    H
                    ^
                  
                  k
                
                ⁢
                
                  
                
                ⁢
                
                  X
                  k
                
              
              
            
            2
          
        
      
    
  
  
    
      
        
          m
          12
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            k
            ⁢
            
              
                
                
                  
                    
                      H
                      ^
                    
                    k
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    X
                    k
                  
                
                
              
              2
            
          
        
      
    
  
  
    
      
        
          m
          22
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              k
              2
            
            ⁢
            
              
                
                
                  
                    
                      H
                      ^
                    
                    k
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    X
                    k
                  
                
                
              
              2
            
          
        
      
    
  
  
    
      
        
          r
          1
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              Y
              k
            
            ⁢
            
              
                H
                ^
              
              k
              *
            
            ⁢
            
              
            
            ⁢
            
              X
              k
              *
            
          
        
      
    
  
  
    
      
        
          r
          2
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              kY
              k
            
            ⁢
            
              
                H
                ^
              
              k
              *
            
            ⁢
            
              
            
            ⁢
            
              
                X
                k
                *
              
              .
            
          
        
      
    
  




and where Xk represents frequency domain data symbols and Yk represents sub-carrier symbols. In step 980, a wireless signal is processed based on the compensation of the initial channel estimate.

It will be obvious to those having skill in the art that many changes may be made to the details of the above-described embodiments of this invention without departing from the underlying principles thereof. The scope of the present invention should, therefore, be determined only by the following claims.

## Claims

1. A method comprising:
determining an initial channel estimate responsive to training symbols in a preamble of a received packet comprising Orthogonal Frequency Division Multiplexing (OFDM) symbols;
compensating a phase of the initial channel estimate to adjust for carrier frequency offset;
selectively compensating the initial channel estimate for sampling phase jitter when the received OFDM symbols have a data rate greater than 54 Mbps,
wherein the compensating and selectively compensating comprises estimating a first affine complex number having a nonzero imaginary component directed to the carrier frequency offset and the sampling phase jitter;
at least one of transmitting and receiving a wireless signal; and
processing the wireless signal based on the compensating of the initial channel estimate.

2. The method of claim 1 wherein the compensating for sampling phase jitter includes determining a compensation term for each sub-carrier of the OFDM symbols.

3. The method of claim 2 wherein each of the sub-carrier compensation terms increases as a function of the sub-carrier index.

4. The method of claim 2 wherein each of the sub-carrier compensation terms increases linearly with the sub-carrier index.

5. A method comprising:
determining an initial channel estimate based on training symbols in a preamble of a received packet comprising OFDM symbols;
generating compensated channel estimates by:
compensating a phase of the initial channel estimate to adjust for carrier frequency offset and;
compensating for sampling phase jitter,

wherein the compensated channel estimates are based on (A+kB) times the initial channel estimate, wherein A and B are complex numbers each having a nonzero imaginary component and k is a sub-carrier index, and wherein A is based on carrier frequency offset and phase noise and kB is based on a sub-carrier index;
at least one of transmitting and receiving a wireless signal; and
processing a wireless signal based on the compensated channel estimates.

6. The method of claim 5 wherein both A and B are estimated using maximum likelihood estimation techniques responsive to pilot signals modulating predetermined sub-carriers.

7. The method of claim 5 wherein the pilot signal sub-carrier indexes are −21, −7, 7 and 21 in accordance with at least one of IEEE standard 802.11a and proposed standard 802.11g draft D2.8, May 2002.

8. The method of claim 7 wherein the received packet comprises an 802.11a compliant packet in which data is modulated using a QAM constellation of at least 64 symbols.

9. A method comprising:
determining initial channel estimates Ĥk based on training symbols in a preamble of a received packet comprising OFDM symbols;
compensating a phase of the initial channel estimates based on:


{tilde over (H)}k=(A+kB)Ĥk 

for −26≦k≦26;

wherein A and B are complex numbers having a nonzero imaginary component; and
determining a specific affine compensation term for each sub-carrier of the OFDM symbols;
at least one of transmitting and receiving a wireless signal; and
processing a wireless signal based on the compensating of the initial channel estimates.

10. A method comprising:
determining initial channel estimates Ĥk based on training symbols in a preamble of a received packet comprising OFDM symbols;
compensating the initial channel estimates based on:


{tilde over (H)}k=(A+kB)Ĥk 

for −26≦k≦26;

wherein A and B are complex numbers;
determining a specific affine compensation term for each sub-carrier of the OFDM symbols; and
using maximum likelihood estimates for A and B where the estimates for A and B are determined based on:





  A
  =
  
    
      A
      ML
    
    =
    
      
        
          
            
              
                m
                22
              
              ⁢
              
                r
                1
              
            
            -
            
              
                m
                12
              
              ⁢
              
                r
                2
              
            
          
          
            
              
                m
                11
              
              ⁢
              
                m
                22
              
            
            -
            
              m
              12
              2
            
          
        
        ⁢
        
          
        
        ⁢
        and
        ⁢
        
          
        
        ⁢
        B
      
      =
      
        
          B
          ML
        
        =
        
          
            
              
                -
                
                  m
                  12
                
              
              ⁢
              
                r
                1
              
            
            +
            
              
                m
                11
              
              ⁢
              
                r
                2
              
            
          
          
            
              
                m
                11
              
              ⁢
              
                m
                22
              
            
            -
            
              m
              12
              2
            
          
        
      
    
  



where:





  
    
      
        
          m
          11
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                
                  
                    H
                    ^
                  
                  k
                
                ⁢
                
                  
                
                ⁢
                
                  X
                  k
                
              
              
            
            2
          
        
      
    
  
  
    
      
        
          m
          12
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            k
            ⁢
            
              
                
                
                  
                    
                      H
                      ^
                    
                    k
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    X
                    k
                  
                
                
              
              2
            
          
        
      
    
  
  
    
      
        
          m
          22
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              k
              2
            
            ⁢
            
              
                
                
                  
                    
                      H
                      ^
                    
                    k
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    X
                    k
                  
                
                
              
              2
            
          
        
      
    
  
  
    
      
        
          r
          1
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              Y
              k
            
            ⁢
            
              
                H
                ^
              
              k
              *
            
            ⁢
            
              
            
            ⁢
            
              X
              k
              *
            
          
        
      
    
  
  
    
      
        
          r
          2
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              kY
              k
            
            ⁢
            
              
                H
                ^
              
              k
              *
            
            ⁢
            
              
            
            ⁢
            
              
                X
                k
                *
              
              .
            
          
        
      
    
  



and where Xk represents frequency domain data symbols and Yk represents sub-carrier symbols;
at least one of transmitting and receiving a wireless signal; and
processing a wireless signal based on the compensating of the initial channel estimates.

11. The method of claim 10 further comprising obtaining the maximum likelihood estimations prior to equalization of the received signals.

12. The method of claim 10 wherein the received packet of OFDM symbols is compliant with at least one of IEEE standard 802.11a and proposed standard 802.11g draft D2.8, May 2002.

13. The method of claim 10 further comprising selectively compensating the initial channel estimates when the received OFDM symbols have a data rate greater than 54 Mbps.

14. A receiver comprising:
a channel estimator that determines an initial channel estimate responsive to training symbols in a preamble of a received packet comprising OFDM symbols; and
a channel compensator that compensates phase of the initial channel estimate to adjust for carrier frequency offset, that selectively compensates the initial channel estimate for sampling phase jitter when the received OFDM symbols have a data rate greater than 54 Mbps, and that estimates a first affine complex number having a nonzero imaginary component directed to the carrier frequency offset and the sampling phase jitter.

15. The receiver of claim 14 wherein the channel compensator compensates for sampling phase jitter by determining a compensation term for each sub-carrier of the OFDM symbols.

16. The receiver of claim 15 wherein each of the sub-carrier compensation terms increases as a function of the sub-carrier index.

17. The receiver of claim 15 wherein each of the sub-carrier compensation terms increases linearly with the sub-carrier index.

18. A receiver comprising:
a channel estimator that determines an initial channel estimate based on training symbols in a preamble of a received packet comprising OFDM symbols; and
a channel compensator that generates compensated channel estimates by compensating a phase of the initial channel estimate to adjust for carrier frequency offset and by compensating for sampling phase jitter,
wherein the compensated channel estimates are based on (A+kB) times the initial channel estimate, wherein A and B are complex numbers each having a nonzero imaginary component and k is the corresponding sub-carrier index, and wherein A is based on carrier frequency offset and phase noise and kB is based on a sub-carrier index.

19. The receiver of claim 18 wherein both A and B are estimated using maximum likelihood estimation techniques responsive to pilot signals modulating predetermined sub-carriers.

20. The receiver of claim 18 wherein the pilot signal sub-carrier indexes are −21, −7, 7 and 21 in accordance with at least one of IEEE standard 802.11a and proposed standard 802.11g draft D2.8, May 2002.

21. The receiver of claim 20 wherein the received packet comprises an 802.11a compliant packet in which data is modulated using a QAM constellation of at least 64 symbols.

22. A receiver comprising:
a channel estimator that determines initial channel estimates Ĥk responsive to training symbols in the preamble of a received packet comprising OFDM symbols; and
a channel compensator that compensates a phase of the initial channel estimates based on:


{tilde over (H)}k=(A+kB)Ĥk 

for −26≦k≦26;


wherein A and B are complex numbers having a nonzero imaginary component, and that determining a specific affine compensation term for each sub-carrier of the OFDM symbols.

23. A receiver comprising:
a channel estimator that determines initial channel estimates Ĥk responsive to training symbols in a preamble of a received packet comprising OFDM symbols;
a channel compensator that compensates the initial channel estimates based on:


{tilde over (H)}k=(A+kB)Ĥk 


for −26≦k≦26;

wherein A and B are complex numbers, that determines a specific affine compensation term for each sub-carrier of the OFDM symbols, and that uses maximum likelihood estimates for A and B where the estimates for A and B are determined as:



  
    
      A
      =
      
        
          A
          ML
        
        =
        
          
            
              
                m
                22
              
              ⁢
              
                r
                1
              
            
            -
            
              
                m
                12
              
              ⁢
              
                r
                2
              
            
          
          
            
              
                m
                11
              
              ⁢
              
                m
                22
              
            
            -
            
              m
              12
              2
            
          
        
      
    
    ⁢
    
      
    
  




  
    B
    =
    
      
        B
        ML
      
      =
      
        
          
            
              -
              
                m
                12
              
            
            ⁢
            
              r
              1
            
          
          +
          
            
              m
              11
            
            ⁢
            
              r
              2
            
          
        
        
          
            
              m
              11
            
            ⁢
            
              m
              22
            
          
          -
          
            m
            12
            2
          
        
      
    
  


where





  
    
      
        
          m
          11
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                
                  
                    H
                    ^
                  
                  k
                
                ⁢
                
                  
                
                ⁢
                
                  X
                  k
                
              
              
            
            2
          
        
      
    
  
  
    
      
        
          m
          12
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            k
            ⁢
            
              
                
                
                  
                    
                      H
                      ^
                    
                    k
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    X
                    k
                  
                
                
              
              2
            
          
        
      
    
  
  
    
      
        
          m
          22
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              k
              2
            
            ⁢
            
              
                
                
                  
                    
                      H
                      ^
                    
                    k
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    X
                    k
                  
                
                
              
              2
            
          
        
      
    
  
  
    
      
        
          r
          1
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              Y
              k
            
            ⁢
            
              
                H
                ^
              
              k
              *
            
            ⁢
            
              
            
            ⁢
            
              X
              k
              *
            
          
        
      
    
  
  
    
      
        
          r
          2
        
        =
        
          
            ∑
            
              k
              ∈
              K
            
            
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              kY
              k
            
            ⁢
            
              
                H
                ^
              
              k
              *
            
            ⁢
            
              
            
            ⁢
            
              
                X
                k
                *
              
              .
            
          
        
      
    
  



and where Xk represents frequency domain data symbols and Yk represents sub-carrier symbols.

24. The receiver of claim 23 wherein the channel estimator obtains the maximum likelihood estimations prior to equalization of the received signals.

25. The receiver of claim 23 wherein the received packet of OFDM symbols is compliant with at least one of IEEE standard 802.11a and proposed standard 802.11g draft D2.8, May 2002.

26. The receiver of claim 23 wherein the channel estimator selectively compensates the initial estimates when the received OFDM symbols have a data rate greater than 54 Mbps.