Abstract:
A received signal comprises a continuous sequence of symbols φ 1 , φ 2 , . . . φ n , each represented by a sequence of samples X 0 , X 2 , . . . X n−1 , and wherein the symbols have a guard period GP of duration T gp  at the beginning thereof. Each guard period contains a cyclic prefix with the same subsequence of samples as a tail end portion of the associated symbol. The symbols are identified by delaying the received signal by a fixed number of samples, computing the correlation of the received signal with the delayed signal, computing the summation of said correlation over a window of duration T i , wherein T i &gt;T gp , and sliding the window over the correlation to find a characteristic point or region. The start of each symbol for further processing is selected from the characteristic point or region. By increasing the duration of the window, more robust performance can be achieved, especially in multipath conditions.

Description:
FIELD OF THE INVENTION  
       [0001]    This invention relates to the field of digital communications, and in particular to a method and apparatus for symbol synchronization in modulated transmission schemes, such as orthogonal frequency division multiplexing (OFDM). 
       BACKGROUND OF THE INVENTION  
       [0002]    In digital wireless communication systems, such as digital TV broadcasting systems, electromagnetic waves radiated from the transmitter can arrive at the receiver following multiple paths, with each path resulting in a copy of the transmitted signal with possibly different time delay, phase distortion and energy attenuation. This is the so-called multipath phenomenon. 
         [0003]    There are several digital TV standards developed and deployed in the world. Among these are the DVB-T standard used in Europe and most countries in Asia, Africa, Australia and New Zealand, and the ISDB-T standard used in Japan and Brazil. Both standards use OFDM as the modulation and multiplexing scheme in the physical layer due to the relative robustness of OFDM to the so-called multipath phenomenon. In OFDM, the transmitted data is coded in a sequence of symbols that are modulated onto a large number of adjacent orthogonal carriers. OFDM modulation is described, for example, in “Data transmission by frequency division multiplexing using the discrete Fourier transform”, Weinstein, S. B et al. IEEE Transactions on Communication Technology Vol. COM-19, No. 15, October 1971, the contents of which are herein incorporated by reference. 
         [0004]    The effect of the multipath phenomenon in OFDM can be seen in the channel impulse response (CIR), which has a positive maximum delay spread. Multipath effects result in inter-symbol interference (ISI), which is a major problem in wireless communication systems, particularly with regard to synchronization. 
         [0005]    There are two different OFDM modes: the burst packet mode and the continuous mode. In the burst packet mode, a received signal burst may arrive at the receiver at any time, and the burst may have varying number of OFDM symbols. Systems using this mode include ITU 802.11a and 802.16. Typically in this mode, a training signal (preamble) is transmitted at the beginning of each signal burst. Symbol synchronization is done using this preamble. In the continuous mode, OFDM symbols are transmitted continuously and regularly, but usually no preamble is provided for synchronization purposes. Systems in this mode include DVB-T and ISDB-T. 
         [0006]    In order to address the synchronization problem in the continuous mode, the symbols, which are transmitted as a sequence of samples, are separated by a guard period (GP). Each OFDM symbol consists of a guard period, which usually is a cyclic prefix CP, followed by a so-called FFT part. The samples in the GP are identical to the samples in the tail end of the FFT part. The cyclic prefix is described in the paper “On Synchronization in OFDM Systems Using the Cyclic Prefix”, Proceedings of Radio Vetenskaplig Konferens (REVK &#39;96), pp. 663-667, Lulea, Sweden, June 1996, the contents of which are herein incorporated by reference. 
         [0007]    It is well known that in OFDM, if the GP is longer than the CIR (channel impulse response) maximum delay spread, and if the symbol synchronization method provides a symbol start point within some tolerable range, then there will be no ISI (inter symbol interference) in the receiver, i.e., the FFT part of each symbol is free of ISI. When referring herein to ISI, we mean ISI in the FFT part of an OFDM symbol. However, OFDM is highly sensitive to symbol synchronization error. The expression ISI-free region is used herein to refer to the aforementioned tolerable range for the symbol start point that results in no ISI in the FFT part of the symbol. 
         [0008]    An important feature of digital TV broadcasting is the use of Single Frequency Network (SFN) as a typical network scheme. In a SFN, neighboring broadcast stations broadcast the same signal simultaneously, which can help to improve receiver signal strength. However, SFN generates an artificial multipath effect, which may result in a CIR maximum delay spread much longer than the GP. In this case, ISI is unavoidable, and the symbol synchronization method requires a more accurate symbol start point to minimize ISI. 
         [0009]    Symbol synchronization methods can be performed in the time domain or frequency domain. The frequency domain synchronization is performed after FFT operation. A common scheme is to use a time domain synchronization method to do coarse symbol synchronization, and use a frequency domain synchronization method to do fine symbol synchronization. 
         [0010]    Conventional algorithms for the symbol synchronization in time domain are MLE (Maximum Likelihood Estimation) using the cyclic prefix of the OFDM symbols as described in US2001622633B1. This method achieves ideal performance only in the AWGN (Additive White Noise Gaussian) channel. To further improve the MLE estimation performance in the AWGN channel, methods using averaging over multiple OFDM symbols and filtering of the estimation results have been proposed. However, when the channel condition becomes severely degraded, data in the GP is badly contaminated by ISI, which leads to significant fluctuation of the synchronization output. To improve the performance of MLE, some schemes have been proposed utilizing GP and pilot tones (US20070098096A1) and GP and PN (pseudo-random) sequence (US20070036234A1), GP and training symbols. These methods perform better under multipath channel conditions. However, a fluctuation still exists because of the ISI contamination in GP and the limited number of pilot tones used for estimation. To mitigate the fluctuation, U.S. Pat. No. 5,732,113A1 uses specially designed training symbols in the time domain to define timing functions. 
         [0011]    Chorng-Ren Sheu and Chia-Chi Huang, “A Novel Guard Interval based ISI Free Sampling Region Detection Method for OFDM Systems”, Proceedings of IEEE Vehicular Technology Conference, September 2004, describes a scheme for estimating ISI-free boundary using the characteristics of the guard period and combining the techniques of the delay conjugate multiplication module, phase differential operation, symbol-by-symbol averaging and edge detection. According to the authors, this method guarantees the estimated OFDM start position within the ISI-free region and avoids the negative effect of ISI. 
         [0012]    However, the current OFDM symbol synchronization methods are not accurate in multipath channel conditions. 
       SUMMARY OF THE INVENTION  
       [0013]    An object of the invention is to improve the accuracy of symbol synchronization, especially in multipath channel conditions. Embodiments of the invention provide a novel OFDM symbol synchronization method suitable for use in an in-door digital TV receiver. The novel method is both simple and has good performance to find optimal symbol synchronization output. In particular embodiments of the invention permit a suitable start position for a symbol to be located in a sequence of received samples. 
         [0014]    According to a first aspect of the invention there is provided a method of identifying a symbol for further processing in a received signal representing a physical medium wherein the received signal may travel over more than one path, wherein the received signal comprises a continuous sequence of symbols φ 1 , φ 2 , . . . φ n , each represented by a sequence of samples X 1 , X 2 , . . . X n , and wherein the symbols have a guard period of duration T gp  at the beginning thereof, each guard period containing a cyclic prefix with the same subsequence of samples as a tail end portion of the associated symbol, the method comprising: delaying the received signal by a fixed number of samples; computing the correlation of the received signal with the delayed signal; computing the summation of said correlation over a window of duration T i , wherein T i &gt;T gp ; sliding said window over the correlation to find a characteristic point or region; and deriving the start of each symbol for further processing from said characteristic point or region. The physical medium may, for example, be sound or video images. 
         [0015]    When the CIR maximum delay spread is less than the duration of the guard period T gp , it is possible to find a region free of inter-symbol interference. In this case, the method according to an embodiment of the invention will identify a plateau or flat region in the summation with the substantially greatest value, known as the top-flat region. For the ISI-free region as defined above, the start of the symbol can be found by subtracting a fixed value, typically the duration of the sliding window, from a point within this region. The left boundary of the region defines the point where the ISI from the previous symbol disappears. The right boundary defines the point where the ISI from the next symbol starts. Unlike the prior art, the invention allows a point for the start of the symbol to be found that is well clear of the boundaries, for example, by finding a point represented by the average of the boundaries. This ensures a more robust performance than is possible with the prior art. 
         [0016]    While the invention offers an improvement when the summation window T i  is greater than T gp , in a preferred embodiment it is 2T gp . In accordance with the principles of the invention, the length of the summation window T i  is deliberately set to be greater than T gp . A practical lower limit could be T i &gt;1.1 T gp . 
         [0017]    When the CIR maximum delay spread is greater than the duration of the guard period T gp , some degree of inter-symbol interference is inevitable. In this case the characteristic point or region is a peak associated with the point of substantially least inter-symbol interference. The start point is again located by subtracting from the peak a fixed time value to find the point of substantially least inter-symbol interference. Of course, it will be understood by one skilled in the art, that by selecting a point not precisely at the peak, the inter-symbol interference may not be strictly a minimum, but nonetheless tolerable, and such an embodiment is intended to be encompassed within the scope of the invention. 
         [0018]    The correlation may be computed for each symbol by computing the product of the complex conjugate of the received signal and the delayed signal, or the product of the received signal and the complex conjugate of the delayed signal. The summation is performed on the magnitude of the product. 
         [0019]    Typically, the received signal is an OFDM signal containing OFDM symbols, for example a DVB-T TV signal. 
         [0020]    In accordance with another aspect the invention provides an apparatus for demodulating a received signal representing a physical medium wherein the received signal may travel over more than one path, wherein the received signal comprises a continuous sequence of symbols φ 1 , φ 2 , . . . φ n , each represented by a sequence of samples X 1 , X 2 , . . . X n , and wherein the symbols have a guard period of duration T gp  at the beginning thereof, each guard period containing a cyclic prefix with the same subsequence of samples as a tail end portion of the associated symbol, the apparatus comprising: an analog-to-digital converter for converting the received signal to digital form; 
         [0021]    a synchronization unit configured to:
       (I) delay the received signal by a fixed number of samples;   (ii) compute the correlation of the received signal with the delayed signal;   (iii) compute the summation of said correlation over a window of duration T i , wherein T i &gt;T gp ;   (iv) slide said window over the correlation to find a characteristic point or region; and   (v) derive the start of each symbol for further processing from said characteristic point or region; and
 
a demodulator for demodulating each symbol identified by the synchronization unit in step (v).
       
 
         [0027]    In a still further aspect the invention provides a method of identifying a start time of a symbol in a wireless signal, where the symbol is separated from a previous symbol by a guard period GP, and the GP includes a sequence of samples identical with the last sequence of samples in the symbol, comprising: a) receiving the guarded symbol including the GP and the symbol; b) delaying the guarded symbol by GP to obtain a delayed version of the guarded symbol; c) processing the guarded symbol and the delayed version to identify a start-time interval characterized by a low inter-symbol interference; and d) selecting the start time for symbol in the time interval. 
         [0028]    Low inter-symbol interference in this context means either no inter-symbol interference, which is possible when CIR maximum delay spread is less than the guard period, or either minimum inter-symbol interference when CIR maximum delay spread is greater than the guard period duration, or at least inter-symbol interference that has been reduced to an acceptable level. Clearly, it is not essential to operate precisely at the point of minimum inter-symbol interference in order to benefit from the invention, even though that is what represents the optimum point. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS  
         [0029]    The invention will now be described in more detail, by way of example only, with reference to the accompanying drawings, in which; 
           [0030]      FIG. 1  is a simplified block diagram of an OFDM transmitter; 
           [0031]      FIG. 2  is a simplified block diagram of an OFDM receiver; 
           [0032]      FIG. 3  is a diagram of an OFDM symbol with guard period; 
           [0033]      FIG. 4  shows the results of a correlation in the absence of multipath effects; 
           [0034]      FIG. 5  shows the results of performing a one guard period integration; 
           [0035]      FIG. 6  shows the results of performing a two-guard period integration in the case of no multipath effects; 
           [0036]      FIG. 7  shows the correlation received on different paths; 
           [0037]      FIG. 8  shows the effects of one GP length sliding window summation (which is referred to herein as 1-GP integration) for the case of  FIG. 7 ; 
           [0038]      FIG. 9  shows the effects of two GP length sliding window summation (which we call 2-GP integration) for the case of  FIG. 7 ; 
           [0039]      FIG. 10  shows the case with no overlapping guard periods, where inter-symbol interference is present; 
           [0040]      FIG. 11  shows the effect of 1-GP integration in the case of  FIG. 10 ; 
           [0041]      FIG. 12  shows the effect of 2-GP integration in the case of  FIG. 10 ; 
           [0042]      FIG. 13   a  shows a simulated 2-GP integration for a channel with an impulse response as shown in  FIG. 13   b;    
           [0043]      FIG. 14  is a block diagram for implementing a synchronization unit in accordance with an embodiment of the invention. 
       
    
    
     DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS  
       [0044]    In  FIG. 1 , a data signal s[n] consisting of a sequence of bits is passed through a serial-to-parallel converter  10  to constellation mapping units  12   1  . . .  12   n , which output parallel sets of values [χ 0 . . . χ n ]. These in turn are passed through an inverse Fast Fourier Transform (IFFT) unit  13 . The output of the IFFT unit passes through a parallel-to-serial converter  15  whose output is pre-pended with GP in unit  17  to create OFDM time domain symbols φ 1 , φ 2 , φ 3 , . . . , represented by the sample vectors [X 0 , X 1 , . . . X n ]. The samples are passed through the digital-to-analog converter  14 , and modulator  16  to produce the transmitted RF signal. 
         [0045]    In the receiver, shown in  FIG. 2 , the reverse process occurs. The incoming RF signal is down-converted to baseband by downconverters  18 , and passed through analog-to-digital converter  20  to synchronization unit  30 . This will normally be implemented in software in a digital signal processor  31 , but could also be implemented in hardware. 
         [0046]    The OFDM symbols φ 1 , φ 2 , φ 3 , . . . whose start positions are identified in the synchronization unit  30 , have their GP part removed in unit  21 . The resulting FFT part of each symbol are serial-to-parallel converted in unit  23 , and are then passed through Fast Fourier Transform unit  22 , to recover the values[X 0  . . . X n−1 ] for input to the constellation demappers  24 . These in turn output the original data s[n]. It should be noted that while it is conventional to put the IFFT in the transmitter and the FFT in the receiver, these units form a linear pair and can be reversed. 
         [0047]    In order to correctly transform the incoming data in the FFT unit  22 , the start of the incoming OFDM symbols output from the ADC must be properly identified. Each OFDM symbol comprises the vector consisting of samples [X 0  . . . X n−1 ]. Symbol synchronization determines the correct symbol start position, which, with a T gp  offset, determines the FFT window start position before the FFT demodulation at the receiver. The FFT window is a time domain region within which samples are viewed as FFT part of an OFDM symbol. If the estimated start position of the OFDM symbol is located within the ISI-free region, the FFT part will not be affected by ISI, and the phase rotation caused by timing offset can be easily corrected after FFT. If the estimated start position is located outside this region, the sampled FFT part will contain radiated energy of a neighboring symbol, which will cause the dispersion of signal constellation and reduce the system performance accordingly. 
         [0048]    A complete OFDM symbol is shown in  FIG. 3 . The guard period GP of duration T gp  at the beginning of the symbol contains the same sequence of samples X n−i  . . . X n−1  as the tail end. This is known as the cyclic prefix CP referred to above. The FFT part is from the end of the guard period to the end of the symbol. Because of the cyclic nature of the prefix in the guard period, the FFT window can be shifted anywhere within the symbol and a valid result still obtained. For example, if the FFT window is shifted two samples to the left, the last two samples at the end of the symbol will be missed, but they will be picked up as the last two samples in the guard period. 
         [0049]    In order to detect the start of the symbol, a correlation is performed wherein the incoming data is delayed by an amount equal to the length of the guard period T gp , and compared with the undelayed data. In the absence of multipath effects, there would of course be an exact match between the cyclic prefix and the end part of the symbol as shown in  FIG. 4 . In this case, a summation of the magnitude of the complex product of the delay signal with its complex conjugate or vice versa with a sliding window of T gp  (1-GP integration) would result in a single peak as shown in  FIG. 5 . When the leading edge of the window reaches the start of the cyclic prefix, the summation begins to increase as the correlation has constant phase until it reaches a maximum when the leading edge of the sliding window reaches the end of the cyclic prefix, at which time it will begin to fall off until for a window starting at the end of the cyclic prefix, the summation will be again around zero. On the other hand, a summation with a sliding window of length 2T gp  (2-GP integration) would result in a top-flat region of length T gp  between time instances T gp  and 2T gp (where time 0 corresponds to the start point of GP) as shown in  FIG. 6  because the summation will remain substantially constant as the window slides over the guard period from the time the leading edge of the window reaches the end of the cyclic prefix until the time the tailing edge of the window reaches the start of the cyclic prefix because during this time the entire cyclic prefix falls within the sliding window. Subtracting T gp  from any point in the top-flat region will give a start point in the ISI-free region. 
         [0050]    However, multipath effects cause multiple copies of the transmitted signal to arrive at the receiver. The above correlation between the received signal and its delayed version is equivalent to the summation of correlation results between all combinations of two received copies of the transmitted signal. Among all the combinations, only the ones consisting of a copy and itself have their correlation result co-phased in the GP part. This is shown in  FIG. 7  where the CIR has two rays and therefore two copies of the transmitted signal arrive at the receiver. The ISI-free region is from the point when the last arrived copy starts to the point when the GP of the first arrived copy ends. 
         [0051]      FIG. 8  shows the prior art method of identifying the start position. The magnitude of the product of the signal and the complex conjugate of the delayed signal is summed over a window with one guard period T gp  starting at the beginning of a candidate sequence. The resulting sum gradually increases as the window is moved in time till the end of GP of the first arrived copy of the transmitted signal. The sum arrives at its peak between this point and the time when the GP of the last arrived copy ends. Then the sum starts to fall off. The peak is taken as the start point of the symbol and represents one start point which is ISI free. 
         [0052]    In accordance with an embodiment of the invention, the length of the sliding window over which the summation occurs is increased to 2T gp . However, an improvement can be achieved by increasing the length of the sliding window by less than this amount provided it is greater than T gp .  FIG. 9  shows what happens when the length of the sliding window is 2T gp . The summation initially increases as before, first due to the contribution of the first arrived copy and then due to the overlapping contribution of the second arrived copy, but then instead of reaching a peak and falling off, as in the case of a window of length T gp , it forms a flat region (hereinafter referred to as the top-flat region), where the summation is substantially constant. The reason for this is that in the region where the GPs of the two copies overlap, the contributions from the two copies remain substantially constant when the summation period is increased beyond T gp . This top-flat region identifies an ISI-free start point+T gp , and unlike the case where summation only occurs over T gp , a start point can be chosen that is in the middle of the overlap region clear of the edges. Thus, instead of selecting a start point that is at the limit of where ISI will occur, this embodiment identifies a start point well clear of the point at which ISI may occur and is thus more robust than the prior art method. 
         [0053]      FIG. 10  shows the case where ISI is inevitably present since the correlated GPs of the direct and multipath signals do not overlap. This case is particularly likely to arise in the case of SFN, where the transmitters can be widely separated. In this case, a T gp  window gives two separate peaks as shown in  FIG. 11 , whereas a 2T gp  window creates two overlapping top-flat regions for the two received signal copies respectively, which combine to create a peak at the point of minimum ISI. 
         [0054]    In general, if CIR is within the time region [0, T c ] then the ISI-free region is [T c , T gp ]. If only the first CIR path exists, i.e. no multipath delay is present, the corresponding top-flat region has time region [T gp , T i ], so if T i =T gp  as in the prior art, it reduces to a point. 
         [0055]    If only the last CIR path exists, i.e. ignoring the direct path, the top-flat region would lie within time region [T c +T gp  T c +T i ]. 
         [0056]    Since we have a channel lasting from time instance 0 to T c , the top-flat region lies in the region [T c +T gp , T i ], which is the intersection of the above two time regions. 
         [0057]    After this region [T c +T gp , T i ] has been identified, we can subtract T gp  and get the region [T c , T i −T gp ]. Since the symbol start point region that is ISI-free is [T c , T gp ], we can safely find a point in this region if the end point lies in the range: 
         [0000]        T   i   −T   gp   &lt;=T   gp , i.e.,  T   i &lt;=2 T   gp    (a)
 
         [0000]        T   i   −T   gp   &gt;=T   c , i.e., the  CIR  is limited to time region [0,  T   i   −T   gp ]  (b)
 
         [0000]    In the case where T i =2T gp  (2-GP integration), the ISI-free region found is [T c , T gp ]. 
         [0058]    If we use T i &lt;2T gp , and assume condition (b) is satisfied, we have two choices:
       a. We can subtract T gp  to get the region [T c , T i −T gp ], which is a subset of the ISI-free region [T c , T gp ]. This gives an estimate of the start point of the ISI-free region, but not the end point.   b. Alternatively, if we subtract T i −T gp  from the region [T c +T gp , T i ], the resulting region will be [T c −T i +2T gp , T gp ]. This is also a subset of the region [T c , T gp ] since T c −T i +2T gp &gt;=T c  can be simplified as T i &lt;=2T gp  which is the pre-set condition in this case. This gives an estimate of the end point of the ISI-free region, but not the start point.       
 
         [0061]    From (a) and (b) in paragraph [0052], we see that if we subtract a value in the region [T i −T gp , T gp ], we can get a region that lies within the ISI-free region. This tells us that after we obtain the region [T c +T gp , T i ], we have a range to choose the subtraction value. We can also choose the subtraction value to be T gp  or T i −T gp  respectively and still obtain the start and end point of the ISI-free region. No matter what approach we use, we have to satisfy condition (b). 
         [0062]    Mathematically, the invention can be understood in the following terms. In accordance with embodiments of the invention based on F(n), the 2-GP integration of the correlation performed on the receiver baseband input sequence x(n) is expressed in Equation 1. 
         [0000]    
       
         
           
             
               
                 
                   
                     F 
                      
                     
                       ( 
                       n 
                       ) 
                     
                   
                   = 
                   
                      
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           0 
                         
                         
                           K 
                           - 
                           1 
                         
                       
                        
                       
                         
                           ∑ 
                           
                             j 
                             = 
                             
                               n 
                               - 
                               
                                 2 
                                  
                                 
                                   N 
                                   g 
                                 
                               
                               + 
                               1 
                             
                           
                           n 
                         
                          
                         
                           
                             x 
                              
                             
                               ( 
                               
                                 
                                   i 
                                   · 
                                   N 
                                 
                                 + 
                                 j 
                               
                               ) 
                             
                           
                           · 
                           
                             
                               x 
                               * 
                             
                              
                             
                               ( 
                               
                                 
                                   i 
                                   · 
                                   N 
                                 
                                 + 
                                 j 
                                 + 
                                 
                                   N 
                                   u 
                                 
                               
                               ) 
                             
                           
                         
                       
                     
                      
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
         [0063]    In this equation, is the sample index, N is the total number of samples for each OFDM symbol (including GP and FFT part), K is the number of OFDM symbols participated in the averaging operation, N u  is the number of samples for the FFT part, N g  is the number of samples for the GP. Note that the curve of F(n) repeats for each OFDM symbol, therefore it suffices to analyze F(n) for the length of one OFDM symbol. 
         [0064]    Assume that CIR has time duration of N c T s , where N c  is an integer number and T s  is the sample duration. Then in the symbol synchronization input sequence, the guard period of a symbol is distributed in the time region [n c0 T s , n c0 T s +(N c +N g )T s ], where n c0 T s  is the time instant for the first sample in the guard period to arrive at the receiver. When N c &lt;N g , the 2-GP integration output F(n) has the following characteristics in general: 
         [0065]    in the index range [n c0 ,n c0 +N c +N g ], T 2 (n) keeps increasing; 
         [0066]    in the index range [n c0 +N c +N g , n c0 +2N g ], T 2 (n) remains constant, we call this region the top-flat region of F(n); 
         [0067]    in the index range [n c0 +2N g , n c0 +N c +3N g ], T 2 (n) keeps decreasing; 
         [0068]    for all other n values, F(n) remains small. 
         [0069]    It is well known that in order to minimize ISI, the optimal start index for the symbol should be in the range [n c0 +N c , n c0 +N g ]. This range is the same for the top-flat region of F(n), except for a N g  time shift. This represents the tolerable region for the symbol synchronization output mentioned previously. 
         [0070]    The characteristics of F(n) are illustrated in the example shown in  FIGS. 13   a  and  13   b.  In this example, the channel is comprised of an SFN channel with two independent fading groups. Each group is 5 μs long and represents the Rayleigh fading signal emitting from a single transmitter at 5.4 dB C/N and 150 Hz Doppler. The groups are placed at 0 and 0.5N g  apart. Here N u =8192, N g =2048. The channel CIR is shown in  FIG. 13   b;  it has a length of 1071 samples. According to the characteristics discussed above, this channel CIR should result in a top-flat region of F(n) at sample index range [n c0 −977, n c0 ]. This is confirmed in the upper part of the figure. 
         [0071]    With the 2-GP integration, the symbol synchronization problem is reduced to the problem of finding a point in the top-flat region of F(n). To achieve this, we compute three output parameters: n c1  and n c2 , the estimated start and end points of the top-flat region of F(n), and the sample index n p2  corresponding to the maximum value of T 2  (n). We also compute n f2  (the average of n c1  and n c2 ), which can be viewed as an estimate of the center of the top-flat region. Equation 2 shows how these parameters are computed. In Equation 2, n c1  is the smallest index satisfying F(n c1 −1)≦αF(n p2 ) 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         n 
                         
                           p 
                            
                           
                               
                           
                            
                           2 
                         
                       
                       = 
                       
                         
                           argmax 
                           n 
                         
                          
                         
                           ( 
                           
                             F 
                              
                             
                               ( 
                               n 
                               ) 
                             
                           
                           ) 
                         
                       
                     
                     , 
                     
                       
 
                     
                      
                     
                       
                         n 
                         
                           f 
                            
                           
                               
                           
                            
                           2 
                         
                       
                       = 
                       
                         
                           1 
                           2 
                         
                          
                         
                           
                             ( 
                             
                               
                                 n 
                                 
                                   c 
                                    
                                   
                                       
                                   
                                    
                                   1 
                                 
                               
                               + 
                               
                                 n 
                                 
                                   c 
                                    
                                   
                                       
                                   
                                    
                                   2 
                                 
                               
                             
                             ) 
                           
                           . 
                           
                             
 
                           
                            
                           and 
                         
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     
                       F 
                        
                       
                         ( 
                         
                           n 
                           
                             c 
                              
                             
                                 
                             
                              
                             1 
                           
                         
                         ) 
                       
                     
                     &gt; 
                     
                       α 
                        
                       
                           
                       
                        
                       
                         
                           F 
                            
                           
                             ( 
                             
                               n 
                               
                                 p 
                                  
                                 
                                     
                                 
                                  
                                 2 
                               
                             
                             ) 
                           
                         
                         . 
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Similarly, n c2  is the largest index satisfying F(n c2 +1)≦αF(n p2 ) and F(n c2 )&gt;αF(n p2 ). Here, α ∈ (0,1) is the scaling factor controlling the accuracy of n c1  and n c2 . 
         [0072]    The diagram shown in  FIG. 14  illustrates method of computing these parameters, which would be implemented in the synchronization unit. The incoming samples x(n) are delayed by N g  in delay unit  40 , and their complex conjugates are computed in unit  41 . The output of unit  41  is multiplied with x(n) in multiplier  42 , and the last 2N g  absolute values are summed in unit  44 . The absolute value is extracted in unit  45  to obtain F(n). Max unit  46  outputs n p2  and F(n p2 ), and the threshold αF(n p2 ) is computed in unit  47 . The threshold unit  48  then outputs values n c1  and n c2 . 
         [0073]    We can now use the above parameters to locate a position in the top-flat region as the output of the symbol synchronization method. Multiple criteria can be used. We may use the sample index n p2  corresponding to the maximum value of F(n) as the output. Theoretically, n p2  is located randomly in the flat-top region. 
         [0074]    Alternatively, we may estimate the top-flat region start and end points n c1  and n c2 , and use their average n f2  as the output. Generally, we may linearly combine the above parameters to generate a final output identifying the start position of a symbol, which can then be processed in the conventional manner. 
         [0075]    The new time domain symbol synchronization algorithm uses GP of OFDM symbols to locate a position in the ISI-free region; it generates optimal output to minimize ISI. The new method also has low computational complexity, and is easy to implement using DSP hardware. 
         [0076]    It should be appreciated by those skilled in the art that any block diagrams herein represent conceptual views of illustrative circuitry embodying the principles of the invention. For example, a processor may be provided through the use of dedicated hardware as well as hardware capable of executing software in association with appropriate software. When provided by a processor, the functions may be provided by a single dedicated processor, by a single shared processor, or by a plurality of individual processors, some of which may be shared. Moreover, explicit use of the term “processor” should not be construed to refer exclusively to hardware capable of executing software, and may implicitly include, without limitation, digital signal processor (DSP) hardware, network processor, application specific integrated circuit (ASIC), field programmable gate array (FPGA), read only memory (ROM) for storing software, random access memory (RAM), and non volatile storage. Other hardware, conventional and/or custom, may also be included.