Abstract:
A class of non data-aided cyclic based robust estimators for frequency offset estimation of multi-carrier systems is disclosed. The use of sufficient statistics provides a minimum variance unbiased (MVU) estimate of the frequency offset under complete knowledge of timing offset error. The Neyman-Fisher factorization theorem and Rao-Blackwell-Lehmann-Scheffe theorem are used to identify the sufficient statistic and appropriate mapping functions. It is shown that there is but one function of the sufficient statistics which results in the minimum variance estimate among the possible class of cyclic-based estimators. Also, a moment estimator of frequency offset is provided to obtain a consistent estimate of carrier offset under uncertain symbol timing error. The moment estimator does not rely on any probabilistic assumptions. Thus, its performance is insensitive to the distribution of the additive noise. A unified structure characterizing both the MVU and moment estimators, as well as a maximum likelihood estimator of a related, copending application is disclosed.

Description:
CROSS-REFERENCE TO RELATED APPLICATION 
   This instant application is a divisional application of U.S. application Ser. No. 09/556,858, filed Apr. 21, 2000. This application is also related to application Ser. No. 09/496,890, entitled “Globally Optimum Maximum Likelihood Estimation of Joint Carrier Frequency Offset and Symbol Timing Error,” filed on Mar. 2, 2000, assigned to the assignee of the instant invention, now issued as U.S. Pat. No. 6,678,339, and the disclosure therein is hereby incorporated by reference into the instant application. 

   BACKGROUND OF THE INVENTION 
   1. Field of the Invention 
   The present invention relates to a method for data communication of signals in units of a frame using an orthogonal frequency division modulation (OFDM) algorithm, and in particular, to methods of estimating carrier frequency offset error at the receiver. 
   2. Description of the Prior Art 
   OFDM system is a viable modulation scheme for data transmission time varying dynamic channels. However, it is known that performance of such system is highly susceptible to non-ideal synchronization parameters. Specifically, symbol timing and carrier frequency offset become an increasingly important issue in implementation of OFDM systems for practical applications. It is known that carrier frequency offset deteriorates performance of OFDM systems by introducing interference among the sub-channels. To overcome this imperfection, various compensation methods for estimation and correction of synchronization parameters have been proposed. In order to compare the performance of these estimators, it is required to define a single number representing the goodness of the estimate. Assuming that all estimators are unbiased, i.e., expectation of the estimate is equal to the parameter, the variance of the estimator is used as a global measure for performance comparison of these estimators. 
   Cramer-Rao lower bound (CRLB) is a fundamental lower bound on the variance of the estimators and the unbiased estimator whose variance equals CRLB is called efficient. When the evaluation of efficient estimator is not possible, it is desirable to obtain an estimator in which its performance becomes as close as possible to the CRLB fundamental bound. The estimator which is closest in performance to the CRLB estimator is known as a minimum variance unbiased (MVU) estimator. 
   Categorically, the previously proposed methods for synchronization of OFDM systems can be classified into two main subclasses, namely minimum mean square error (MMSE) and maximum likelihood (ML) estimators. In MMSE approach, the estimator uses the information provided by the reference signal (pilot tones) in order to minimize a cost function associated with the synchronization parameters. A salient feature of this approach is that no probabilistic assumptions are made with regard to the data. Although MMSE estimators usually result in a tractable (globally stable) and easy to implement realization, no optimal criteria (probabilistic) is associated with these estimators. Also, since part of the transmitted information is allocated to the reference pilots, the bandwidth efficiency of these methods is lower in comparison to the non-pilot schemes. 
   On the other hand, ML estimators provide the estimate of the unknown parameter subject to minimum probability of error criteria. Although not exactly efficient, ML estimators are asymptotically MVU, i.e., their variance attains that of MVU estimator as the length of data record goes to infinity. However, due to the physical constraints, systems with infinitely long data records are not feasible for implementation purposes. 
   P. H. Moose, in “A Technique for Orthogonal Frequency Division Multiplexing Frequency Offset Correction,” in IEEE Trans. On Communications, Vol. 42, No. 10, pp. 2908–2913, October 1994, describes the use of a retransmission technique in order to reveal the frequency offset parameter in the likelihood function of the received signal. Due to the redundancy introduced by repeating the data block, the data rate efficiency is decreased by a factor of two. To avoid this imperfection, a ML estimator based on cyclic prefix (CP) is described by J. van de Beck, M. Sandel and P. O. Borjesson, in “ML Estimation of Timing and Frequency Offset in OFDM Systems,” IEEE Trans. On Signal Processing, Vol. 45, No. 3, pp. 1800–1805, July 1997. In this approach, the side information provided by the CP is used to obtain the likelihood function for joint estimation of symbol timing error and frequency offset in an OFDM system. 
   The likelihood function described in the Moose reference does not globally characterize the observation vector over the entire range of the timing offset. Consequently, the ML estimator proposed based on this likelihood function would result in considerable performance loss over a finite range of timing offset interval. 
   Currently, there is increasing interest in multi-carrier modulation (MCM) for dividing a communication channel into several subchannels and transmitting many subcarriers through a single band using frequency division multiplexing (FDM) techniques. In the MCM method, however, because several subcarriers occupying a narrow frequency domain are transmitted at one time, a relatively longer symbol period results compared with a single carrier modulation method. The MCM method has, owing to such characteristics, the advantages that equalization is easily performed and that it has immunity to impulse noise. OFDM is a type of the MCM designed to maximize the working frequency efficiency by securing orthogonality among the multiplexed subcarriers. OFDM is applied to mobile radio channels to attenuate multipath fading. 
   In an OFDM transmitting/receiving system, modulation and demodulation of parallel data are carried out using the Fast Fourier Transform (FFT). It is required that the sampled data be sent in predetermined frames, having passed through a FFT routine, been time-division multiplexed, and transmitted, then restored at the receiving end. However, if the synchronization is in error in the course of restoring the frame, the signals demodulated after the FFT will be influenced by interchannel and intersymbol interference. Accordingly, the problem of synchronization in reforming the frame, especially any joint carrier frequency offset or symbol timing error, must be addressed as a matter of importance. 
   Conventional synchronization methods as above-described encounter problems in that the process of synchronization is not only very complex, but the synchronization is not realized rapidly. 
   SUMMARY OF THE INVENTION 
   Motivated by the sub-optimum performance of estimators of the prior art, a likelihood function for joint estimation of carrier frequency offset and symbol timing error of OFDM systems is disclosed in the related, copending application; and a new optimum ML joint estimator is disclosed therein. In order to reduce the variance of that ML estimator, a new class of MVU estimators for frequency offset estimation of PFDM systems is disclosed herein. 
   There is disclosed to exist but one function of sufficient statistic which provides the MVU estimate of the frequency offset. The estimator provided by the instant invention is a closed form expression; providing an estimator which is a function of data statistic. Consequently, it does not suffer from converging to multiple local minima, a problem which arises in ML technique with nonconvex loglikelihood functions. 
   The advantages of the instant MVU estimator over the class of previously proposed estimators are two; first, it is MVU, therefore its variance is minimum among the entire class of estimators which use the same probabilistic measure. Secondly, it provides a closed form expression for mapping the statistics into the estimation domain. The former property assures optimality of the estimator, while the later facilitate the closed loop analysis of the system. 
   Accordingly, the present invention is directed at a synchronization method that substantially obviates on or more of the problems due to limitations and disadvantages of the prior art. To achieve these and other advantages, and in accordance with the purpose of the invention as embodied and broadly described, there is provided a method of estimating carrier frequency offset error in a received sample bit stream including an observation vector (OV), having an observed carrier frequency timing offset ε, and a plurality of data-symbol frames, having a symbol timing offset error θ. The method comprises the steps of generating a probability density function (PDF) based on the OV and generating from the PDF an estimate of carrier frequency offset error, ε MVU|θ , being a minimum variance unbiased (MVU) estimator. 
   In another aspect of the invention, the OV comprises an L-bit cyclic extension portion and a first and a second N-bit synchronization frame, and wherein the PDF comprises a first term, p 1 , based on the timing offset θ being within the span 1 to N and a second term, p 2 , based on said timing offset θ being within the span N+1 to N+L. In yet another aspect of the invention the received bit stream has uncorrelated independent identically distributed random signal and noise sequence variables with power of σ s   2  and σ n   2 , respectively, wherein the OV is denoted x, and wherein the MVU estimator ε MVU|θ  is the conditional expectation of a second moment estimator, said second moment estimator given by 
   
     
       
         
           
             ɛ 
             ⋓ 
           
           = 
           
             
               ?? 
               
                 2 
                 ⁢ 
                 π 
               
             
             ⁢ 
             ln 
             ⁢ 
             
               { 
               
                 
                   1 
                   
                     L 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     
                       σ 
                       s 
                       2 
                     
                   
                 
                 ⁢ 
                 
                   
                     ∑ 
                     
                       k 
                       = 
                       ϑ 
                     
                     
                       ϑ 
                       + 
                       L 
                       - 
                       1 
                     
                   
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   
                     
                       x 
                       ⁡ 
                       
                         [ 
                         k 
                         ] 
                       
                     
                     ⁢ 
                     
                       
                         x 
                         * 
                       
                       ⁡ 
                       
                         [ 
                         
                           k 
                           + 
                           N 
                         
                         ] 
                       
                     
                   
                 
               
               } 
             
           
         
       
     
   
   In another aspect of the invention the MVU estimator ε MVU|θ  is given by 
                     ɛ   ⋓       MVU   ❘   ϑ       =     E   ⁡     (       ɛ   ⋓     ⁢     ❘       T   1     ⁡     (     x   ,   ϑ     )           )                   =       ??     2   ⁢   π       ⁢   ln   ⁢           ⁢   E   ⁢     {         1     L   ⁢           ⁢     σ   s   2         ⁢       ∑     k   =   ϑ       ϑ   +   L   -   1       ⁢           ⁢       x   ⁡     [   k   ]       ⁢       x   *     ⁡     [     k   +   N     ]             ⁢     ❘       T   1     ⁡     (     x   ,   ϑ     )           }                   =       1     2   ⁢   π       ⁢   ??   ⁢     {     ln   ⁢         T   1     ⁡     (     x   ,   ϑ     )         L   ⁢           ⁢     σ   s   2           }                   
where ℑ is the imaginary operator and where
 
   
     
       
         
           
             
               T 
               1 
             
             ⁡ 
             
               ( 
               
                 x 
                 , 
                 ϑ 
               
               ) 
             
           
           = 
           
             { 
             
               
                 
                   
                     
                       ∑ 
                       
                         k 
                         = 
                         ϑ 
                       
                       
                         L 
                         + 
                         ϑ 
                         - 
                         1 
                       
                     
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     
                       
                         x 
                         ⁡ 
                         
                           [ 
                           k 
                           ] 
                         
                       
                       ⁢ 
                       
                         
                           x 
                           * 
                         
                         ⁡ 
                         
                           [ 
                           
                             k 
                             + 
                             N 
                           
                           ] 
                         
                       
                     
                   
                 
                 
                   
                     1 
                     ≤ 
                     ϑ 
                     ≤ 
                     N 
                   
                 
               
               
                 
                   
                     
                       
                         ∑ 
                         
                           k 
                           = 
                           0 
                         
                         
                           ϑ 
                           - 
                           N 
                           - 
                           1 
                         
                       
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         
                           x 
                           ⁡ 
                           
                             [ 
                             k 
                             ] 
                           
                         
                         ⁢ 
                         
                           
                             x 
                             * 
                           
                           ⁡ 
                           
                             [ 
                             
                               k 
                               + 
                               N 
                             
                             ] 
                           
                         
                       
                     
                     + 
                     
                       
                         ∑ 
                         
                           k 
                           = 
                           ϑ 
                         
                         
                           N 
                           + 
                           L 
                           - 
                           1 
                         
                       
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         
                           x 
                           ⁡ 
                           
                             [ 
                             k 
                             ] 
                           
                         
                         ⁢ 
                         
                           
                             x 
                             * 
                           
                           ⁡ 
                           
                             [ 
                             
                               k 
                               + 
                               N 
                             
                             ] 
                           
                         
                       
                     
                   
                 
                 
                   
                     
                       N 
                       + 
                       1 
                     
                     ≤ 
                     ϑ 
                     ≤ 
                     
                       N 
                       + 
                       L 
                     
                   
                 
               
             
           
         
       
     
   
   The invention also provides a method of synchronizing a received sample bit stream, comprising the steps of transmitting at a transmitter the bit stream including an observation vector (OV), receiving and sampling at a receiver the bit stream, the sampled bit stream including, the OV with an observed carrier frequency offset ε, and a plurality of data-symbol frames, having a symbol timing offset error θ; generating a probability density function (PDF) based on the OV; generating from the PDF an estimate of carrier frequency offset error, ε MVU|θ , being a minimum variance unbiased (MVU) estimator; and synchronizing the received bit stream by the MVU estimate of carrier frequency offset. 
   Further aspects of the synchronization method of the invention include wherein the OV comprises an L-bit cyclic extension portion and a first and a second N-bit synchronization frame, and wherein the PDF comprises a first term, p 1 , based on the observed timing offset θ being within the span 1 to N and a second term, p 2 , based on the observed timing offset θ being within the span N+1 to N+L. In yet another aspect of the invention, the synchronization method provides that the received bit stream has uncorrelated independent identically distributed random signal and noise sequence variables with power of σ s   2  and σ n   2 , respectively, wherein the OV is denoted x, and wherein the MVU estimator ε MVU|θ  is the conditional expectation of a second moment estimator, the second moment estimator given by 
   
     
       
         
           
             ɛ 
             ⋓ 
           
           = 
           
             
               ?? 
               
                 2 
                 ⁢ 
                 π 
               
             
             ⁢ 
             ln 
             ⁢ 
             
                 
             
             ⁢ 
             
               { 
               
                 
                   1 
                   
                     L 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     
                       σ 
                       s 
                       2 
                     
                   
                 
                 ⁢ 
                 
                   
                     ∑ 
                     
                       k 
                       = 
                       ϑ 
                     
                     
                       ϑ 
                       + 
                       L 
                       - 
                       1 
                     
                   
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   
                     
                       x 
                       ⁡ 
                       
                         [ 
                         k 
                         ] 
                       
                     
                     ⁢ 
                     
                       
                         x 
                         * 
                       
                       ⁡ 
                       
                         [ 
                         
                           k 
                           + 
                           N 
                         
                         ] 
                       
                     
                   
                 
               
               } 
             
           
         
       
     
   
   Further aspect of the invention, the synchronization method wherein said MVU estimator ε MVU|θ  is given by 
                     ɛ   ⋓       MVU   ❘   ϑ       =     E   ⁡     (       ɛ   ⋓     ⁢     ❘       T   1     ⁡     (     x   ,   ϑ     )           )                   =       ??     2   ⁢   π       ⁢   ln   ⁢           ⁢   E   ⁢     {         1     L   ⁢           ⁢     σ   s   2         ⁢       ∑     k   =   ϑ       ϑ   +   L   -   1       ⁢           ⁢       x   ⁡     [   k   ]       ⁢       x   *     ⁡     [     k   +   N     ]             ⁢     ❘       T   1     ⁡     (     x   ,   ϑ     )           }                   =       1     2   ⁢   π       ⁢   ??   ⁢     {     ln   ⁢         T   1     ⁡     (     x   ,   ϑ     )         L   ⁢           ⁢     σ   s   2           }                   
where ℑ is the imaginary operator and where
 
   
     
       
         
           
             
               T 
               1 
             
             ⁡ 
             
               ( 
               
                 x 
                 , 
                 ϑ 
               
               ) 
             
           
           = 
           
             { 
             
               
                 
                   
                     
                       ∑ 
                       
                         k 
                         = 
                         ϑ 
                       
                       
                         L 
                         + 
                         ϑ 
                         - 
                         1 
                       
                     
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     
                       
                         x 
                         ⁡ 
                         
                           [ 
                           k 
                           ] 
                         
                       
                       ⁢ 
                       
                         
                           x 
                           * 
                         
                         ⁡ 
                         
                           [ 
                           
                             k 
                             + 
                             N 
                           
                           ] 
                         
                       
                     
                   
                 
                 
                   
                     1 
                     ≤ 
                     ϑ 
                     ≤ 
                     N 
                   
                 
               
               
                 
                   
                     
                       
                         ∑ 
                         
                           k 
                           = 
                           0 
                         
                         
                           ϑ 
                           - 
                           N 
                           - 
                           1 
                         
                       
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         
                           x 
                           ⁡ 
                           
                             [ 
                             k 
                             ] 
                           
                         
                         ⁢ 
                         
                           
                             x 
                             * 
                           
                           ⁡ 
                           
                             [ 
                             
                               k 
                               + 
                               N 
                             
                             ] 
                           
                         
                       
                     
                     + 
                     
                       
                         ∑ 
                         
                           k 
                           = 
                           ϑ 
                         
                         
                           N 
                           + 
                           L 
                           - 
                           1 
                         
                       
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         
                           x 
                           ⁡ 
                           
                             [ 
                             k 
                             ] 
                           
                         
                         ⁢ 
                         
                           
                             x 
                             * 
                           
                           ⁡ 
                           
                             [ 
                             
                               k 
                               + 
                               N 
                             
                             ] 
                           
                         
                       
                     
                   
                 
                 
                   
                     
                       N 
                       + 
                       1 
                     
                     ≤ 
                     ϑ 
                     ≤ 
                     
                       N 
                       + 
                       L 
                     
                   
                 
               
             
           
         
       
     
   
   In another aspect of the invention, A method of estimating carrier frequency offset error is provided for a received sample bit stream including an observation vector (OV), having an observed carrier frequency timing offset ε, and a plurality of data-symbol frames, the OV comprising an L-bit cyclic extension portion and a first and a second N-bit synchronization frame, comprising the steps of generating the expected value of the autocorrelation of the kth entry of the OV; and generating from the expected value an estimate of carrier frequency offset error, ε mom , being a moment estimator. 
   In yet another aspect of the invention, the moment carrier frequency offset error estimation method further includes wherein the OV is denoted x, and wherein the moment estimator ε mom  is given by 
               ɛ   ^     mom     =       ??     2   ⁢   π       ⁢     {     ln   ⁢           ⁢       T   3     ⁡     (   x   )                   
where the statistic T 3 (x) is defined as
 
   
     
       
         
           
             
               T 
               3 
             
             ⁡ 
             
               ( 
               x 
               ) 
             
           
           = 
           
             
               1 
               
                 L 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 
                   σ 
                   s 
                   2 
                 
               
             
             ⁢ 
             
               
                 ∑ 
                 
                   k 
                   = 
                   0 
                 
                 
                   N 
                   + 
                   L 
                   + 
                   1 
                 
               
               ⁢ 
               
                   
               
               ⁢ 
               
                 
                   x 
                   ⁡ 
                   
                     [ 
                     k 
                     ] 
                   
                 
                 ⁢ 
                 
                   
                     
                       x 
                       * 
                     
                     ⁡ 
                     
                       [ 
                       
                         k 
                         + 
                         N 
                       
                       ] 
                     
                   
                   . 
                 
               
             
           
         
       
     
   
   A method of synchronizing a received sample bit stream, is also provided by the invention comprising the steps of: transmitting at a transmitter said bit stream including an observation vector (OV); receiving and sampling at a receiver said bit stream, said sampled bit stream including, said OV with an observed carrier frequency offset ε, and a plurality of data-symbol frames, having a symbol timing offset error θ; generating the expected value of the autocorrelation of the kth entry of the OV; generating from the expected value an estimate of carrier frequency offset error, ε mom , being a moment estimator; and synchronizing the received bit stream by the moment estimate of carrier frequency offset. 
   Further aspect of the invention provides a synchronization method wherein the OV is denoted x, and wherein the moment estimator ε mom  is given by 
               ɛ   ^     mom     =       ??     2   ⁢   π       ⁢     {     ln   ⁢           ⁢       T   3     ⁡     (   x   )                   
where the statistic T 3 (x) is defined as
 
   
     
       
         
           
             
               T 
               3 
             
             ⁡ 
             
               ( 
               x 
               ) 
             
           
           = 
           
             
               1 
               
                 L 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 
                   σ 
                   s 
                   2 
                 
               
             
             ⁢ 
             
               
                 ∑ 
                 
                   k 
                   = 
                   0 
                 
                 
                   N 
                   + 
                   L 
                   + 
                   1 
                 
               
               ⁢ 
               
                   
               
               ⁢ 
               
                 
                   x 
                   ⁡ 
                   
                     [ 
                     k 
                     ] 
                   
                 
                 ⁢ 
                 
                   
                     
                       x 
                       * 
                     
                     ⁡ 
                     
                       [ 
                       
                         k 
                         + 
                         N 
                       
                       ] 
                     
                   
                   . 
                 
               
             
           
         
       
     
   
   In yet another aspect of the invention, a method of estimating carrier frequency offset error in a received sample bit stream including an observation vector (OV), having an observed carrier frequency timing offset ε, and a plurality of data-symbol frames, the OV comprising an L-bit cyclic extension portion and a first and a second N-bit synchronization frame, comprising the steps of: selecting one estimator method from a group of three: a maximum likelihood (ML) estimator, a minimum variance unbiased (MVU) estimator, a moment estimator, based on said OV; and generating from the selected estimator an estimate of carrier frequency offset error. 
   Additional features and advantages of the invention will be set forth in the description which follows, and in part will be apparent from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the methods particularly pointed out in the written description and claims hereof, as well as the appended drawings. 

   
     BRIEF DESCRIPTION OF THE DRAWINGS 
       FIG. 1  is a signal flow block diagram depicting the frequency recovery loop for estimation of frequency offset. 
       FIG. 2  is a block diagram depiction of the ML estimator disclosed in the cross-referenced, copending application and the MVU and moment estimators of the instant invention. 
       FIG. 3  is a graph comparing the computer simulations of the prior art ML frequency offset estimation and the ML frequency offset estimation disclosed in the related, copending application. 
       FIG. 4  is a graph comparing the computer simulations of the MVU frequency offset estimator of the instant invention with that of the CRLB estimator. 
       FIG. 5  graphically depicts the closed loop performance of the MVU estimator of the instant invention by comparing the frequency offset estimate of the closed loop MVU estimator against an analytical derivation thereof. 
   

   DETAILED DESCRIPTION OF THE INVENTION 
   The cross-referenced co-pending application entitled “Globally Optimum Maximum Likelihood Estimation of Joint Carrier Frequency Offset and Symbol Timing Error,” U.S. Ser. No. 09/496,890, filed on Mar. 2, 2000, incorporated herein by reference, discloses a probability density function (PDF),p, which globally characterizes an observation vector x according to the equation 
                   p   ⁡     (     x   ,   ɛ   ,   ϑ     )       =           p   1     ⁡     (     x   ,   ɛ   ,   ϑ     )       ⁢     (       U   ⁡     [     ϑ   -   1     ]       -     U   ⁡     [     ϑ   -   N   -   1     ]         )       +         p   2     ⁡     (     x   ,   ɛ   ,   ϑ     )       ⁢     (       U   ⁡     [     ϑ   -   N   -   1     ]       -     U   ⁡     [     ϑ   -   N   -   L   +   1     ]         )                 (   14   )               
where ε and θ are the frequency offset and symbol timing error introduced by the synchronization mismatch in the carrier frequency and symbol timing, respectively. And p 1  and p 2  are probability density functions derived and described in the related copending application.
 
   Further derived and described therein are the statistics T 1  and T 2    
                     T   1     ⁡     (     x   ,   ϑ     )       =     {               ∑     k   =   ϑ       L   +   ϑ   -   1       ⁢       x   ⁡     [   k   ]       ⁢   x   *     [     k   +   N     ]               1   ≤   ϑ   ≤   N                   ∑     k   =   0       ϑ   -   N   -   1       ⁢       x   ⁡     [   k   ]       ⁢   x   *     [     k   +   N     ]         +       ∑     k   =   ϑ       N   +   L   -   1       ⁢       x   ⁡     [   k   ]       ⁢   x   *     [     k   +   N     ]                   N   +   1     ≤   ϑ   ≤     N   +   L             ⁢     
     ⁢   and               (   15   )                   T   2     ⁡     (     x   ,   ϑ     )       =     {               ∑     k   =   ϑ       L   +   ϑ   -   1       ⁢            x   ⁡     [   k   ]            2       +            x   ⁡     [     k   +   N     ]            2             1   ≤   ϑ   ≤   N                   ∑     k   =   0       ϑ   -   N   -   1       ⁢            x   ⁡     [   k   ]            2       +            x   ⁡     [     k   +   N     ]            2     +       ∑     k   =   ϑ       N   +   L   -   1       ⁢            x   ⁡     [   k   ]            2       +            x   ⁡     [     k   +   N     ]            2               N   +   1     ≤   ϑ   ≤     N   +   L                       (   16   )               
N and L being the number of samples per frame and the number of cyclically-extended samples appended at the beginning of each frame, respectively, all as further described in the related, copending application.
 
   The MVU estimator of the instant invention is derived by resorting to the theory of sufficient statistics. The first step in deriving the MVU estimator is to obtain the sufficient statistic for the PDF given in (14). The sufficient statistic is known to be a function of the observation vector, namely T(x), such that the conditional PDF of the observation vector given T(x) does not depend on the unknown estimation parameters [ε, θ]. Evaluating the sufficient statistic is a formidable task for the broad class of PDFs, however the Neyman-Fisher Factorization theorem can be used for identifying the potential sufficient statistics. According to this theorem, if the PDF can be factored in the form g(T(x), ε, θ,)h(x) where g is a function depending on x only through T(x) and h(x) is a function depending only on x, then T(x) is a sufficient statistic for estimation of the parameters ε and θ. By reformulating the PDF given in 14 to 
             p   ⁡     (     x   ,   ɛ   ,   ϑ     )       =       ⅇ         2   ⁢     ℛ   ⁡     [       ⅇ   j2πɛ     ⁢       T   1     ⁡     (     x   ,   ϑ     )       ⁢        a          ]         -            a        2     ⁢       T   2     ⁡     (     x   ,   ϑ     )             2   ⁢     (     1   -          a        2       )     ⁢     (       σ   s   2     +     σ   n   2       )           ⁢       h   1     ⁡     (   x   )               
there is a direct dependency between the parameter θ and the statistics T 1 (x,θ) and T 2 (x,θ). Based on this observation, the Neyman-Fisher theorem fails to provide a sufficient statistic for estimation of θ, we can factor the PDF into
 
                   p   ⁡     (     x   ,     ɛ   ⁢     ❘   ϑ         )       =       ⅇ       ℛ   ⁡     [       ⅇ   j2πɛ     ⁢       T   1     ⁡     (     x   ,   ϑ     )       ⁢        a          ]           (     1   -          a        2       )     ⁢     (       σ   s   2     +     σ   n   2       )           ⁢       h   2     ⁡     (   x   )                 (   17   )               
Clearly then, T 1 (x,θ) forms a sufficient statistic for estimation of the parameter ε.
 
   Next, application of the Rao-Blackwell-Lehmann-Scheffe (RBLS) theorem is used to find the MVU estimator. According to this theorem, if {hacek over (ε)} is an unbiased estimator of ε and T(x) is a sufficient complete statistic for ε then {circumflex over (ε)}=E({hacek over (ε)}| T(x) ) is a valid, unbiased, MVU estimator of ε. 
   In applying the above theorem, we need to obtain an unbiased estimator of ε, termed {circumflex over (ε)}, and determine the conditional expectation of this estimator given the statistic T 1 (x,θ). An appropriate candidate for the unbiased estimator of ε can be obtained from the statistical moments of the random vector x. The autocorrelation function of the observation vector x, E, yields that the second moment of the random variable x[k] with k∈Ω, satisfies the following identity
 
 E{x[k]x*[k+N]}=σ   s   2   e   −j2πε   (18)
 
Having this observation, one uses the second moment estimator as an unbiased estimator for ε as given by
 
                   ɛ   ⋓     =       ??     2   ⁢   π       ⁢   ln   ⁢     {       1     L   ⁢           ⁢     σ   s   2         ⁢       ∑     k   =   ϑ       ϑ   +   L   -   1       ⁢       x   ⁡     [   k   ]       ⁢   x   *     [     k   +   N     ]           }               (   19   )               
where ℑ is the imaginary operator. In deriving the above estimator, E(x[k]x*[k+N]) was replaced by its natural estimator
 
             1   L     ⁢       ∑     k   =   ϑ       ϑ   +   L   -   1       ⁢       x   ⁡     [   k   ]       ⁢   x   *       [     k   +   N     ]     .               
It is straightforward to verify that this estimator is unbiased as it satisfies the condition
 
                   E   ⁢     {     e   ⋓     }       =         ??     2   ⁢   π       ⁢   ln   ⁢           ⁢   E   ⁢     {       1     L   ⁢           ⁢     σ   s   2         ⁢       ∑     k   =   ϑ       ϑ   +   L   -   1       ⁢       x   ⁡     [   k   ]       ⁢   x   *     [     k   +   N     ]           }       =   ɛ             (   20   )               
Next, one obtains the conditional expectation of {circumflex over (ε)} given the sufficient statistic T 1(x,θ)  as follows
 
   
     
       
         
           
             
               
                 
                   
                     
                       
                         
                           ɛ 
                           ⋓ 
                         
                         
                           MVU 
                           ❘ 
                           ϑ 
                         
                       
                       = 
                         
                       ⁢ 
                       
                         E 
                         ⁡ 
                         
                           ( 
                           
                             
                               ɛ 
                               ⋓ 
                             
                             ⁢ 
                             
                               ❘ 
                               
                                 
                                   T 
                                   1 
                                 
                                 ⁡ 
                                 
                                   ( 
                                   
                                     x 
                                     , 
                                     ϑ 
                                   
                                   ) 
                                 
                               
                             
                           
                           ) 
                         
                       
                     
                   
                 
                 
                   
                     
                       = 
                         
                       ⁢ 
                       
                         
                           ?? 
                           
                             2 
                             ⁢ 
                             π 
                           
                         
                         ⁢ 
                         ln 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         E 
                         ⁢ 
                         
                           { 
                           
                             
                               
                                 1 
                                 
                                   L 
                                   ⁢ 
                                   
                                       
                                   
                                   ⁢ 
                                   
                                     σ 
                                     s 
                                     2 
                                   
                                 
                               
                               ⁢ 
                               
                                 
                                   ∑ 
                                   
                                     k 
                                     = 
                                     ϑ 
                                   
                                   
                                     ϑ 
                                     + 
                                     L 
                                     - 
                                     1 
                                   
                                 
                                 ⁢ 
                                 
                                   
                                     x 
                                     ⁡ 
                                     
                                       [ 
                                       k 
                                       ] 
                                     
                                   
                                   ⁢ 
                                   x 
                                   * 
                                   
                                     [ 
                                     
                                       k 
                                       + 
                                       N 
                                     
                                     ] 
                                   
                                 
                               
                             
                             ⁢ 
                             
                               ❘ 
                               
                                 
                                   T 
                                   1 
                                 
                                 ⁡ 
                                 
                                   ( 
                                   
                                     x 
                                     , 
                                     ϑ 
                                   
                                   ) 
                                 
                               
                             
                           
                           } 
                         
                       
                     
                   
                 
                 
                   
                     
                       = 
                         
                       ⁢ 
                       
                         
                           1 
                           
                             2 
                             ⁢ 
                             π 
                           
                         
                         ⁢ 
                         ?? 
                         ⁢ 
                         
                           { 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               
                                 
                                   T 
                                   1 
                                 
                                 ⁡ 
                                 
                                   ( 
                                   
                                     x 
                                     , 
                                     ϑ 
                                   
                                   ) 
                                 
                               
                               
                                 L 
                                 ⁢ 
                                 
                                     
                                 
                                 ⁢ 
                                 
                                   σ 
                                   s 
                                   2 
                                 
                               
                             
                           
                           } 
                         
                       
                     
                   
                 
               
             
             
               
                 ( 
                 21 
                 ) 
               
             
           
         
       
     
   
   It is important to emphasize that since the underlying PDF given in (14) belongs to the exponential family of PDFs, then the sufficient statistics T 1 (x,θ) forms a complete statistic for estimation of the parameter ε. Therefore, the mapping function obtained from applying RBLS theorem, namely lnT(x,θ), is but one function of the statistic T 1 (x,θ) and no other estimator with the same statistic can result in a lower variance with respect to MVU estimator. 
   A. Cramer-Rao Lower Bound 
   It is known that under broad conditions, the variance of any unbiased estimator of a nonrandom parameter ε satisfies the CRLB as 
                   var   ⁡     (       ɛ   ⋓       MVU   ❘   ϑ       )       ≥     1     I   ⁡     (   ɛ   )                 (   22   )               
where I(ε) is the Fisher Information given by
 
                   I   ⁡     (   ɛ   )       =     -     E   ⁡     [           ∂   2     ⁢   ln     ⁢           ⁢     pr   ⁡     (     x   ,     ɛ   ⁢     ❘   ϑ         )           ∂     ɛ   2         ]                 (   23   )               
Substituting (17) into (23), after some algebraic manipulations, the CRLB of the MVU estimator becomes
 
                   var   ⁡     (       ɛ   ⋓         MVU        ϑ       )       =           (     1   -          a        2       )     ⁢     (       σ   s   2     +     σ   n   2       )             (     2   ⁢   π     )     2     ⁢        a        ⁢   E   ⁢     {       T   1     ⁡     (     x   ,   ϑ     )       }         =           (     1   +     1   SNR       )     2     -   1           (     2   ⁢   π     )     2     ⁢   L                 (   24   )               
where
 
           SNR   ⁢     =   Δ     ⁢       σ   S   2       σ   N   2             
is the signal to noise ratio at the receiving end.
 
B. Closed Loop Performance
 
     FIG. 1  is a signal flow block diagram depicting the frequency recovery loop for estimation of frequency offset according to the instant invention. A closed loop system is obtained by feeding back the information obtained from the estimator into a sampler block (bootstrap). A sampler  10  updates its frequency at the beginning of each observation vector (every (N+L) samples). The sampler  10  receives the latest signal and produces the sampled symbol stream x[k] therefrom which is conducted to a block  12  and a block  14  performing the autocorrelation operation on the observation vector as required by equation (19). The result of the autocorrelation operation is conducted to a moving average (MA) filter block  16  and therefrom to a block  18  performing the natural logarithm function and thence to a block  20  performing the imaginary operation function, as required by equation (19). To match the various sampling frequencies used in the system, a down sampler (decimator) block  22  is used prior to return to the sampler  10  to produce the minimum variance unbiased estimator, {circumflex over (ε)}[m]. Finally, a gain block (G)  24  is used to control the closed loop characteristic of the system (stability, settling time, noise sensitivity). 
   According to  FIG. 1 , the frequency offset for the mth observation vector can be expressed as 
                           ɛ   ^     ⁡     [   m   ]       =       ⁢       1     2   ⁢   π       ⁢   ln   ⁢     1     L   ⁢           ⁢     σ   S   2         ⁢       ∑     i   =   0       L   -   1       ⁢         x     (     m   -   1     )       ⁡     [   i   ]       ⁢     ⅇ       -   j     ⁢       2   ⁢   π   ⁢           ⁢       ɛ   ^     ⁡     [     m   -   1     ]       ⁢     (     ϑ   +   i     )       N     ⁢   G                             ⁢         x     (     m   -   2     )     *     ⁡     [   i   ]       ⁢     ⅇ     j   ⁢       2   ⁢   π   ⁢           ⁢       ɛ   ⋒     ⁡     [     m   -   2     ]       ⁢     (     ϑ   +   i     )       N     ⁢   G                     =       ⁢       1     2   ⁢   π       ⁢   ln   ⁢           ⁢     1     L   ⁢           ⁢     σ   s   2         ⁢     e     j   ⁢       2   ⁢   π   ⁢           ⁢     Δ   ^     ⁢           ⁢     ɛ   ⁡     [     m   -   1     ]       ⁢     (   ϑ   )       N         ⁢       ∑     i   =   0       L   -   1       ⁢         x     (     m   -   1     )       ⁡     [   i   ]       ⁢       x     (     m   -   2     )     *     ⁡     [   i   ]                             ⁢     ⅇ       -   j     ⁢       2   ⁢   π   ⁢           ⁢   Δ   ⁢           ⁢       ɛ   ⋒     ⁡     [     m   -   1     ]       ⁢     (   i   )       N                       (   25   )               
where Δ{circumflex over (ε)}[m−1]           (ε[m−1]−ε)[m−2])G and x m [i]         x[m(N+L)+θ+i]. The term inside the sum is a stochastic quantity and does not have a closed form expression. However, for reasonably high signal to noise ratio it can be well approximated by its expected value (E[x (m−1) [i]x* (m−2) [i]]=σ s   2 ). Therefore, the expression inside the sum can be written as

                           ∑     i   =   0       L   -   1       ⁢     ⅇ       -   j     ⁢       2   ⁢   π   ⁢           ⁢   Δ   ⁢                 ⁢   ɛ     ^     ⁡     [     m   -   1     ]       ⁢     (   i   )       N           =       ⁢       1   -     ⅇ       -   j     ⁢       2   ⁢   π   ⁢           ⁢   Δ   ⁢           ⁢       ɛ   ⋒     ⁡     [     m   -   1     ]       ⁢   L     N             1   -     ⅇ       -   j     ⁢       2   ⁢   π   ⁢           ⁢   Δ   ⁢           ⁢       ɛ   ⋒     ⁡     [     m   -   1     ]         N                         =       ⁢       ⅇ       -   j     ⁢       2   ⁢   π   ⁢           ⁢   Δ   ⁢           ⁢     ɛ   ⁡     [     m   -   1     ]       ⁢     (     L   -   1     )         2   ⁢   N           ⁢       sin   ⁡     (       Δ   ⁢           ⁢       ɛ   ^     ⁡     [     m   -   1     ]       ⁢   L       2   ⁢   N       )         sin   ⁡     (       Δ   ⁢           ⁢       ɛ   ^     ⁡     [     m   -   1     ]           2   ⁢   N       )                         Δ   ⁢           ⁢       ɛ   ^     ⁡     [     m   -   1     ]         →     0   ⁢         ⁢     ⅇ       -   j     ⁢       2   ⁢   π   ⁢           ⁢   Δ   ⁢           ⁢       ɛ   ^     ⁡     [     m   -   1     ]           2   ⁢   N       ⁢   L                       (   26   )               
Substituting (26) into (25), after some algebraic manipulations, the frequency offset of m&#39;th observation vector becomes
 
                     ɛ   ^     ⁡     [   m   ]       =       -     (         ɛ   ^     ⁡     [     m   -   1     ]       -       ɛ   ^     ⁡     [     m   -   2     ]         )       ⁢     G   N     ⁢     (     ϑ   +       L   -   1     2       )               (   27   )               
The above equation represents a second order finite difference system in which its dynamic can be obtained from solving the following equation
 {circumflex over (ε)}[ m]+β{circumflex over (ε)}[m− 1]−β{circumflex over (ε)}[ m− 2]=0 
where
 
           β   ⁢     =   Δ     ⁢       G   N     ⁢       (     ϑ   +       L   -   1     2       )     .             
Clearly, the solution to the above finite difference equation is the form of
 {circumflex over (ε)}[ m]=c   1 ( z   1 ) m   +c   2 ( z   2 ) m   (28) 
where
 
             z     1   ,   2       ⁢     =   Δ     ⁢         -   β     ±         β     2   +       ⁢   4   ⁢   β         2           
are two dynamical modes of the system. The smaller root (negative) results in a high frequency oscillation in the frequency offset estimate. However, as is shown in a computer simulation, infra, this term is filtered out by the moving average filter. To assure stability, the gain block should be set such that both poles lie inside the unit circle.
 |β max +√{square root over (β 2  max+4β max)}|≦2  (29) 
where
 
   
     
       
         
           
             
               
                 
                   β 
                   max 
                 
                 ⁢ 
                 
                   = 
                   Δ 
                 
                 ⁢ 
                 
                   
                     
                       max 
                       ϑ 
                     
                     ⁢ 
                     
                       
                         G 
                         N 
                       
                       ⁢ 
                       
                         ( 
                         
                           ϑ 
                           + 
                           
                             
                               L 
                               - 
                               1 
                             
                             2 
                           
                         
                         ) 
                       
                     
                   
                   = 
                   
                     
                       G 
                       N 
                     
                     ⁢ 
                     
                       ( 
                       
                         N 
                         + 
                         L 
                         + 
                         
                           
                             L 
                             - 
                             1 
                           
                           2 
                         
                       
                       ) 
                     
                   
                 
               
             
             
               
                 ( 
                 30 
                 ) 
               
             
           
         
       
     
   
   It is known that when the timing offset parameter is not known to the receiver or if the noise PDF differs from Gaussian distribution, finding the optimum estimator (ML, MVU, CRLB) may not be an easy task. However there exists a moment estimator which provides a consistent estimate for estimation of frequency offset regardless of noise distribution and timing offset values. Although there is no optimum criterion associated with the moment estimator due to its simple structure, it is frequently used as an initial estimate for other estimators such as ML estimator. Consider a sequence of first N+L samples of vector x. Using the autocorrelation of kth entry of this vector satisfies the following identity Moment Estimator 
                     r   xx     ⁡     [   N   ]       =     {             σ   s   2     ⁢     ⅇ       -   j     ⁢           ⁢   2   ⁢   π   ⁢           ⁢   ɛ               k   ∈   Ω             0         k   ∉   Ω                     (   31   )               
Using Base Rule, the expected value of the above function (with respect to parameter k) can be expressed as
 
                           E   k     ⁡     [       r   xx     ⁡     [   N   ]       ]       =       ⁢         σ   s   2     ⁢     exp     -   j2πɛ       ⁢     pr   ⁡     (     k   ∈   Ω     )         +     0   ⁢           ⁢     pr   ⁡     (     k   ∉   Ω     )                       =       ⁢       L     L   +   N       ⁢     σ   s   2     ⁢     exp     -   j2πɛ                       (   32   )               
Substituting the Nth autocorrelation lag with its natural estimator, the moment estimator for frequency offset under uncertain timing offset can be found as
 
                     ɛ   ^     mom     =       ??     2   ⁢   π       ⁢     {     ln   ⁢           ⁢       T   3     ⁡     (   x   )         }               (   33   )               
where the statistic T 3 (x) is defined as
 
                     T   3     ⁡     (   x   )       =       1     L   ⁢           ⁢     σ   s   2         ⁢       ∑     k   =   0       N   +   L   +   1       ⁢       x   ⁡     [   k   ]       ⁢   x   *     [     k   +   N     ]                   (   34   )               
Statistical assessment of moment estimator is a formidable task over entire range of SNR. However, for relatively high SNR, the random observation vector is heavily concentrated about its mean. Using the statistical linearization, and a first-order Taylor expression of the estimator about its mean to obtain the variance of estimate. In doing so, one substitutes for the random variable x in (34) and obtains
 
                           T   3     ⁡     (     [   x   ]     )       =       ⁢     f   ⁡     (     [     s   ,   w     ]     )                   =       ⁢       ??   ln     ⁢     {     L   ⁢           ⁢     σ   s   2     ⁢       ∑     k   =   0       N   +   L   -   1       ⁢     (         s   ⁡     [     k   -   ϑ     ]       ⁢     exp     j   ⁢       2   ⁢   π   ⁢           ⁢   k   ⁢           ⁢   ɛ     N           +           ⁢     w   ⁡     [   k   ]         )                             ⁢     (     s   *     [     k   -   ϑ   +           ⁢   N     ]     ⁢           ⁢     exp         -   j     ⁢       2   ⁢     π   ⁡     (     k   +   N     )       ⁢   ɛ     N       +     w   *     [     k   +   N     ]             )     }                 (   35   )               
where the signal (s) and noise (w) vector are defined as
 s           [s[0]] . . . s[N+L−1]] w         [w[0]] . . . w[N+L−1]]  (36,37)
   By virtue of the above equation, the expected value of observation vector for a fixed realization of signal vector s would be E[ε mom ]=ƒ(s). Then performing a first order Taylor expansion of ƒ([s.w]) about the point Ew [x]  yields 
                               ɛ   ^     mom     =       ⁢         f   ⁡     (     [     s   ,   0     ]     )       +       ∇     wf   ⁡     (     [     s   ,   0     ]     )         *   w       =     f   (     s   ,   0     ]         )     +                   ⁢         ∑     n   =   0       L   +   N   -   1       ⁢       ∂     f   ⁡     (     [     s   ,   w     ]     )           ∂     w   ⁡     [   n   ]             |       (     w   =   0     )       w   ⁡     [   n   ]                         (   38   )               
Taking the derivative of (35) with respect to w[n] and setting w=0, results in
 
   
     
       
         
           
             
               
                 
                   
                     
                       
                         ∂ 
                         h 
                       
                       
                         ∂ 
                         
                           w 
                           ⁡ 
                           
                             [ 
                             n 
                             ] 
                           
                         
                       
                     
                      
                   
                   ⁢ 
                   w 
                 
                 = 
                 
                   0 
                   = 
                     
                   ⁢ 
                   
                     
                       1 
                       
                         2 
                         ⁢ 
                         π 
                       
                     
                     ⁢ 
                     
                       
                         ( 
                         
                           
                             ∑ 
                             
                               i 
                               = 
                               0 
                             
                             
                               N 
                               + 
                               L 
                               - 
                               1 
                             
                           
                           ⁢ 
                           
                             
                               s 
                               ⁡ 
                               
                                 [ 
                                 
                                   i 
                                   - 
                                   ϑ 
                                 
                                 ] 
                               
                             
                             ⁢ 
                             s 
                             * 
                             
                               [ 
                               
                                 i 
                                 - 
                                 ϑ 
                                 + 
                                 N 
                               
                               ] 
                             
                             ⁢ 
                             
                               ⅇ 
                               
                                 - 
                                 j2πɛ 
                               
                             
                           
                         
                         ) 
                       
                       
                         - 
                         1 
                       
                     
                   
                 
               
             
           
           
             
               
                   
                 ⁢ 
                 
                   s 
                   * 
                   
                     [ 
                     
                       n 
                       + 
                       N 
                       - 
                       ϑ 
                     
                     ] 
                   
                   ⁢ 
                   
                     ⅇ 
                     
                       
                         2 
                         ⁢ 
                         π 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         
                           ɛ 
                           ⁡ 
                           
                             ( 
                             
                               n 
                               + 
                               N 
                             
                             ) 
                           
                         
                       
                       N 
                     
                   
                 
               
             
           
         
       
     
   
   The second term in (38) represents the contribution of noise in the estimate. Knowing that noise samples are iid with power of σ w   2 , the variance of estimate can be obtained from 
                   var   ⁡     (   ɛ   )       =         ∑     n   =   0       L   +   N   -   1       ⁢              s   ⁡     [     n   +   N   -   ϑ     ]            2     ⁢     σ   w   2             (     2   ⁢   π   ⁢       ∑     i   =   0       N   +   L   -   1       ⁢       s   ⁡     [     i   -   ϑ     ]       ⁢   s   *     [     i   -   ϑ   +   N     ]           )     2               (   39   )               
For sufficiently large block lengths (N), the above term can be well approximated as
 
   
     
       
         
           
             
               
                 
                   
                     var 
                     ⁡ 
                     
                       ( 
                       ɛ 
                       ) 
                     
                   
                   ≅ 
                   
                     
                       
                         ( 
                         
                           N 
                           + 
                           L 
                         
                         ) 
                       
                       ⁢ 
                       
                         σ 
                         s 
                         2 
                       
                       ⁢ 
                       
                         σ 
                         w 
                         2 
                       
                     
                     
                       
                         ( 
                         
                           2 
                           ⁢ 
                           π 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           L 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           
                             σ 
                             s 
                             2 
                           
                         
                         ) 
                       
                       2 
                     
                   
                 
                 = 
                 
                   
                     ( 
                     
                       N 
                       + 
                       L 
                     
                     ) 
                   
                   
                     
                       
                         ( 
                         
                           2 
                           ⁢ 
                           π 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           L 
                         
                         ) 
                       
                       2 
                     
                     ⁢ 
                     SNR 
                   
                 
               
             
             
               
                 ( 
                 40 
                 ) 
               
             
           
         
       
     
   
   The resemblance between the estimators of equations (21) and (33) reveals a unified structure which characterizes the ML, MVU and moment estimators which can be classified into a single unified structure. This provides a unique framework for analysis of the proposed estimators. Moreover, it allows an investigation of the effect of symbol timing error in the estimation of carrier offset for each individual estimator. Comparing the MVU estimator given in (21) to the moment estimator in (33) reveals some similarities in the structure of the estimators. Clearly, both moment and MVU estimators use the same mapping function, namely the log function, to project the data statistics into the estimation domain. The only difference is in the form of statistics used for each scheme. 
     FIG. 2  is a block diagram depiction of the ML estimator disclosed in the cross-referenced, copending application and the MVU and moment estimators of the instant invention. An autocorrelation operation on the observation vector x[k] is performed by blocks  30  and  34 ; as shown in  FIG. 2 , both estimators of the instant invention obtain the statistic by correlating the samples with the Nth delayed samples. This operation is performed by using a moving average (MA) filter (shown as a block  36 ) in the structure of estimators. However, the MVU and moment estimators use different upper and lower bound for the MA filter. In the moment estimator, the averaging is performed over the first N+L samples of the observation vector. This would remove the requirement of knowing the exact timing offset parameter in estimation of carrier frequency offset. However, the estimate obtained from using this estimator results in a less accurate estimate (more variance) in comparison to MVU estimate. On the other hand, the MVU estimator requires the knowledge of symbol timing in the estimation of carrier frequency offset, as shown in  FIG. 2  by a block  38  conducting θ to the MA block  36 . Finally, as in  FIG. 1 , a block  40  and a block  42  perform the natural logarithm and imaginary, respectively, operations on the symbol stream before generating the estimate of carrier frequency offset ε. 
   Although the resemblance between MVU and ML estimators may not be as evident as that of MVU and moment estimator, it can be shown that ML estimator can also be classified into the same family. Knowing the fact that ℑ{log T 1(x,θ) }=∠T 1 (x,θ) the ML estimator can be expressed as 
                   ɛ   ML     =         -   1       2   ⁢   π       ⁢   ??   ⁢     {       ∑     k   =   α     β     ⁢     x   *     [   k   ]     ⁢     x   ⁡     [     k   +   N     ]           }               (   41   )               
where the parameters α and β are functions of θ ML  and can be obtained from the expression for T 1 (x,θ), supra. Thus, the ML estimator falls into the same family of estimators.  FIG. 2  also displays in tabular form these estimators, their respective summation upper and lower bounds, and their respective averaging intervals. It is noticed that the ML estimator provides the upper and lower bound of the moving average filter (36) by extracting the timing parameter from the likelihood function. Although the ML estimator has the advantage of exploiting the entire bandwidth by removing the requirement for having pilot tones, the symbol timing estimate obtained from the ML estimator has a larger confidence interval. This may result in a considerable performance degradation in comparison to the pilot-based schemes.
 
   Computer simulation is used to assess the performance of the three estimators for synchronization of an OFDM system. The variance of estimator is used as a performance measure through the study. The simulation parameters used are typical of the OFDM and digital audio broadcast (DAB) environments. More specifically, the chosen FFT size (N) for OFDM is 64. Unless otherwise specified, the length of cyclic prefix (L), signal to noise ratio, and frequency offset are set to 8, 20 dB and 0.01, respectively. Monte Carlo simulation is used to evaluate the performance of the three estimators. 
     FIG. 3  graphically depicts a comparison between the performance of the ML frequency offset estimator disclosed in the related, copending application with the prior art ML frequency offset estimator given in the van de Beek, et al, reference over the range of timing offset parameter (θ∈[1, N+L]). 
     FIG. 4  graphically depicts the performance of the MVU frequency offset estimator of the instant invention under complete knowledge of timing offset error. A careful examination of the variances reveals that the gap between MVU estimator and CRLB tends to zero as SNR increases. Also as illustrated in  FIG. 4 , the departure from CRLB happens rapidly as SNR goes below a threshold. The threshold also depends on the length of CP and is moved toward lower SNRs as L increases. This can be justified in terms of having more observation samples in estimating the unknown parameter. The choice of cyclic prefix length L represents a tradeoff between data rate reduction and performance (lower variance). Increasing L brings the performance of MVU estimator closer to the CRLB, nevertheless, it could result in a considerable data rate reduction due to the redundancy introduced by CP. 
     FIG. 5  graphically depicts the closed loop performance of the MVU estimator of the instant invention by comparing the frequency offset estimate of the closed loop MVU estimator and the analytical derivation given in equation (28). It is clear that the simulation result very closely resembles the analytical model, thus consolidates the approximate model of the closed loop system. 
   Numerous variations and modifications will become evident to those skilled in the art once the disclosure is fully appreciated. It is intended that the following claims be interpreted to embrace all such variations and modifications.