Abstract:
Orthogonal frequency division multiplexing (OFDM) receiver embodiments of the invention provide timing misalignment estimation by calculating the intra-baud timing differential. The preferred method exploits the spectral structure of the short-preamble in that a time delay in the time-domain is manifest as a phase rotation in the frequency-domain. The timing misalignment is determined by special processing the spectral peaks of the modified short-preamble. An alternative embodiment linearly combines the two long-preamble symbols to construct a single “best estimate” long-preamble symbol. A normalized dot product of the “best estimate” long-preamble symbol and the ideal on-baud symbol is computed to obtain the magnitude of the timing misalignment. A dot product between the “best estimate” long-preamble symbol and the time derivative of the ideal on-baud sampled sequence is computed to obtain the sign of the timing misalignment.

Description:
BACKGROUND OF THE INVENTION  
         [0001]    1. Technical Field  
           [0002]    The invention relates to physical layer (PHY) digital signal processing for use in processors developed for wireless local area networks (LAN&#39;s), and more particularly to wireless LAN&#39;s based on orthogonal frequency division multiplexing (OFDM) in the license-free national information structure (U-NII) radio spectrum bands in the United States and generally conforming to IEEE Specification 802.11a.  
           [0003]    2. Description of the Prior Art  
           [0004]    Local area networks (LAN&#39;s) have traditionally been interconnected by twisted-wire pairs and shielded cables. However, there are several deficiencies of traditional LAN&#39;s. The main being restricted mobility. In contrast, a whole class of untethered computing has emerged which uses complex modulation and coding to achieve high-speed data rates. The IEEE 802.11a standard, herein “802.11a”, specifies, among other things, the physical layer (PHY) entity for an orthogonal frequency division multiplexing (OFDM) system with data payload communication capabilities of 6, 9, 12, 18, 24, 36, 48, and 54 Mb/s. The 802.11a standard specifies RF transmission in the 5.15-5.25, 5.25-5.35, and 5.725-5.825 GHZ unlicensed national information structure (U-NII) bands.  
           [0005]    Typically, the IEEE communication standards specify the transmit bit-stream in addition to performance specifications, RF emissions requirements, etc. The wireless transmission medium inherently introduces some unique impairments (not present in traditional LAN&#39;s) to the transmitted signal which must be mitigated in the remote receiver station. These impairments include signal fading, multi-path reflections, base- and remote-unit oscillator mismatch introduced frequency offset, timing misalignment, and timing synchronization. In addition, there are RF hardware limitations such as receiver IQ imbalance and phase noise that must be mitigated as well. As such, the mitigation of such effects falls under the category of baseband digital signal processing. To assist the remote unit in mitigating these effects, a known training sequence is usually embedded into the transmit bit stream; this occurs at the expense of bandwidth. Of course, the same problems occur in the upstream direction (remote station transmitting to the base station), but it suffices to discuss the downstream digital signal processing.  
           [0006]    In this disclosure, one such digital signal processing method, timing misalignment, is outlined. The term “timing misalignment” refers to the intra-baud timing offset between a received baud-rate sampled signal and what would be its on-baud sampled version. Without correction, the samples obtained are most likely to be off-baud and can cause serious degradation in demodulation. Note that the use of an equalizer supercedes the timing misalignment function when enabled. Therefore, the timing misalignment function can be used in certain situations only (when the transmission channel is simply described by a direct line-of-sight component and Gaussian noise for example).  
           [0007]    It is assumed that some form of frequency correction has been applied to the signal prior to performing synchronization estimation. One embodiment of coarse frequency estimation is disclosed in “Coarse Frequency Offset Estimation—Patent Disclosure”, Alain Chiodini, John Reagan, nBand Communications, 2000. In addition, it is assumed that data synchronization so that a timing reference is known. One embodiment of timing synchronization is disclosed in “OFDM Data Demodulator Timing Synchronization—Patent Disclosure”, John Reagan, Alain Chiodini, nBand Communications, 2000.  
           [0008]    Conventional methods for establishing timing misalignment estimation and correction are correlation with fractional baud misaligned reference signals. However, there are several disadvantages of this type of approach. These are: (a) several sequences need to be stored locally, i.e. the reference signal that is offset by k/N baud where k=−16:16, N=16, and (b) the prestored sequence does not account for signal distortions (A/D, quantization effects, phase distortion, IQ imbalance, . . . ) which results in non-optimal correlation values.  
           [0009]    The transmission scheme in 802.11a is bursty. This means that the receivers must digitally process the training sequence to mitigate the undesired signal impairments each time a burst commences. This means that it is desirable for the processing blocks to be as robust and computationally efficient as possible. For example, to reduce computational complexity, the timing misalignment function can be used in lieu of an equalizer in situations when the transmission channel is simply described by a direct line-of-sight component and Gaussian noise.  
         SUMMARY OF THE INVENTION  
         [0010]    Orthogonal frequency division multiplexing (OFDM) receiver embodiments of the invention provide timing misalignment estimation by calculating the intra-baud timing differential. The preferred method exploits the spectral structure of the modified short-preamble in that a time delay in the time-domain is manifest as a phase rotation in the frequency-domain. The timing misalignment is determined by special processing the spectral peaks of the short-preamble.  
           [0011]    An alternative embodiment linearly combines the two long-preamble symbols to construct a single “best estimate” long-preamble symbol. A normalized dot product of the “best estimate” long-preamble symbol and the ideal on-baud symbol is computed to obtain the magnitude of the timing misalignment. A dot product between the “best estimate” long-preamble symbol and the time derivative of the ideal on-baud sampled sequence to obtain the sign of the timing misalignment. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0012]    [0012]FIG. 1 is a functional block diagram of an OFDM radio-transceiver embodiment of the invention;  
         [0013]    [0013]FIG. 2 is a diagram representing the sampling of the short preamble used in training sequences for the physical layer (PHY) of a wireless local area network (LAN) conforming to the IEEE-802.11a Specification;  
         [0014]    [0014]FIG. 3 is a diagram representing the structure of the synchronizing PLCP preamble, signal, and data fields used for the physical layer (PHY) of a wireless local area network (LAN) conforming to the IEEE-802.11a Specification;  
         [0015]    [0015]FIG. 4 is a flowchart of a first embodiment of the invention for determining the timing misalignment from the short preamble interval in the structure of FIG. 2; and  
         [0016]    [0016]FIG. 5 is a flowchart of a second embodiment of the invention for determining the timing misalignment from the long-preamble interval in the structure of FIG. 2. 
     
    
     DETAILED DESCRIPTION OF THE INVENTION  
       [0017]    [0017]FIG. 1 illustrates a wireless local area network (LAN) embodiment of the invention, which is referred to herein by the general reference numeral  100 . Such embodiment is preferably based on orthogonal frequency division multiplexing (OFDM), and quadrature amplitude modulated (QAM) of signals transmitted in the license-free 5 GHz frequency band. The wireless LAN  100  typically includes a wireless network  101  connected to the Internet, a PHY-transmitter  102 , and a PHY-receiver  103 . Such all conform to the IEEE-802.11a specification for a physical layer (PHY) interface in a wireless local area network which allows mobile clients. The transmitter  102  comprises a digital signal processor (DSP)  104  which implements a forward error correction (FEC) coder  106 , an interleaving and mapping process  108 , an inverse fast Fourier transform processor  110 , and a symbol wave shaper  112 . The DSP  104  outputs in-phase (I) and quadrature-phase (Q) signals that are input to an IQ modulator  114  driven by a local oscillator  116 . The modulated output is sent to a mixer  118  for upconversion to the five GHz band. A second local oscillator  120  provides the necessary carrier frequency. A high power amplifier (HPA)  122  drives a transmitter antenna  124 . A radio up-link  125  is received by the wireless network  101 . In general, the transmitter  102  can be implemented with conventional methods and components.  
         [0018]    The receiver  103  receives a radio down-link  126  that is typically transmitted in packets. Each packet is begun with a training sequence, e.g, a short and long preamble. The receiver  103  includes a receiver antenna  128  followed by a low-noise amplifier (LNA)  130 . A local oscillator  132  and a first mixer  134  produce an intermediate frequency (IF). An automatic gain control (AGC) amplifier  136  smoothes out signal-strength variations and drives an IQ-detector  138 . A second local oscillator  140  provides the carrier necessary to derive the I/Q samples, e.g. 16-bit binary at 20.0 MHz. In all embodiments of the present invention, no automatic frequency control (AFC) clock recovery is needed because any frequency offset errors are corrected in later digital processing. A receiver-DSP  142  comprises a fast Fourier transform process  144 , a demapping and deinterleaving process  146 , and an FEC decoder  148 . The receiver-DSP  142  further includes the necessary digital logic needed for carrier frequency offset determination and correction.  
         [0019]    The higher levels of the mobile client are represented by a media access controller (MAC)  150  and a client agent software  152 .  
         [0020]    A first embodiment of the invention for timing misalignment detection and correction works with the short preamble. A real signal constructed from the complex time-domain signal associated with the short preamble is discrete Fourier transform processed to gather timing misalignment information. The short preamble is comprised of ten 0.8 μs duration, i.e. 16-sample long at sampling frequency=20 MHz, sequences. The short preamble is mainly used for packet detection and coarse frequency offset estimation. In the absence of any frequency offset or other distorting effect, the short preamble is characterized by its imaginary (quadrature-phase) part which corresponds to its real (in-phase) part in almost every particular. The principle difference is the imaginary (quadrature-phase) part is delayed 0.4 μs (eight sample times) with respect to the real (in-phase) part.  
         [0021]    Such phenomenon can be taken advantage of to decrease signal waveform processing complexity by simply adding real (in-phase) and imaginary (quadrature-phase) parts together. The resulting signal is characterized by a repeating 0.4 μs duration, eight-sample waveform δ(t). Then a 3.2 μs duration, i.e. 64-sample sequence is extracted from the short preamble. Spectrum-wise, this signal exhibits three equidistant, equal-amplitude frequency peaks. Assuming that the beginning of thee first 8-sample sequence of Δ(t) coincides with that of δ(t), timing offset information embedded within the phase of each of these frequency peaks can be represented with,  
                 Φ   1          (   t   )       =                  π   4          (     1   +     t     T   S         )                       Φ   2          (   t   )       =                  π   4          (     1   +     2        t     T   S           )                       Φ   3          (   t   )       =                    3      π     4          (       -   1     +     t     T   S         )                                   
 
         [0022]    where  
       1     T   S                           
 
         [0023]    designates the sampling frequency (20 MHz).  
         [0024]    The phase of such frequency peaks Φ 1 , Φ 2  and Φ 3  varies with the timing offset and depend on any misalignment existing between Δ(t) and δ(t). An intra-baud timing offset, or timing misalignment, τ ( ) can be derived from Φ 1 , Φ 2  and Φ 3 . For example, a received signal can be represented by,  
               Ψ        (   t   )       =                    Φ   1          (   t   )       +     2          Φ   2          (   t   )         +       Φ   3          (   t   )                     =                    π   4          (     1   +     t     T   S         )       +     2                   π   4          (     1   +     2                   t     T   S           )       +         3      π     4          (       -   1     +     t     T   S         )                     =                2      π                     t     T   S       .                                   
 
         [0025]    In practice, Ψ=(X 8 P 1 )(X 16 P 2 ) 2 (X 24 P 3 ), where X k  and P n  respectively designate 64-point fast Fourier transform frequency components and the phase correcting coefficients needed compensate for phase offset errors cause by a misalignment between Δ(t) and δ(t). Plotting this results in a sawtooth waveform that reflects timing misalignment independent of timing offset.  
         [0026]    The timing misalignment τ is expressed as a fraction of T s , and is  
       τ   =       Ψ   π     .                           
 
         [0027]    In general, preferred implementations of the present invention are designed to compute a 64-point fast Fourier transform rather than a three-point discrete Fourier transform.  
         [0028]    [0028]FIG. 2 is a diagram representing the sampling of the short preamble used in training sequences for the physical layer (PHY) of a wireless local area network (LAN) conforming to the IEEE-802.11a Specification.  
         [0029]    [0029]FIG. 3 is a diagram representing the structure of the synchronizing PLCP preamble, signal, and data fields used for the physical layer (PHY) of a wireless local area network (LAN) conforming to the IEEE-802.11a Specification.  
         [0030]    [0030]FIG. 4 represents an embodiment of the invention for timing misalignment determination in a radio receiver, and is referred to herein by the general reference numeral  400 . The embodiment  400  comprises a step element  402  for correcting a frequency offset and determining a boundary between a short preamble and a long preamble in a received radio signal; exemplary embodiments of these functions are described in “Coarse Frequency Offset Estimation—Patent Disclosure”, Alain Chiodini, John Reagan, nBand Communications, 2000 and “OFDM Data Demodulator Timing Synchronization—Patent Disclosure”, John Reagan, Alain Chiodini, nBand Communications, 2000. A step element  404  constructs a real signal from a complex time-domain signal associated with the short preamble. A step element  406  extracts a n-sample (n is preferably a power of 2 or 4 so that RADIX-2 or RADIX-4 FFT may be used subsequently) sequence from a portion of the short preamble to obtain a plurality of equidistant equal amplitude frequency peaks. A step element  408  determines a timing misalignment estimate by inspecting the relative phases of the plurality of equidistant equal amplitude frequency peaks. The objective is to thereafter be able to demodulate data encoded in the received radio signal. The step element  404  may include in-phase and quadrature-phase sampling of the received radio signal to obtain a real part and an imaginary part. The real and imaginary parts are assumed to be similar to one another except for a fixed time-skew between them. The step element  404  may also include a simple addition of the real and imaginary parts to obtain the real signal. The step element  408  can be such that phase of a set of three frequency peaks Φ 1 , Φ 2  and Φ 3  is assumed to vary with timing misalignment between Δ(t) and δ(t), and an intra-baud timing offset τ can be derived from Φ 1 , Φ 2  and Φ 3 , wherein, a received signal can be represented by,  
               Ψ        (   t   )       =                    Φ   1          (   t   )       +     2          Φ   2          (   t   )         +       Φ   3          (   t   )                     =                    π   4          (     1   +     t     T   S         )       +     2                   π   4          (     1   +     2                   t     T   S           )       +         3      π     4          (       -   1     +     t     T   S         )                     =                2      π                   t     T   S                                     
 
         [0031]    and, Ψ=(X 8 P 1 )(X 16 P 2 ) 2 (X 24 P 3 ), where X k  and P n  respectively designate 64-point fast Fourier transform frequency components and the phase correcting coefficients needed compensate for phase offset errors cause by a misalignment between Δ(t) and δ(t), and the timing misalignment τ is expressed as a fraction of T s , and is  
       τ   =       Ψ   π     .                           
 
         [0032]    The step of determining preferably computes a 64-point fast Fourier transform rather than a three-point discrete Fourier transform. A step element  410  is then able to demodulate the transmitted data.  
         [0033]    A second embodiment of the invention for timing misalignment and correction works with the long preamble rather than the short preamble. It is assumed that the position of the boundary between short and long preambles has been accurately determined. The two 64-sample long sequences that constitute the long preamble are linearly combined using least squares techniques to obtain an improved signal. This method captures the essential characteristics of the received signal and minimizes the impact of residual frequency offset and other distortions on the quality of estimation. The absolute value of any timing misalignment is estimated by computing a normalized dot product of the resulting signal and the ideal on-baud sequence whose derivative is used to determine the sign through the calculation of a second dot product. The minimization of the cost function (in the least square sense) described hereafter leads to two complex coefficients (also called weighting coefficients) that are used to combine the two 64-sample long sequences mentioned above into one idealized 64-sample sequence.  
               C        (       α   1     ,     α   2       )       =                           R   →     on     -       [             X   →     1             X   →     2           ]          [           α   1               α   2           ]              2                 =                    (         R   →     on     -       [             X   →     1             X   →     2           ]          [           α   1               α   2           ]         )     H          (         R   →     on     -       [             X   →     1             X   →     2           ]          [           α   1               α   2           ]         )                   =                  (         R   →     on   H     -       α   1   *            X   →     1   H       -       α   2   *            X   →     2   H         )          (         R   →     on     -       α   1            X   →     1                    -     α   2              X   →     2       )                                           =                           R   →     on          2     -     2        Re        (       α   1   *            X   →     1   H            R   →     on       )         -     2        Re        (       α   2   *            X   →     2   H            R   →     on       )         +                                2        Re        (       α   1   *          α   2            X   →     1   H            X   →     2       )         +              α   1          2                   X   →     1          2       +              α   2          2                   X   →     2          2                                     
 
         [0034]    where,  
         [0035]    {right arrow over (X)} 1 ={right arrow over (C)} 1 ·×{right arrow over (R)} off +{right arrow over (N)} 1  is the first sequence of the long preamble,  
         [0036]    {right arrow over (X)} 2 ={right arrow over (C)} 2 ·×{right arrow over (R)} off +{right arrow over (N)} 2  is the second one,  
         [0037]    {right arrow over (R)} on  and {right arrow over (R)} off  respectively designate the on-baud and off-baud sampled reference sequence,  
         [0038]    α 1  and α 2  are the weighting coefficients,  
           C   →     1     =                       j                   ϕ   1                          j2π                   v     F   s         +     j                   ϕ   1                   ⋮                    j2π                   v     F   s          63     +     j                   ϕ   1                 ,     
              C   →     2     =                       j                   ϕ   2                          j2π                   v     F   s         +     j                   ϕ   2                   ⋮                    j2π                   v     F   s          63     +     j                   ϕ   2                 ,   and                                   
 
         [0039]    νdesignates the frequency offset.  
         [0040]    Minimizing C(α 1 ,α 2 ) with respect to α 1  and α 2 ,  
                 ∂   C       ∂     α   1         =                    -       R   →     on   H              X   →     1       +       α   2   *            X   →     2   H            X   →     1       +       α   1   *                   X   →     1          2                     =                  -       ∑     n   =   0     63              R   on   *          (   n   )              R   off          (   n   )                   j2π                   v     F   s          n     +     j                   ϕ   1                 +                                  α   2   *               j        (       ϕ   1     -     ϕ   2       )                ∑     n   =   0     63                   R   off          (   n   )            2         +       α   1   *          (                R   →     off          2     +     σ   N   2       )                     =                    -          jϕ   1            P     +       α   1   *          (     S   +     σ   N   2       )       +       α   2   *               j        (       ϕ   1     -     ϕ   2       )            S                                   
 
                 ∂   C       ∂     α   1         =                    -       R   →     on   H              X   →     2       +       α   1   *            X   →     1   H            X   →     2       +       α   2   *                   X   →     2          2                     =                  -       ∑     n   =   0     63              R   on   *          (   n   )              R   off          (   n   )                   j2π                   v     F   s          n     +     j                   ϕ   2                 +                                  α   1   *               j        (       ϕ   2     -     ϕ   1       )                ∑     n   =   0     63                   R   off          (   n   )            2         +       α   2   *          (                R   →     off          2     +     σ   N   2       )                     =                    -          jϕ   2            P     +       α   1   *               j        (       ϕ   2     -     ϕ   1       )            S     +       α   2   *          (     S   +     σ   N   2       )                                     
 
             with:                     σ   N   2       =           N   →     1   H            N   →     1       =         N   →     2   H            N   →     2           ,     S   =         ∑     n   =   0     63                                R   off          (   n   )            2                   and                 P       =       ∑     n   =   0     63                         R   on   *          (   n   )              R   off          (   n   )                     -   j2π          v     F   s          n       .                                   
 
         [0041]    In preferred embodiments of the invention, it is assumed that {right arrow over (N)} 1   H {right arrow over (N)} 2 ={right arrow over (N)} 1   H {right arrow over (X)} 2 ={right arrow over (N)} 2   H {right arrow over (X)} 1 ={right arrow over (N)} 1   H {right arrow over (R)}={right arrow over (N)} 2   H {right arrow over (R)}=0. Such assumption may not be exactly true in reality, but dramatically simplifies the equations and therefore the computer processing required. This proceeds as,  
       {                   ∂   C       ∂     α   1         =   0                   ∂   C       ∂     α   2         =   0           ⇒       [           S   +     σ   N   2                    j        (       ϕ   1     -     ϕ   2       )            S                      j        (       ϕ   2     -     ϕ   1       )            S           S   +     σ   N   2             ]          [           α   1   *               α   2   *           ]         =         [                  jϕ   1          P                      jϕ   2          P           ]     ⇔     [           α   1               α   2           ]       =             1         (     S   +     σ   N   2       )     2     -     S   2              [           S   +     σ   N   2               -          j        (       ϕ   2     -     ϕ   1       )              S                 -          j        (       ϕ   1     -     ϕ   2       )              S           S   +     σ   N   2             ]            [                  -     jϕ   1              P   *                        -     jϕ   2              P   *             ]       ⇔     [           α   1               α   2           ]       =           P   *         2      S     +     σ   N   2              [                -     jϕ   1                        -     jϕ   2               ]       .                                 
 
         [0042]    In the absence of any timing misalignment, frequency offset or Gaussian noise, the weighting coefficients are simply,  
         [           α   1               α   2           ]     =         1   2          [                -     jϕ   1                        -     jϕ   2               ]       .                           
 
         [0043]    A reconstructed signal {right arrow over (Z)} is,  
               Z   →     =                    α   1            X   →     1       +       α   2            X   →     2                     =                    P   *         2      S     +     σ   N   2              (              -     jϕ   1              (             C   →     1     ·     ×       R   →     off       +       N   →     1       )       +            -     jϕ   2              (             C   →     2     ·     ×       R   →     off       +       N   →     2       )         )                   =                    P   *         2      S     +     σ   N   2              (       2          C   →     ·     ×       R   →     off       +     N   →       )                         With:                     C   →       =                                     1                  j2π        v     F   s                         ⋮                        j2π        v     F   s          63                 ,                               
 
         [0044]    Looking closer at P*,  
               P   *     =                  ∑     n   =   0     63                         R   off   *          (   n   )              R   on          (   n   )                   -   j2π          v     F   s          n                   =                  ∑     n   =   0     63                         (         R   on          (   n   )       +     Δ        (   n   )         )     *            R   on          (   n   )                   -   j2π          v     F   s          n                       =                  P   on   *     +       ∑     n   =   0     63                         Δ   *          (   n   )              R   on          (   n   )                   -   j2π          v     F   s          n                     =                  P   on   *     +       P   Δ   *     .                                   
 
         [0045]    Because R on (32−n)=R on (32+n) for n=1 . . . 31 and R on (0)=−R on (32), P* on  can be rewritten as,  
         P   on   *     =                R   on          (   0   )            2     +         (                R   on          (   32   )            2     +     2          ∑     n   =   1     31                                R   on          (     32   +   n     )            2          cos        (     2      π        v     F   s          n     )               )            Γ        (   v   )                         -   j2π          v     F   s          32       .                               
 
         [0046]    Because Γ(ν) is real and much greater than |R on (0)| 2 , the result is  
         ∠                   P   on   *       ≅       -   2        π        v     F   s          32                           
 
         [0047]    radian. Thus, P* is composed of two phase coefficients, a first one (P* on ) centers the frequency offset related phase component around Z(32), and the second one (P* Δ ) contains timing-misalignment information. Once {right arrow over (Z)} has been computed, the absolute value and sign of the timing misalignment are determined by computing dot products, as in,  
         γ   value     =                  Z   →     H            R   →     on                       R   →     on          2              λ   max         λ   max     -     λ   min                                 
 
         [0048]    Where: {λ max ,λ min }=eig(M H M) with M=[{right arrow over (X)} 1  {right arrow over (X)} 2 ].  
         γ   sign     =       Re   (         Z   →     H            ∂       R   →     on         ∂   t         )     .                           
 
         [0049]    Because Λ=M H M is a 2×2 matrix, det(Λ)=λ max λ min  and trace(Λ)=λ max λ   min . It is then easy to get back to λ max  and λ min .  
         [0050]    The timing misalignment is deduced from γ value  and γ sign , e.g.  
       τ   =       f        (       γ   value     ,     γ   sign       )       =       sign        (     γ   sign     )                  -     332   791            log        (     γ   value     )           .                               
 
         [0051]    Plotting γ value =g(τ) for  
       τ   ∈     [       -       T   s     2       ,       T   s     2       ]                           
 
         [0052]    results in a symmetrical heap function that peaks with a γ value  of 1.00 at a zero timing misalignment, and drops to γ value  of 0.55 at a normalized timing misalignment of ±0.5.  
         [0053]    Embodiments of the invention all operate well at low signal-to-noise ratios and in the presence of a relatively large residual frequency offsets. The second embodiment of the invention presented herein is preferred for lower signal-to-noise ratio signals. Any performance deterioration at high signal-to-noise ratios can probably be corrected by regularizing the covariance matrix, e.g. using Tikhonov regularization.  
         [0054]    [0054]FIG. 5 represents a second embodiment of the invention for timing misalignment determination in a radio receiver, and is referred to herein by the general reference numeral  500 . The embodiment  500  comprises a step element  502  for determining a boundary between a short preamble and a long preamble in a received radio signal; an exemplary method of doing this is listed in “OFDM Data Demodulator Timing Synchronization—Patent Disclosure”, John Reagan, Alain Chiodini, nBand Communications, 2000. A step element  504  linearly combines samples of two long sequences from the long preamble to obtain an idealized sequence of samples. A step element  506  computes a normalized dot product of the idealized sequence of samples and an ideal on-baud sampled sequence to obtain a magnitude estimate of any timing misalignment. A step element  508  computes a dot product of the idealized sequence of samples and the time derivative of the ideal on-baud sampled sequence mentioned above to obtain the sign of the timing misalignment if any. Thus data encoded in the received radio signal may thereafter be demodulated in step element  510 . The steps of linearly combining and computing can use a cost function, mathematically described by,  
               C        (       α   1     ,     α   2       )       =                           R   →     on     -       [         X   →     1                       X   →     2       ]          [           α   1               α   2           ]              2                 =                    (         R   →     on     -       [         X   →     1                       X   →     2       ]          [           α   1               α   2           ]         )     H          (         R   →     on     -       [         X   →     1                       X   →     2       ]          [           α   1               α   2           ]         )                   =                  (         R   →     on   H     -       α   1   *            X   →     1   H       -       α   2   *            X   →     2   H         )          (         R   →     on     -       α   1            X   →     1       -       α   2            X   →     2         )                   =                           R   →     on          2     -     2        Re        (       α   1   *            X   →     1   H            R   →     on       )         -     2        Re        (       α   2   *            X   →     2   H            R   →     on       )         +                                2        Re        (       α   1   *          α   2            X   →     1   H            X   →     2       )         +              α   1          2                   X   →     1          2       +              α   2          2                   X   →     2          2                                     
 
         [0055]    where,  
         [0056]    {right arrow over (X)} 1 ={right arrow over (C)} 1 ·×{right arrow over (R)} off +{right arrow over (N)} 1  is the first sequence of the long preamble,  
         [0057]    {right arrow over (X)} 2 ={right arrow over (C)} 2 ·×{right arrow over (R)} off +{right arrow over (N)} 2  is the second one,  
         [0058]    {right arrow over (R)} on  and {right arrow over (R)} off  respectively designate the on-baud and off-baud sampled reference sequence,  
         [0059]    α 1  and α 2  are the weighting coefficients,  
           C   →     1     =                       j                   ϕ   1                          j                 2      π                   v     F   s         +     j                   ϕ   1                   ⋮                    j                 2                 π                   v     F   s          63     +     j                   ϕ   1                 ,     
              C   →     2     =                       j                   ϕ   2                          j                 2      π                   v     F   s         +     j                   ϕ   2                   ⋮                    j                 2                 π                   v     F   s          63     +     j                   ϕ   2                 ,   and                                   
 
         [0060]    ν designates the frequency offset.  
         [0061]    and, minimizing C(α 1 ,α 2 ) with respect to α 1  and α 2  yields,  
                 ∂   C       ∂     α   1         =                    -       R   →     on   H              X   →     1       +       α   2   *            X   →     2   H            X   →     1       +       α   1   *                   X   →     1          2                     =                  -         ∑     n   =   0       63              R   on   *          (   n   )              R   off          (   n   )                   j2π                   v     F   s          n     +     j                   ϕ   1                 +       α   2   *               j        (       ϕ   1     -     ϕ   2       )                                            ∑     n   =   0       63                   R   off          (   n   )            2       +       α   1   *          (                R   →     off          2     +     σ   N   2       )                     =                    -          j                   ϕ   1              P     +       α   1   *          (     S   +     σ   N   2       )       +       α   2   *               j        (       ϕ   1     -     ϕ   2       )            S                                   
 
                 ∂   C       ∂     α   2         =                    -       R   →     on   H              X   →     2       +       α   1   *            X   →     1   H            X   →     2       +       α   2   *                   X   →     2          2                     =                  -         ∑     n   =   0       63              R   on   *          (   n   )              R   off          (   n   )                   j2π                   v     F   s          n     +     j                   ϕ   2                 +       α   1   *               j        (       ϕ   2     -     ϕ   1       )                                            ∑     n   =   0       63                   R   off          (   n   )            2       +       α   2   *          (                R   →     off          2     +     σ   N   2       )                     =                    -          j                   ϕ   2              P     +       α   1   *               j        (       ϕ   2     -     ϕ   1       )            S     +       α   2   *          (     S   +     σ   N   2       )                           With   :     σ   N   2       =           N   →     1   H            N   →     1       =         N   →     2   H            N   →     2           ,     S   =           ∑     n   =   0       63                     R   off          (   n   )            2                   and                 P       =         ∑     n   =   0       63              R   on   *          (   n   )              R   off          (   n   )                   -   j                   2      π                   v     F   s          n                                     
 
         [0062]    The method preferably assumes that {right arrow over (N)} 1   H {right arrow over (N)} 2 ={right arrow over (N)} 1   H {right arrow over (X)} 2 ={right arrow over (N)} 2   H {right arrow over (X)} 1 ={right arrow over (N)} 1   H {right arrow over (R)}={right arrow over (N)} 2   H {right arrow over (R)}=0, although such is not exactly true in reality, and thereby reduces the overall computer processing required. Thus, the process can continue with,  
       {                   ∂   C       ∂     α   1         =   0                   ∂   C       ∂     α   2         =   0           ⇒       [           S   +     σ   N   2                    j        (       ϕ   1     -     ϕ   2       )            S                      j        (       ϕ   2     -     ϕ   1       )            S           S   +     σ   N   2             ]          [           α   1   *               α   2   *           ]         =         [                  j                   ϕ   1            P                      j                   ϕ   2            P           ]     ⇔     [           α   1               α   2           ]       =             1         (     S   +     σ   N   2       )     2     -     S   2              [           S   +     σ   N   2               -          j        (       ϕ   2     -     ϕ   1       )              S                 -          j        (       ϕ   1     -     ϕ   2       )              S           S   +     σ   N   2             ]            [                    -   j                     ϕ   1              P   *                          -   j                     ϕ   2              P   *             ]       ⇔     [           α   1               α   2           ]       =         P   *         2      S     +     σ   N   2              [                  -   j                     ϕ   1                          -   j                     ϕ   2               ]                                   
 
         [0063]    in the absence of any timing misalignment, frequency offset or Gaussian noise, the weighting coefficients are simply,  
         [           α   1               α   2           ]     =         1   2          [                  -   j                     ϕ   1                          -   j                     ϕ   2               ]       .                           
 
         [0064]    The method is such that the steps of linearly combining and computing produce an Γ(ν) that is real and much greater than |R on (0)| 2 , and the result is  
         ∠P   on   *     ≅       -   2        π                   v     F   s          32                           
 
         [0065]    radian, and wherein, P* is composed of two phase coefficients, a first one (P* on ) centers the frequency offset related phase component around Z(32), and the second one (P* Δ ) contains timing-misalignment information. A result {right arrow over (Z)} is found, and the absolute value and sign of the timing misalignment can be determined by computing dot products, as in,  
         γ   value     =                  Z   →     H            R   →     on                       R   →     on          2              λ   max         λ   max     -     λ   min                                 
 
         [0066]    where: {λ max ,λ min }=eig(M H M) with M=[{right arrow over (X)} 1  {right arrow over (X)} 2 ], and  
         γ   sign     =       Re        (         Z   →     H            ∂       R   →     on         ∂   t         )       .                           
 
         [0067]    Although the invention is described herein with reference to the preferred embodiment, one skilled in the art will readily appreciate that other applications may be substituted for those set forth herein without departing from the spirit and scope of the present invention. Accordingly, the invention should only be limited by the Claims included below.