Abstract:
An embodiment of a device for processing at least an incoming signal in a wireless communication system, said incoming signal being sent by a base station and comprising successive frames, each of which comprising at least a training symbol correlated to said base station, and a data symbol carrying message data. 
     The device comprises at least:
       a first module digitizing and sampling the incoming signal;   a second module demodulating said digitized and sampled incoming signal, and generating a corresponding frequency domain symbol;   a timing synchronization and scanning module suitable for detecting at least a time offset of said training symbol by using said corresponding frequency domain symbol; and   a timing post processing module for processing said timing offset and for generating an improved timing offset used to start the sampling of following incoming signal.

Description:
PRIORITY CLAIM 
       [0001]    This application claims priority from European patent application No. 07290144,0, filed Feb. 5, 2007, which is incorporated herein by reference. 
       TECHNICAL FIELD 
       [0002]    An embodiment of the present invention relates generally to wireless communication systems, using transmission techniques like OFDM (Orthogonal Frequency Division Multiplexing) or OFDMA (Orthogonal Frequency Division Multiple Access), and more particularly to a set of techniques for timing synchronization and neighbor scanning in OFDM cellular systems. 
         [0003]    More precisely, a first embodiment relates to a device for processing an incoming signal in a wireless communication system, said incoming signal being sent by a base station and comprising successive frames, each of which comprising at least a training symbol or preamble correlated to said base station, and a data symbol carrying message data. 
       BACKGROUND 
       [0004]    Orthogonal Frequency Division Multiplexing (OFDM) is a transmission technique, where a data stream is multiplexed over multiple orthogonal subcarriers, yielding a longer symbol period which may be advantageous in multipath conditions. Orthogonal Frequency Division Multiple Access (OFDMA) is a variant of OFDM, where the available spectrum is used simultaneously by multiple users which are using different orthogonal subcarriers. 
         [0005]    OFDM generally decreases the Inter-Symbol Interference (ISI) by inserting a guard interval (GI) between OFDM symbols in order to maintain the orthogonality between the subcarriers, the guard interval being generally longer than the maximum delay spread of a channel. 
         [0006]    Timing synchronization between a transmitter and a receiver is obtained to maintain the orthogonality between the subcarriers and thus enabling proper demodulation of the data. 
         [0007]    For cellular mobile applications for instance, different requirements may be very important, among which: 
         [0008]    First, at the mobile station (MS) side, a permanent knowledge of the network topology is available (serving base station (SBS), neighbor base stations (NBS), the associated signal quality measurements), which is accomplished through scanning. Thus, if the neighbor base stations and their signal quality are known, the mobile station is able to choose a serving base station by performing handover, with the purpose of either avoiding service interruption (for example when the signal quality from the serving base station becomes poor) or selecting a neighbor base station which gives a better signal quality and hence a higher data rate. The mobile station is required to do so in pedestrian environment as well as in vehicular environment. Scanning includes in searching for sequences matching known sequences transmitted by the base station referred to as preamble sequences. The scanning can be directed by neighbor advertising (i.e. the set of preambles the mobile station should search for is advertised by the serving base station) or autonomous (no a priori knowledge of the preamble to search for, so all preamble sequences are scanned). A major difference between single cell (typically fixed) and cellular (typically mobile) networks is that in the latter there are multiple preamble sequences in order to discriminate between multiple base stations. 
         [0009]    Second, the mobile applications may have low power consumption to allow portable terminals with reasonable battery autonomy, which directly translates to low complexity algorithms. Furthermore, it is desired that the aforementioned scanning be done quickly and preferably during data reception, minimizing the need for special scanning intervals, and hence allowing the MS to sleep more in order to conserve its power. 
         [0010]    In addition, a reasonable time for power-up to operational state (in the order of seconds) may be desired. Also related to this, when service interruption occurs due to very harsh conditions, a quick recovery may be desired. 
         [0011]    There is little or no literature on scanning for OFDM or OFDMA cellular systems. The existing solutions for timing synchronization in OFDM or OFDMA cover single-cell point-to-point or point-to-multipoint systems without the need for handover and neighbor scanning. In all of them, there is a unique training sequence (which can consist of multiple training symbols called preambles), and therefore only a time domain search is performed, and sometimes extended to also cover frequency uncertainty by hypothesis or by other means. 
         [0012]    Among the existing solutions, one known technique is the frequency domain cross-correlation consisting in applying a Fast Fourier Transform (FFT) to the receive samples, multiplying the FFT output by the inverse of the preamble sequence in the frequency domain, and translating back to the time domain using an IFFT. The Frequency domain cross-correlation yields a discontinuity at the FFT symbol edges which is commonly overcome using the so-called overlap-add or overlap-save FFT de-convolutions that yield extra complexity. In all cases, only one correlation result per input sample is required, which may be good enough for single cell systems because there is a unique well-known preamble to search. With this solution, part of the processing (FFT) is shared between several preamble hypotheses and correlation results can be very efficiently processed by using an IFFT to yield the channel impulse response for an expected preamble sequence. However, the overlap-add or overlap-save FFT de-convolution may still be either too complex or too slow, especially because the computation of the correlation result per NFFT (nominal FFT size for the OFDM system) input samples requires an FFT of order greater than NFFT on one side, for each sequence searched multiplication with the inverse of the frequency domain known sequence padded with zeros and again, for each sequence searched an IFFT of order greater than NFFT to get the channel impulse response. 
       SUMMARY 
       [0013]    Other techniques assume a rough synchronization point is known, but what is really needed and what will be described further is a comprehensive set of methods and algorithms to fulfill the requirements of a cellular system. 
         [0014]    For this purpose, an embodiment of the invention provides a device that comprises at least: 
         [0015]    a first module digitizing and sampling the incoming signal; 
         [0016]    a second module demodulating said digitized and sampled incoming signal, and generating a corresponding frequency domain symbol; 
         [0017]    a timing synchronization and scanning module suitable for detecting at least a time offset of said training symbol by using said corresponding frequency domain symbol; and 
         [0018]    a timing post processing module for processing said timing offset and for generating an improved timing offset used to start the sampling of following incoming signal. 
         [0019]    The timing synchronization and scanning module may be further suitable to provide one or more signal quality measurements of said training symbol, for example signal power, or noise plus interference power. 
         [0020]    The device may further comprise a control module suitable for sending at least a command to the timing synchronization and scanning module via a command interface, and receiving at least a processing result from the timing synchronization and scanning module via a statistics interface in response to said command. 
         [0021]    The incoming signal being for example an OFDM signal type and the training symbol being a well-known training symbol, also called a preamble. 
         [0022]    The second module may implement means of a discrete Fourier transform, said means of a discrete Fourier transform are for example means of fast Fourier transform. 
         [0023]    The timing offset may be processed by averaging, filtering or any other means reducing synchronization errors. 
         [0024]    The timing synchronization and scanning module may be suitable for processing, based on commands from a control module, a plurality of training symbols sent at least by a serving base station and a neighbor base station, and providing timing offset and signal quality measurement of each training symbol to the control module, only the timing offset corresponding to the training symbol correlated to the serving base station are sent to the timing post processing module. 
         [0025]    The training symbol is for example sent by different bases stations in neighbour cells. 
         [0026]    The timing synchronization and scanning module may further process a plurality of successive frequency domain symbols, based on commands from the control module. 
         [0027]    Thus the detection interval may be extended. 
         [0028]    The timing synchronization and scanning module may comprises at least: 
         [0000]    a frequency domain correlation module controlled by the control module, for computing and generating at least a channel impulse response based at least on the frequency domain symbol corresponding to said training symbol correlated to the serving base station;
 
a preamble processing module for determining if a specific preamble is present in said incoming signal, for generating a detection decision and for estimating the timing offset;
 
a statistic processing module for sending at least the detection decision, and the timing offset to said control module, and for sending said timing offset of said training symbol corresponding to said serving base station to the timing post processing module.
 
         [0029]    The preamble processing module may also provide the signal quality measurement. 
         [0030]    The statistic processing module ( 13 ) may also send the signal quality measurement. 
         [0031]    For example, the frequency domain correlation module comprises at least: 
         [0000]    a look-up table module containing at least an inverse of a preamble,
 
a deconvolution module multiplying the frequency domain symbol with the inverse of the preamble as generated by the look up table,
 
a third module transforming the result of the multiplication in time domain,
 
a windowing module multiplying the result of the deconvolution module ( 115 ) with a windowing function to eliminate the distortions caused by discontinuities.
 
         [0032]    The windowing module may be placed anywhere on the data path as long as it is in the frequency domain. 
         [0033]    The frequency domain correlation module may further comprise: 
         [0000]    a decimation module for receiving a said incoming signal, and for generating, if needed, of a decimated version of the incoming signal, it may also be used to insert a frequency offset by using decimation offset.
 
a multipage memory for temporary storing one or more decimated versions of one or more frequency domain symbols,
 
a look-up table module containing at least a list of inverses of preambles, as indicated by the control module as an index in a pool of preambles,
 
a third module transforming the result of the multiplication in time domain, using for example an inverse Fourier transform,
 
a scheduler module for translating the commands sent by the control module into local control signals (e.g. decimation offset and decimation factor for the decimation module, control signal for the multipage memory, index of the preamble for the Look-up table).
 
         [0034]    For example, the preamble processing module comprises at least: 
         [0000]    a discriminator suitable for differentiating between the useful part of the input channel impulse response and a noise floor, and for outputting a discriminated channel impulse response,
 
means for computing a timing offset from the discriminated channel impulse response.
 
         [0035]    The said preamble post processing module may comprise further a means of computing signal quality indicators. 
         [0036]    For example, the discriminator compares the signal power to a predetermined threshold and interpreting the samples above the threshold as a useful signal, and by zeroing the samples below the threshold, considered noise and interference. 
         [0037]    The preamble processing module is further capable of jointly processing at least two channel impulse responses corresponding to at least two successive symbols. 
         [0038]    The preamble processing module is further capable to compute a metric for each of the two discriminated channel impulse responses corresponding to successive symbols, for instance the signal power. 
         [0039]    The preamble processing module can select and discriminate the useful taps for both channel impulse responses by using the discriminated channel impulse response and the highest metric amongst the two metrics. 
         [0040]    The preamble processing module may further combine coherently the channel impulse responses for the two symbols by using their constant phase relationship. 
         [0041]    The timing offset may be computed as an average delay of the discriminated channel impulse responses. 
         [0042]    The average delay of the discriminated channel impulse response CIR may be computed as follows: 
         [0000]    computing a sum of the product of power of discriminated channel impulse response by said variable delay;
 
computing a sum of the power for the corresponding delay; and
 
computing a division of previously computed measures.
 
         [0043]    The timing synchronization and scanning module may further comprise a preamble post processing module refining the results of the preamble processing module from two consecutive training symbols in order to correct the ambiguity in timing offset and the error in signal quality measurements. 
         [0044]    The preamble post processing module may be based on useful signal power on the two consecutive symbols to determine the error in timing offset and signal quality measurements, by look-up tables or equivalent means. 
         [0045]    The detection interval for the timing offset may be limited to a predetermined or known interval and thus may increase the reliability of the detection. 
         [0046]    A limited number of consecutive samples may be used for determining the timing offset. 
         [0047]    The statistics processing module may also be used to find the best match for a preamble when the detection interval is a plurality of symbols by performing a maximum search, for example on power of the discriminated channel impulse symbol. The statistics processing module may be used in such a way that only the statistics for the best match are provided to the control module. 
         [0048]    The statistics processing module may be used to filter the results by invalidating the detections for certain preambles, for instance if the timing offset is too high. 
         [0049]    An embodiment of the proposed device operates at the output of the Fast Fourier Transform module, on the extracted for demodulation (groups of N samples representing the FFT of the N-sample data symbols separated by guard intervals). Hence, the scanning may be performed seamlessly during normal data reception. 
         [0050]    Another embodiment of the invention is a method for implementing a device described above, in a timing tracking of a serving base station mode, comprising at least the steps of: 
         [0000]    sending to the timing synchronization and scanning module at least:
 
an index of an expected preamble in said incoming signal, an index of a frequency domain symbol corresponding to the expected preamble, and
 
a decimation factor, and
 
a decimation offset,
 
said timing synchronization and scanning module executes the steps of:
 
generating a frequency domain symbol corresponding to said incoming signal,
 
detecting a time offset of said training symbol by using said frequency domain symbol,
 
sending a detection decision according to the expected preamble, and
 
sending said timing offset to said timing post processing module,
 
said timing post processing module executed the steps of:
 
generating an improved timing offset, and
 
establishing a sampling instant for following incoming signal.
 
         [0051]    The timing synchronization and scanning module may return to a control module, via a statistics interface, the detection decision, the timing offset, and the signal quality indicators, if available. 
         [0052]    In a scanning for neighbor base stations in synchronous networks mode, the method may further comprise at least the steps of: 
         [0000]    sending to the timing synchronization and scanning module at least:
 
a list of index of expected preambles in said incoming signal,
 
an index of a frequency domain symbol corresponding to the expected preambles,
 
a decimation factor, and
 
a decimation offset,
 
said timing synchronization and scanning module executes at least the steps of:
 
generating a frequency domain symbol corresponding to said incoming signal,
 
detecting timing offsets of said training symbols by using said frequency domain symbol,
 
providing at least a set, said set comprising at least:
 
an index of an expected preamble among the list of index of expected preambles,
 
a corresponding detection decision according to said expected preamble of the set,
 
a corresponding timing offset,
 
         [0053]    The timing synchronization and scanning module may return to the control module via the statistics interface one set for each of the preamble index in the list, a set comprising: 
         [0000]    the preamble index,
 
the detection decision,
 
the timing offset, and
 
the signal quality indicators, if available.
 
         [0054]    In a scanning-for-neighbor-base-stations-in-synchronous-networks-with-large-cells mode, the method may further comprise at least the steps of: 
         [0000]    sending to the timing synchronization and scanning module at least:
 
a list of index of expected preambles,
 
an index of the first frequency domain symbol where the preambles are going to be searched in the incoming signal,
 
a number of frequency domain symbols where the preambles are going to be searched in the incoming signal,
 
a decimation factor, and
 
a decimation offset,
 
the timing synchronization and scanning module executes at least the steps of:
 
generating frequency domain symbols corresponding to said incoming signal,
 
detecting timing offsets of said training symbols by using said frequency domain symbols,
 
providing at least a set, said set comprising at least:
 
an index of an expected preamble among the list of index of expected preambles,
 
a corresponding detection decision according to said expected preamble of the set,
 
a corresponding timing offset,
 
         [0055]    The timing synchronization and scanning module may return to the control module via the statistics interface one set for each of the preamble index in the list, a set comprising: 
         [0000]    the preamble index,
 
the detection decision,
 
the timing offset, and
 
the signal quality indicators, if available.
 
         [0056]    In a scanning-for-neighbor-base-stations-in-asynchronous-networks mode, the number of frequency domain symbols where the preambles are going to be searched may be equal to or greater than the number of symbols in a frame. 
         [0057]    The method may comprise a power up algorithm which comprises: 
         [0000]    a cell search, by using the method in asynchronous networks mode, on all preambles in the network and in distinctive subsets,
 
an acquisition step: for the successful detections, the measurements are refined by using the method in synchronous networks with large cells mode, on the set of the preambles that yielded positive detections during cell search,
 
a tracking step: once a timing offset is refined, a preamble is chosen amongst the successful detections and the corresponding base station is chosen as a serving base station and the tracking is done using the method in a timing tracking of a serving base station mode,
 
the scanning may start immediately after the successful synchronization in order to find neighbour base stations
 
         [0058]    In all the modes described above the timing synchronization and scanning module may also comprise the following steps: 
         [0000]    compute signal quality measurements,
 
another output is added to the set: a corresponding signal quality measurement according to an expected preamble of the set,
 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0059]    Features and advantages of one or more embodiments of the invention will appear more clearly from the description made hereinafter, as an indication and by no means restrictive, with reference to the accompanying drawings, wherein: 
           [0060]      FIG. 1  shows a generic data communication system; 
           [0061]      FIG. 2  shows a typical cellular system; 
           [0062]      FIG. 3  illustrates an OFDM signal; 
           [0063]      FIG. 4  presents the structure of an embodiment of a receiver comprising the device according to an example of embodiment of the invention; and 
           [0064]      FIG. 5  shows a timing synchronization and scanning module  10  structure; 
           [0065]      FIG. 6  shows a structure of a frequency domain correlation module according to an embodiment of the invention; 
           [0066]      FIG. 7  shows a possible implementation of preamble processing module; 
           [0067]      FIG. 8  shows a possible implementation of a preamble post-processing module; 
           [0068]      FIG. 9  shows the capturing windows for tracking and for the different scanning modes; and 
           [0069]      FIG. 10  shows the observation windows used for tracking and for the different scanning modes. 
       
    
    
     DETAILED DESCRIPTION 
       [0070]    An OFDM signal includes multiple signals, each modulating a subcarrier. It is known in the art that a fundamental parameter of an OFDM system is the FFT (Fast Fourier Transform) size, denoted by N, N being an integer, for example for an application N=1024. The sampling period is denoted by Ts, which is a system parameter chosen according to the bandwidth of the system. The data portion of an OFDM symbol includes N samples and its length is NTs. 
         [0071]    It is also known in the art that a guard interval including NGI samples is inserted between successive OFDM symbols forming the OFDM signal in order to combat inter-symbol interference. Usually, in order to eliminate the self interference generated by the discontinuity, the guard interval contains a copy of the last NGI samples of the next data symbol and hence it is called a cyclic prefix. 
         [0072]    As shown in  FIG. 3 , each data frame of a wireless system may include one or more training symbols such as for example preamble symbols, or pilot symbols. A preamble symbol may be a training symbol at the beginning of each data frame. Typically, the preamble symbol may be used for various synchronization tasks. A pilot symbol may be a training symbol to provide tracking information, which may be associated for example with a spatial channel. 
         [0073]    In the frequency domain, the transmitted symbol is denoted by XN(k), which is a sequence of complex numbers which will modulate the subcarriers. In the time domain, after the cyclic prefix is appended, the baseband signal can be expressed as: 
         [0000]    
       
         
           
             
               
                 x 
                  
                 
                   ( 
                   t 
                   ) 
                 
               
               = 
               
                 
                   ∑ 
                   
                     
                       k 
                       = 
                       
                         - 
                         
                           N 
                           2 
                         
                       
                     
                     , 
                     
                         
                     
                      
                     … 
                      
                     
                         
                     
                     , 
                     
                       
                         N 
                         2 
                       
                       - 
                       1 
                     
                   
                 
                  
                 
                   
                     
                       X 
                       N 
                     
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                    
                   
                      
                     
                       j 
                        
                       
                         
                           2 
                            
                           π 
                            
                           
                               
                           
                            
                           k 
                         
                         
                           NT 
                           s 
                         
                       
                        
                       t 
                     
                   
                 
               
             
             , 
             
               t 
               ∈ 
               
                 [ 
                 
                   
                     
                       - 
                       
                         N 
                         
                           G 
                            
                           
                               
                           
                            
                           I 
                         
                       
                     
                      
                     
                       T 
                       s 
                     
                   
                   , 
                   
                     NT 
                     s 
                   
                 
                 ] 
               
             
           
         
       
     
         [0074]    A generic data communication system is depicted in  FIG. 1 . It comprises a transmitter that converts upper layer data in an analog signal, a communication channel h(t), and a receiver which translates the received analog signal into data for upper layers. 
         [0075]    The transmitted signal x(t) is altered by the communication channel. The channel impulse response for a multipath channel with Ntaps discrete propagation paths can be expressed as: 
         [0000]    
       
         
           
             
               h 
                
               
                 ( 
                 t 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   
                     m 
                     = 
                     1 
                   
                   , 
                   
                       
                   
                    
                   … 
                    
                   
                       
                   
                   , 
                   
                     N 
                     taps 
                   
                 
               
                
               
                 
                   g 
                   m 
                 
                  
                 
                   δ 
                    
                   
                     ( 
                     
                       t 
                       - 
                       
                         τ 
                         m 
                       
                     
                     ) 
                   
                 
                  
                 
                     
                 
                  
                 where 
                  
                 
                   : 
                 
               
             
           
         
       
     
         [0076]    gm is the gain for each tap (or propagation path) 
         [0077]    δ is the Dirac impulse function 
         [0078]    τm is the propagation delay for tap m 
         [0079]    At the receiver side, the signal may be expressed as (the additive white noise is ignored for simplicity): 
         [0000]    
       
         
           
             
               r 
                
               
                 ( 
                 t 
                 ) 
               
             
             = 
             
               
                 
                   x 
                    
                   
                     ( 
                     t 
                     ) 
                   
                 
                 ⊗ 
                 
                   h 
                    
                   
                     ( 
                     t 
                     ) 
                   
                 
               
               = 
               
                 
                   ∑ 
                   
                     
                       m 
                       = 
                       1 
                     
                     , 
                     
                         
                     
                      
                     … 
                      
                     
                         
                     
                     , 
                     
                       N 
                       taps 
                     
                   
                 
                  
                 
                   
                     g 
                     m 
                   
                    
                   
                     x 
                      
                     
                       ( 
                       
                         t 
                         - 
                         
                           τ 
                           m 
                         
                       
                       ) 
                     
                   
                 
               
             
           
         
       
     
         [0080]    A typical cellular system is depicted in  FIG. 2 , where BS stands for base station and MS stands for mobile station. It is known that an MS receives signals from multiple base stations, which may be harmful from interference point of view, but it may be beneficial in the sense that the MS may perform handover when said MS detects that the signal from a BS is better than the signal of the BS that the MS is currently communicating with (serving BS). 
         [0081]    For example, the BS periodically sends a well-known or current training sequence referred to as preamble. In a cellular system, the preambles are different among neighbor base stations, they belong to a set of I preambles P N   i , i=0, . . . , I−1 and they are reused in the same manner as frequency is reused for classical TDMA cellular systems. Although a single preamble is considered in the equations, in reality the signal received is a combination of signals from multiple base stations each with its own preamble sequence. 
         [0082]    An embodiment of the present invention is depicted in  FIG. 4 , where the MS performs the following tasks: first, it finds the point in time where to start sampling the signal received from the serving base station for proper demodulation (or timing synchronization) and second, it scans for neighbor base stations in order to have a good picture of the timing offset and signal quality for serving base station and the neighbor base stations. 
         [0083]    The analog signal, processed by an analog front-end and a digital front-end module  01  (for example an Analog to Digital converter), is converted to digital and sampled at a nominal sampling period: 
         [0000]        r ( n )= r ( t )| t=nT     s   +τ   r      
         [0084]    The sampled signal r(n) will be further processed by means of a discrete Fourier transform  02 , for example a fast Fourier transform (FFT). When all the reflections fall within the guard interval (no inter-symbol interference), the structure of the received symbol is, after performing the discrete Fourier transform: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       R 
                       N 
                     
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                   = 
                   
                     F 
                      
                     
                         
                     
                      
                     F 
                      
                     
                         
                     
                      
                     T 
                      
                     
                       { 
                       
                         
                           r 
                            
                           
                             ( 
                             n 
                             ) 
                           
                         
                          
                         
                           | 
                           
                             
                               n 
                               = 
                               0 
                             
                             , 
                             
                                 
                             
                              
                             … 
                              
                             
                                 
                             
                             , 
                             
                               N 
                               - 
                               1 
                             
                           
                         
                       
                       } 
                     
                   
                 
               
             
             
               
                 
                   
                     = 
                     
                       
                         
                           X 
                           N 
                         
                          
                         
                           ( 
                           k 
                           ) 
                         
                       
                        
                       
                         
                           ∑ 
                           
                             
                               m 
                               = 
                               1 
                             
                             , 
                             
                                 
                             
                              
                             … 
                              
                             
                                 
                             
                             , 
                             
                               N 
                               taps 
                             
                           
                         
                          
                         
                           
                             g 
                             m 
                           
                            
                           
                              
                             
                               j 
                                
                               
                                 
                                   2 
                                    
                                   π 
                                 
                                 N 
                               
                                
                               k 
                                
                               
                                 
                                   ( 
                                   
                                     
                                       τ 
                                       r 
                                     
                                     - 
                                     
                                       τ 
                                       m 
                                     
                                   
                                   ) 
                                 
                                 
                                   T 
                                   s 
                                 
                               
                             
                           
                         
                       
                     
                   
                   , 
                 
               
             
           
         
       
       
         
           
             
               k 
               = 
               
                 - 
                 
                   N 
                   2 
                 
               
             
             , 
             … 
              
             
                 
             
             , 
             
               
                 N 
                 2 
               
               - 
               1 
             
           
         
       
     
         [0085]    The condition for reception with no inter-symbol interference is: 0&lt;τ m −τ r &lt;N GI T s , m=1, . . . , N taps , 
         [0000]    where τ r  is the result of a timing post processing module  20  shown in  FIG. 4 , which processes, by averaging, filtering or any other means, the result of timing synchronization and scanning module  10 . The parameter τ r  is used to select the correct timing offset where the input signal is sampled, thus realizing the timing synchronization. 
         [0086]    The timing synchronization and scanning module  10  may be used in two modes. 
         [0087]    In a first operating mode, it will track a timing offset or delay r of the preamble of the serving base station (which will be referred as the current preamble or current training symbol) in order to properly demodulate the data. It will also gather the timing offset along with signal quality measurements (like for example received signal power and signal to interference plus noise ratio) and send them to a control module  30  (via a statistics channel). 
         [0088]    In a second operating mode, under the supervision of the control module  30  which will send commands to the timing synchronization and scanning module  10  (via the command channel), the timing synchronization and scanning module  10  will scan other preambles in an attempt to find neighbor base stations. The timing offset of the preambles scanned along with signal quality measurements are provided back to the control entity via the statistics channel. The control entity can be autonomous or it can be directed by neighbor advertising (information about the neighbor base stations sent by the serving base station). 
         [0089]    A distinctive feature of the proposed receiver is that the timing synchronization and scanning module operates at the output of a discrete Fourier transform module  02 , on the symbols extracted for demodulation (groups of N samples representing the fast Fourier transform of the N-sample data symbols separated by guard intervals). Hence, the scanning may be performed seamlessly during normal data reception. 
         [0090]    e rest of the modules depicted  FIG. 4  is typical for an OFDM receiver. The complex channel coefficients are estimated and are compensated for in the received signal by the channel estimation and compensation module  03 . The compensated signal is further processed by a slicer module  04  and a forward error correction decoder  05 . Finally, the data is sent to upper layers. 
         [0091]    Now let us explain an example of an embodiment of a first operating mode, also called tracking mode for steady-state timing tracking. 
         [0092]    In the following, the timing synchronization and scanning module is described showing the functionality of each sub-module. 
         [0093]    The structure of timing synchronization and scanning module  10  is depicted  FIG. 5 . 
         [0094]    First, the output of the discrete Fourier transform  02  or N-point IFFT, denoted by R N (k) is passed through a frequency domain correlation (FDC module)  11 , which is controlled by the Control module  30  via the commands channel. The output of the FDC module  11  is a channel impulse response CIR for the specific preamble (or current training symbol) commanded by the control module (in the case of tracking the preamble is the current preamble, i.e. the preamble used by the serving BS). The channel impulse response CIR is further processed by a preamble processing module  12  to get estimates of the timing offset τ, a signal power as well as noise and interference power. The preamble processing module  12  also makes a decision if a specific preamble was present or not. The preamble post processing module  14  can be bypassed for tracking, and can be is used for example for combining the results of two successive OFDM symbols processed by other functions. A statistics processing module  13  may be used to send the detection of a specific preamble decision with the timing offset information and the signal quality measurement to the control module  30  via the statistics channel. The statistics processing module  13  may also be used to further filter results of the commanded operations. The timing offset τ of the current preamble will be provided to the timing post-processing module  20  for further processing to generate an improved estimate τ r  used to start sampling by the analog front-end and digital front-end module  01 , as explained above. 
         [0095]    The structure of the Frequency domain correlation (FDC) module  11  is depicted in  FIG. 6 . A scheduler  111  is responsible of translating the commands from the control module  30  to local control signals and hence FDC module  11  may perform different functions under the supervision of the control module  30 . For instance, the index of the preamble to be used in the correlation is input to a look-up table (LUT)  112  to get the needed preamble sequence. Also a decimation offset s i  corresponding to the same index is provided to a decimation module  113 . Each N-sample block from the output of the N-point FFT  02  is provided to the synchronization and scanning module  10  along with a timestamp corresponding to the first sample of the block in the time domain. The scheduler  111  is used to control for example a multi-page memory  114  and also the processing for the purpose of accommodating different functions. For tracking, the output of the decimation module  113  may be directly sent to a de-convolution module  115 . However, in order to cope with frequency offset uncertainty, an additional offset may be applied to the decimation module corresponding to frequency offset hypothesis (with granularity equal to the inter-carrier spacing). For a single FFT output and a single preamble index more de-convolutions may be performed, one for each frequency offset hypothesis. The preamble sequences may also modulate only a part of the subcarriers (denoted here by M), equally spaced at intervals of T subcarriers which will yield a T-times repetition of a sequence in the time domain. A subcarrier set chosen is selected by a decimation offset s i =0, . . . , T−1. For the preferred application, M=284, T=3 and s i =0, . . . , 2. The decimated frequency domain sequence is: 
         [0000]    
       
         
           
             
               
                 
                   R 
                   M 
                 
                  
                 
                   ( 
                   k 
                   ) 
                 
               
               = 
               
                 
                   
                     R 
                     N 
                   
                    
                   
                     ( 
                     
                       
                         T 
                         · 
                         k 
                       
                       + 
                       
                         s 
                         i 
                       
                     
                     ) 
                   
                 
                 = 
                 
                   
                     
                       P 
                       M 
                       i 
                     
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                    
                   
                     
                       ∑ 
                       
                         
                           m 
                           = 
                           1 
                         
                         , 
                         
                             
                         
                          
                         … 
                          
                         
                             
                         
                         , 
                         
                           N 
                           taps 
                         
                       
                     
                      
                     
                       
                         g 
                         m 
                       
                        
                       
                          
                         
                           j 
                            
                           
                             
                               2 
                                
                               π 
                             
                             N 
                           
                            
                           
                             ( 
                             
                               
                                 T 
                                 · 
                                 k 
                               
                               + 
                               
                                 s 
                                 i 
                               
                             
                             ) 
                           
                            
                           
                             
                               ( 
                               
                                 
                                   τ 
                                   r 
                                 
                                 - 
                                 
                                   τ 
                                   m 
                                 
                               
                               ) 
                             
                             
                               T 
                               s 
                             
                           
                         
                       
                     
                   
                 
               
             
             , 
             
               
 
             
              
             
               k 
               = 
               
                 - 
                 
                   M 
                   2 
                 
               
             
             , 
             … 
              
             
                 
             
             , 
             
               
                 M 
                 2 
               
               - 
               1 
             
           
         
       
     
         [0096]    The decimation module  113  may be skipped if all of the subcarriers are used by the preamble (T=1) and when no frequency offset hypothesis are tested. 
         [0097]    However, when extracting the carriers, the decimation offset may be allowed to take larger values in order to also incorporate frequency offset hypothesis in units of one subcarrier spacing. For instance, if hypothesis f hyp =−3, . . . , 3 subcarrier spacing need to be tested, the decimation offset range is s hyp   i =−3, . . . , T+2 
         [0098]    For an efficient implementation of discrete Fourier transform, a subset of L≦M subcarriers may be used further (a power of 2 for instance). Due to frequency offsets expected at the receiver, the part in the center of the spectrum is selected. However, a different choice may be imagined. For instance, in a preferred application only L=256 subcarriers will be used out of the M=284 modulated, for only a small performance loss. 
         [0000]    
       
         
           
             
               
                 
                   R 
                   L 
                 
                  
                 
                   ( 
                   k 
                   ) 
                 
               
               = 
               
                 
                   
                     R 
                     M 
                   
                    
                   
                     ( 
                     k 
                     ) 
                   
                 
                 = 
                 
                   
                     
                       P 
                       L 
                       i 
                     
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                    
                   
                     
                       ∑ 
                       
                         
                           m 
                           = 
                           1 
                         
                         , 
                         
                             
                         
                          
                         … 
                          
                         
                             
                         
                         , 
                         
                           N 
                           taps 
                         
                       
                     
                      
                     
                       
                         g 
                         m 
                       
                        
                       
                          
                         
                           j 
                            
                           
                               
                           
                            
                           
                             
                               2 
                                
                               π 
                             
                             N 
                           
                            
                           
                             ( 
                             
                               
                                 T 
                                 · 
                                 k 
                               
                               + 
                               
                                 s 
                                 i 
                               
                             
                             ) 
                           
                            
                           
                             
                               ( 
                               
                                 
                                   τ 
                                   r 
                                 
                                 - 
                                 
                                   τ 
                                   m 
                                 
                               
                               ) 
                             
                             
                               T 
                               s 
                             
                           
                         
                       
                     
                   
                 
               
             
             , 
             
               
 
             
              
             
               k 
               = 
               
                 - 
                 
                   L 
                   2 
                 
               
             
             , 
             … 
              
             
                 
             
             , 
             
               
                 L 
                 2 
               
               - 
               1 
             
           
         
       
     
         [0099]    And after de-convolution with the expected preamble sequence we obtain (the other preambles, although not shown in the equation will be whitened along with all the interferers): 
         [0000]    
       
         
           
             
               
                 
                   Y 
                   L 
                 
                  
                 
                   ( 
                   k 
                   ) 
                 
               
               = 
               
                 
                   
                     
                       R 
                       L 
                     
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                   
                     
                       P 
                       L 
                       i 
                     
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                 
                 = 
                 
                   
                     ∑ 
                     
                       
                         m 
                         = 
                         1 
                       
                       , 
                       
                           
                       
                        
                       … 
                        
                       
                           
                       
                       , 
                       
                         N 
                         taps 
                       
                     
                   
                    
                   
                     
                       g 
                       m 
                     
                      
                     
                        
                       
                         j 
                          
                         
                             
                         
                          
                         
                           
                             2 
                              
                             π 
                           
                           N 
                         
                          
                         
                           ( 
                           
                             
                               T 
                               · 
                               k 
                             
                             + 
                             
                               s 
                               i 
                             
                           
                           ) 
                         
                          
                         
                           
                             ( 
                             
                               
                                 τ 
                                 r 
                               
                               - 
                               
                                 τ 
                                 m 
                               
                             
                             ) 
                           
                           
                             T 
                             s 
                           
                         
                       
                     
                   
                 
               
             
             , 
             
               
 
             
              
             
               k 
               = 
               
                 - 
                 
                   L 
                   2 
                 
               
             
             , 
             … 
              
             
                 
             
             , 
             
               
                 L 
                 2 
               
               - 
               1 
             
           
         
       
     
         [0100]    The inverse of the preamble sequences 
         [0000]    
       
         
           
             1 
             
               
                 P 
                 L 
                 i 
               
                
               
                 ( 
                 k 
                 ) 
               
             
           
         
       
     
         [0000]    are generated by the look-up table (LUT)  112 . 
         [0101]    Further a means of inverse discrete Fourier transform module (or L-point IFFT module)  116  analyzes the content of Y L  which will give us an estimate of the channel impulse response (CIR L ). Prior to the L-point IFFT module, Y L  will be multiplied with a windowing  117  function W L  in order to remove the discontinuity at the edges of the transmitted spectrum (between Y L (−L/2) and Y L (L/2−1) for example). 
         [0102]    The windowing  117  may be placed after the de-convolution module  115  or anywhere from the output of the N-point FFT module  117  to the input of the L-point IFFT module  116 . The channel impulse response CIR L  is further analyzed by the preamble processing module  12 , which functions are: first, to decide if the preamble is present, second to compute the timing offset τ, and third to compute signal quality measurement. 
         [0103]    The input CIR L  is the channel impulse response, but it should be kept in mind that it is sampled with a sampling period equal to 
         [0000]    
       
         
           
             
               N 
               LT 
             
              
             
               T 
               s 
             
           
         
       
     
         [0000]    in this embodiment. 
         [0104]    A possible implementation of preamble processing is depicted in  FIG. 7 . Those skilled in the art may imagine different implementations without departing from the spirit and scope of the present disclosure. 
         [0105]    The delay d is used to index the CIR L : 
         [0000]    
       
         
           
             
               d 
               = 
               
                 
                   d 
                   offset 
                 
                 - 
                 
                   L 
                   2 
                 
               
             
             , 
             … 
              
             
                 
             
             , 
             
               
                 d 
                 offset 
               
               + 
               
                 L 
                 2 
               
               - 
               1. 
             
           
         
       
     
         [0106]    The interval of d may be restricted to a smaller interval centered around an expected bias d offset , if the control entity decides to track the serving base station preamble in a smaller interval called tracking window. If there is no information on the expected bias of the timing offset, d offset  is set to zero. 
         [0107]    The power of the CIR L  is then computed as P(d)=|CIR L (d)| 2 , by the power module  121 . Further, a discrimination function is applied to separate the actual channel impulse response CIR from noise floor. A threshold function is applied by the discriminator  122  to the power of the CIR, where P th  is a power threshold (for example based on the calculated noise floor and depending on the needed false alarm/non-detection performance), and the result of the discrimination function is: 
         [0000]    
       
         
           
             
               
                 P 
                 t 
               
                
               
                 ( 
                 d 
                 ) 
               
             
             = 
             
               { 
               
                 
                   
                     
                       P 
                        
                       
                         ( 
                         d 
                         ) 
                       
                     
                   
                   
                     
                       
                         when 
                          
                         
                             
                         
                          
                         
                           P 
                            
                           
                             ( 
                             d 
                             ) 
                           
                         
                       
                       ≥ 
                       
                         P 
                         th 
                       
                     
                   
                 
                 
                   
                     0 
                   
                   
                     
                       
                         when 
                          
                         
                             
                         
                          
                         
                           P 
                            
                           
                             ( 
                             d 
                             ) 
                           
                         
                       
                       &lt; 
                       
                         P 
                         th 
                       
                     
                   
                 
               
             
           
         
       
     
         [0108]    The detection is successful if at least one value of P t (d) is non-zero. Two sliding sums are used for P t (d) and d·P t (d) to measure in a wanted window referred to as summing window, typically equal to the guard interval length. 
         [0000]    
       
         
           
             
               
                 SP 
                 t 
               
                
               
                 ( 
                 n 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   d 
                   ∈ 
                   
                     
                       n 
                       + 
                     
                     &lt; 
                     
                       summing 
                        
                       
                           
                       
                        
                       window 
                     
                     &gt; 
                   
                 
               
                
               
                 
                   P 
                   t 
                 
                  
                 
                   ( 
                   d 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 SDP 
                 t 
               
                
               
                 ( 
                 n 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   d 
                   ∈ 
                   
                     
                       n 
                       + 
                     
                     &lt; 
                     
                       summing 
                        
                       
                           
                       
                        
                       window 
                     
                     &gt; 
                   
                 
               
                
               
                 d 
                 · 
                 
                   
                     P 
                     t 
                   
                    
                   
                     ( 
                     d 
                     ) 
                   
                 
               
             
           
         
       
     
         [0109]    The measure nε&lt;tracking window&gt; is the center of the summing window chosen based on the expected variation of the channel impulse response. 
         [0110]    The maximum value of SP t  is kept (the CIR with the highest power in a window) as well as the corresponding SDP t . The average delay is computed by a simple division of the two values kept: 
         [0000]    
       
         
           
             
               d 
               avg 
             
             = 
             
               
                 
                   
                     SDP 
                     t 
                   
                    
                   
                     ( 
                     
                       n 
                       opt 
                     
                     ) 
                   
                 
                 
                   
                     SP 
                     t 
                   
                    
                   
                     ( 
                     
                       n 
                       opt 
                     
                     ) 
                   
                 
               
               = 
               
                 
                   
                     ∑ 
                     
                       d 
                       ∈ 
                       
                         
                           
                             n 
                             opt 
                           
                           + 
                         
                         &lt; 
                         window 
                         &gt; 
                       
                     
                   
                    
                   
                     d 
                     · 
                     
                       
                         P 
                         t 
                       
                        
                       
                         ( 
                         d 
                         ) 
                       
                     
                   
                 
                 
                   
                     ∑ 
                     
                       d 
                       ∈ 
                       
                         
                           
                             n 
                             opt 
                           
                           + 
                         
                         &lt; 
                         window 
                         &gt; 
                       
                     
                   
                    
                   
                     
                       P 
                       t 
                     
                      
                     
                       ( 
                       d 
                       ) 
                     
                   
                 
               
             
           
         
       
     
         [0111]    The timing offset detection is limited to the interval 
         [0000]    
       
         
           
             
               d 
               avg 
             
             ∈ 
             
               
                 d 
                 offset 
               
               + 
               
                 
                   [ 
                   
                     
                       - 
                       
                         L 
                         2 
                       
                     
                     , 
                     
                       
                         L 
                         2 
                       
                       - 
                       1 
                     
                   
                   ] 
                 
                 . 
               
             
           
         
       
     
         [0000]    However, if the tracking window and summing window are smaller, the detection will be limited to the tracking window plus the summing window and centered around the bias d offset . 
         [0112]    Although the average delay is presented as an example, different measurements are possible without departing from the spirit and scope of this disclosure. 
         [0113]    The discriminated power of the channel impulse response P t (d) is used to evaluate the power of the wanted signal. 
         [0114]    For the noise plus interference power measurements, the measure before discrimination will be used. The samples outside the a priori known interval of expected time offsets may be used. For instance, assuming half of the CIR L  samples (the ones at the edges) contain noise floor only, the noise plus interference power spectral density may be estimated: 
         [0000]    
       
         
           
             
               psd 
               
                 N 
                 + 
                 I 
               
             
             = 
             
               
                 2 
                 L 
               
                
               
                 { 
                 
                   
                     
                       ∑ 
                       
                         d 
                         = 
                         
                           d 
                           
                             offset 
                             - 
                             
                               [ 
                               
                                 
                                   
                                     L 
                                     4 
                                   
                                   + 
                                   1 
                                 
                                 , 
                                 
                                     
                                 
                                  
                                 … 
                                  
                                 
                                     
                                 
                                 , 
                                 
                                   L 
                                   2 
                                 
                               
                               ] 
                             
                           
                         
                       
                     
                      
                     
                       P 
                        
                       
                         ( 
                         d 
                         ) 
                       
                     
                   
                   + 
                   
                     
                       ∑ 
                       
                         d 
                         = 
                         
                           d 
                           
                             offset 
                              
                             
                                 
                             
                             + 
                             
                               [ 
                               
                                 
                                   L 
                                   4 
                                 
                                 , 
                                 
                                     
                                 
                                  
                                 … 
                                  
                                 
                                     
                                 
                                 , 
                                 
                                   
                                     L 
                                     2 
                                   
                                   - 
                                   1 
                                 
                               
                               ] 
                             
                           
                         
                       
                     
                      
                     
                       P 
                        
                       
                         ( 
                         d 
                         ) 
                       
                     
                   
                 
                 } 
               
             
           
         
       
     
         [0115]    The same psd N+1  may be used in the discriminator (for instance P th  can be calculated as psd N+1  multiplied with a constant). Alternatively, the noise plus interference power measurements may be measured by subtracting the power of the discriminated signal from the total power. 
         [0116]    For tracking, no corrections are performed in the Preamble post-processing module  14 . The timing offset of the received preamble is computed as the sum of the timestamp at the beginning of the OFDM symbol analyzed and the measured offset with respect to the beginning of the symbol: 
         [0000]    
       
         
           
             τ 
             = 
             
               Timestamp 
               + 
               
                 
                   d 
                   avg 
                 
                  
                 
                   N 
                   LT 
                 
                  
                 
                   T 
                   s 
                 
               
             
           
         
       
     
         [0117]    The statistics processing module  13  may pack the detection decision with the timing information and the signal quality measurements (signal power, noise and interference power, signal to noise plus interference ratio, etc.) and send the information to the control module  30  via the statistics channel. 
         [0118]    It may also be used to further filter the results of the commanded operations, for instance based on the calculated timing offset τ, a detection may be invalidated if the timing offset is too high, and it may be disregarded by the timing post-processing module. This way, the system may be more robust and it will stay locked even in harsh conditions. Those skilled in the art may imagine other criteria to invalidate the detection of the preamble. 
         [0119]    In the sections above, it has been described how the proposed receiver performs timing synchronization and associated signal quality measurements, by processing the preamble sent by the serving base station. 
         [0120]    However, another function of an embodiment of the proposed system is neighbor scanning, which translates into processing the received signal in an attempt to find the preamble sequences sent by the neighbor base stations and to measure the timing offset and signal quality indicators. 
         [0121]    Now let&#39;s describe an embodiment of the second operating mode, also called scanning. 
         [0122]    There may be two types of network deployment: 
         [0000]    Synchronous (the base stations of the network are synchronized; they have the same frame size and the transmission time of the preambles fall into a limited and known time interval). In this case, the preambles of neighbor base stations are searched in a limited interval around the known position of the preamble of the serving base station.
 
Asynchronous (there is no relationship between the timings of different base stations). In this case the preambles of neighbor base stations are searched in the whole frame, as they may be anywhere.
 
         [0123]    For synchronous networks, two cases are considered: 
         [0000]    Small cells: the timing difference due to the propagation delay is small enough and hence a single OFDM symbol is enough for the detection.
 
Large cells: the timing difference due to the propagation delay is large and the receiver processes more symbols centered around the preamble of the serving base station in order to detect the preambles of the neighbor base stations.
 
         [0124]      FIG. 9  shows the capturing windows (i.e. the timing offsets that are unambiguously detectable) for tracking and for the different scanning modes. 
         [0125]      FIG. 10  shows the observation windows used for tracking and for the different scanning modes. The observation windows are N-sample windows in the time domain, sampled with the nominal sampling period T s  and separated by N GI  samples that are discarded. They are known in the art as FFT windows, since the N-tuples will be processed further by an N-point FFT module. 
         [0126]    For large cells, scanning using for example three symbols was considered. However, those skilled in the art may choose a larger interval if the expected delay spread of the preambles in the network is larger. 
         [0127]    For scanning for synchronous networks with small cells, the processing is similar to tracking (first operating mode) of the current preamble, with some differences which will be described in the following. 
         [0128]    A major difference is in the scheduling and memory management. The control module  30  may request several preambles to be tested on the same FFT window. Moreover, the preambles may have different decimation offsets. In this case, the distinct decimated versions are stored in different pages of the multi-page memory, and they may be processed further without real-time constraints during the rest of the frame. For a given decimation offset all the preambles having that specific decimation offset may be tested. 
         [0129]    It is desirable that the windowing is done prior to the de-convolution in order to do it once for all preambles using the same decimation offset. 
         [0130]    For the preamble processing, the tracking and summing windows may be chosen in order to maximize the capturing window. 
         [0131]    The scanning for synchronous networks with large cells is somewhat different: the N-point FFT results for all of the needed symbols are stored after decimation (three symbols in the example) in order to allow non-real time processing of many preamble sequences. In order to minimize the memory size, the group of preambles that are to be tested should have the same decimation offset. 
         [0132]    However, other scheduling and storing mechanisms may be imagined, for instance if a small number of preambles are to be tested they may be processed in real time taking advantage of the reduced complexity (the complexity of an L-point IFFT is less than L/N the complexity of an N point FFT), using the memory as a buffer or as a FIFO (first in first out). 
         [0133]    The preamble processing module may be modified in order to jointly process two adjacent OFDM symbols since the preamble may be anywhere in between symbols due to large delay spread. 
         [0134]    If a preamble is part on the first symbol and part on the second symbol, the phase relationship between the CIR L  for the two symbols is known (depends on the length of the guard interval and the decimation offset). The known phase relationship might be used for coherent combining. 
         [0135]    One way to modify the preamble processing is to separately run it for each of the two symbols, and then use the stronger of the two discriminated CIRs (P i   (i) (d), i=1, 2) to select the taps for both CIRs: 
         [0000]    
       
         
           
             
               
                 P 
                 t 
                 
                   ( 
                   M 
                   ) 
                 
               
                
               
                 ( 
                 d 
                 ) 
               
             
             = 
             
               { 
               
                 
                   
                     
                       
                         
                           
                             
                               P 
                               t 
                               
                                 ( 
                                 1 
                                 ) 
                               
                             
                              
                             
                               ( 
                               d 
                               ) 
                             
                           
                         
                         
                           
                             
                               if 
                                
                               
                                   
                               
                                
                               max 
                                
                               
                                 { 
                                 
                                   
                                     SP 
                                     t 
                                     
                                       ( 
                                       1 
                                       ) 
                                     
                                   
                                    
                                   
                                     ( 
                                     n 
                                     ) 
                                   
                                 
                                 } 
                               
                             
                             &gt; 
                             
                               max 
                                
                               
                                 { 
                                 
                                   
                                     SP 
                                     t 
                                     
                                       ( 
                                       2 
                                       ) 
                                     
                                   
                                    
                                   
                                     ( 
                                     n 
                                     ) 
                                   
                                 
                                 } 
                               
                             
                           
                         
                       
                       
                         
                           
                             
                               P 
                               t 
                               
                                 ( 
                                 2 
                                 ) 
                               
                             
                              
                             
                               ( 
                               d 
                               ) 
                             
                           
                         
                         
                           otherwise 
                         
                       
                     
                      
                     
                       
 
                     
                      
                     
                       
                         SP 
                         t 
                         
                           ( 
                           i 
                           ) 
                         
                       
                        
                       
                         ( 
                         n 
                         ) 
                       
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         d 
                         ∈ 
                         
                           
                             n 
                             + 
                           
                           &lt; 
                           
                             summing 
                              
                             
                                 
                             
                              
                             window 
                           
                           &gt; 
                         
                       
                     
                      
                     
                       
                         P 
                         t 
                         
                           ( 
                           i 
                           ) 
                         
                       
                        
                       
                         ( 
                         d 
                         ) 
                       
                     
                   
                 
                 , 
                 
                   i 
                   = 
                   1 
                 
                 , 
                 
                   
                     2 
                      
                     
                       
 
                     
                      
                     where 
                      
                     
                       
 
                     
                      
                     
                       
                         P 
                         t 
                         combined 
                       
                        
                       
                         ( 
                         d 
                         ) 
                       
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               
                                 P 
                                 
                                   ( 
                                   1 
                                   ) 
                                 
                               
                                
                               
                                 ( 
                                 d 
                                 ) 
                               
                             
                             + 
                             
                               
                                 P 
                                 
                                   ( 
                                   2 
                                   ) 
                                 
                               
                                
                               
                                 ( 
                                 d 
                                 ) 
                               
                             
                           
                         
                         
                           
                             
                               when 
                                
                               
                                   
                               
                                
                               
                                 
                                   P 
                                   t 
                                   
                                     ( 
                                     M 
                                     ) 
                                   
                                 
                                  
                                 
                                   ( 
                                   d 
                                   ) 
                                 
                               
                             
                             &gt; 
                             0 
                           
                         
                       
                       
                         
                           0 
                         
                         
                           
                             
                               when 
                                
                               
                                   
                               
                                
                               
                                 
                                   P 
                                   t 
                                   
                                     ( 
                                     M 
                                     ) 
                                   
                                 
                                  
                                 
                                   ( 
                                   d 
                                   ) 
                                 
                               
                             
                             = 
                             0 
                           
                         
                       
                     
                   
                 
               
             
           
         
       
     
         [0136]    The same sliding sum mechanism is used on the combined discriminated P t   combined (d). 
         [0137]    Those skilled in the art may imagine different ways to jointly process the two symbols, without departing from the spirit and scope of this disclosure. 
         [0138]    There is also a deterministic amplitude relationship between the CIR L  for the two adjacent symbols, depending on the position of the preamble in the two symbols. The amplitude relationship may be used to solve the timing uncertainty due to the T-times repetition of the preamble (the preamble consists of T-times repetition of a sequence of length 
         [0000]    
       
         
           
             
               N 
               T 
             
              
             
               T 
               s 
             
           
         
       
     
         [0000]    ). 
         [0139]    The preamble processing module  14  illustrated in  FIG. 8  may have in this case a set of outputs for each pair of adjacent OFDM symbols. 
         [0140]    The preamble post processing module may be used to remove the timing uncertainty based on the power of the two discriminated CIRs (the correction factor is an integer multiple of the length of the basic sequence repeated 
         [0000]    
       
         
           
             
               N 
               T 
             
              
             
               T 
               s 
             
           
         
       
     
         [0000]    and is determined by look-up tables or threshold methods or any other means, as a function of timing offset and power of the two discriminated CIRs). 
         [0000]    
       
         
           
             
               
                 
                   τ 
                   = 
                   
                     Timestamp 
                     + 
                     
                       
                         d 
                         avg 
                       
                        
                       
                         N 
                         LT 
                       
                        
                       
                         T 
                         s 
                       
                     
                     + 
                     
                       COR 
                        
                       
                           
                       
                        
                       
                         N 
                         T 
                       
                        
                       
                         T 
                         s 
                       
                     
                   
                 
               
             
             
               
                 
                   = 
                   
                     Timestamp 
                     + 
                     
                       
                         ( 
                         
                           
                             d 
                             avg 
                           
                           + 
                           
                             L 
                             · 
                             COR 
                           
                         
                         ) 
                       
                        
                       
                         N 
                         LT 
                       
                        
                       
                         T 
                         s 
                       
                     
                   
                 
               
             
           
         
       
     
         [0141]    For the power statistics, another correction may be applied (the power is split between the two symbols). Again, the power correction factor is determined by look-up tables or threshold methods or any other means, as a function of timing offset and power of the two discriminated CIRs. 
         [0142]    In the statistics processing module  13 , a maximum search is performed on the partial results. For detection on K symbols (3 in our example), K−1 pairs of symbols are processed by the preamble processing module ({ 1 , 2 }, { 2 , 3 }, . . . , {K−1,K}), hence K−1 sets of statistics are available, one for each pair processed. The K−1 results are further refined by the preamble post-processing module. 
         [0143]    The statistics processing module first determines if a detection occurred (at least one of the K−1 results indicates a detection), then a maximum search is performed on the power measurement, and the other corresponding measurements are packed with the power measurement and sent to the control entity via the statistics channel. Conversely, all of the measurements may be provided to the control entity without filtering by maximum search. Moreover, only the measurements for the detections may be provided. 
         [0144]    The processing for asynchronous networks is very similar to the processing for large cells in synchronous networks, the only difference being that the search interval is considerably larger, in order to cover a frame length (the preamble is sent every frame at fixed positions in a periodic fashion), as shown in  FIG. 9  and in  FIG. 10 . Consequently, since the processing is done on a large number of symbols, in order to use a reasonable amount of memory, the processing maybe done in real-time using the memory  123  as a buffer or as a FIFO, and a smaller number of preambles may be processed in a multiplexed fashion. This is possible because of the reduced complexity of the L-point IFFT compared to the N-point FFT. During the processing of the N-point FFT, more than NIL preambles may be processed (more than four in the preferred application). 
         [0145]    It has been shown that the proposed device is capable of scanning for neighbor base stations in all types of deployments. However, an embodiment of the proposed invention is flexible enough to accommodate other functions like soft combining for macro-diversity, multiple receive chains, etc. Other functions may be accommodated by combining the basic functions described in an embodiment of invention. 
         [0146]    Using the aforementioned functions in reversed order, the power up strategy becomes evident. Due to the low complexity, a fast power-up is possible. First, a cell search is performed (using scanning for asynchronous networks for a subset of the preambles and for a given frequency offset hypothesis). The preambles detected are further analyzed with a 3-symbol acquisition window (using scanning for synchronous networks, large cells). 
         [0147]    If successful, the frame structure is established and the receiver enters the steady-state tracking mode (optionally synchronous scan for small cells may be used to select the best base station). 
         [0148]    Once the receiver is in tracking mode, it may immediately continue scanning in order to find a better base station. At any time, the scanning may be done in parallel with normal data reception in a seamless fashion. 
         [0149]    Those skilled in the art may imagine different power-up strategies and different functions for the described apparatus, without departing from the spirit and scope of the present disclosure. 
         [0150]    Thus, using the aforementioned techniques, a comprehensive set of techniques is provided to ensure timing synchronization from power-up to functional steady-state timing tracking. Furthermore, using these techniques, all types of scanning may be available and therefore they may be used in all type of deployments, for example in mobile point-to-multipoint applications deployed in a cellular network. 
         [0151]    The low complexity of the algorithms yields the low power consumption in mobile applications, allowing for instance portable terminals with reasonable battery autonomy. The scanning may be done quickly and during the data reception, minimizing the need for special scanning intervals, and hence allowing the mobile station to sleep more in order to conserve its power. In addition, a reasonable time for power-up to operational state (in order of seconds) is possible, and when service interruption occurs due to very harsh conditions, a quick recovery is possible. 
         [0152]    An application is the OFDMA physical layer based on a 1024 point FFT of the IEEE 802.16 standard. 
         [0153]    An embodiment of this invention applies (but it is not limited) to mobile stations. 
         [0154]    Therefore, an embodiment of the invention offers: 
         [0000]    a simple algorithm for steady-state timing tracking, which includes a correlation with an expected training sequence, carried out in the frequency domain and then transformed back to time domain, where the channel impulse response may be discriminated from the noise. One advantage is that all of the processing is done using discrete sets of samples by evaluating only the FFT result of fixed FFT windows spaced by the nominal cyclic prefix. Hence, a lot of the processing may be shared with a demodulator, and parallel processing is possible;
 
a computationally efficient scanning for synchronous scanning in small cells (that is to say in the case where training sequences are synchronous among base stations of the network and the search domain is not far from the training sequence of the serving base station, using only one OFDM symbol for the detection), by using a specific scheduling of the functional module. Notably, it may seamlessly be done during normal operation;
 
a computationally efficient scanning for synchronous scanning in large cells (that is to say in the case where the search domain is larger, using for example one OFDM symbol before and one OFDM symbol after the symbol containing the training sequence of the serving base station for the detection), by scheduling the functional module to run a first detection over the symbol before and the symbol containing the training sequence of the serving base station, and a second detection over the symbol containing the training sequence of the serving base station and the symbol after, and the choosing the best result of the detections; and
 
an efficient scanning for power-up cell search or for scanning asynchronous base stations during normal operation, by using the processing over two OFDM symbols and extending the interval to the known length of frame.
 
         [0155]    Therefore a comprehensive set of methods is provided to ensure timing synchronization from power-up to functional steady-state timing tracking, and all types of scanning are available and can be used in all type of deployments.