Abstract:
A method and arrangement for automatic frequency correction in UTRA TDD mode, having a first stage ( 500 ) for frequency lock in idle mode, and a second stage ( 600 ) for receiving a channel estimate from beacon function (mx 1 ), receiving a channel estimate from at least one other physical channel (mx 2 ), and receiving output from a primary synchronisation code correlator (mx 0 , pc 1 , pc 2 ), and for producing therefrom signals (X,Y,N) for use in frequency correction. By utilising first and second partial correlation values (pc 1 , pc 2 ) which are balanced, DC offset effects may be substantially removed. This provides the following advantage of significantly improving performance at low levels of SNR, and removal of DC offset effects provides immunity to DC offsets arising from imperfections in hardware.

Description:
FIELD OF THE INVENTION  
         [0001]    This invention relates to wireless communication networks and particularly to UTRA (Universal Mobile Telephone System Terrestrial Radio Access) networks operating in TDD (Time Division Duplex) mode.  
         BACKGROUND OF THE INVENTION  
         [0002]    In UTRA TDD mode the synchronisation channel (SCH) has two functions. The primary function is to provide a signal that enables a ‘UE’ (user equipment, such as a wireless terminal) to search for and identify a ‘Node B’ (i.e, a wireless Base Station of a UMTS system). The secondary function is to provide sufficient information to allow a UE to demodulate a P-CCPCH (Primary Common Control Physical CHannel) transmission and obtain the system information, sent on the BCH (Broadcast Channel) transport channel which is carried by the P-CCPCH, needed in order to be able to communicate with the network. The physical channel P-CCPCH has the characteristics of the Beacon Function, as defined in the technical specification ‘3GPP TS 25.221’ publicly available on the website (www.3gpp.org) of the 3 rd  Generation Partnership Project.  
           [0003]    There are two cases of SCH and P-CCPCH allocation as follows:  
                                                       Case 1)   SCH and P-CCPCH allocated in timeslot #k,               where k = 0 . . . 14           Case 2)   SCH allocated in two timeslots: timeslot #k               and timeslot #k + 8, where k = 0 . . . 6;               P-CCPCH allocated in timeslot #k                      
 
           [0004]    where timeslot #k is the k th  timeslot. Due to this SCH scheme, the position of P-CCPCH is known from the SCH. The SCH consists of one real-valued primary synchronisation code (PSC) and three complex secondary synchronisation codes (SSCs), all of length 256 chips. The PSC is common for all Node Bs, but the SSCs are Node B specific. The PSC and SSC are transmitted simultaneously from a given Node B at a specific fixed time offset (t offset ) from the start of the timeslot. The time offset is included to prevent the possible capture effect that would otherwise occur as a consequence of all Node Bs transmitting the common primary code at the same time.  
           [0005]    Automatic Frequency Correction (AFC) is typically employed in UTRA TDD mode to correct for frequency offsets occurring in the presence of noise in the received signal. In UTRA TDD mode the PSC typically operates in negative values of SNR, which with conventional methods of AFC give rise to a large frequency offset, degrading performance.  
           [0006]    A need therefore exists for frequency correction wherein the abovementioned disadvantage(s) may be alleviated.  
         STATEMENT OF INVENTION  
         [0007]    In accordance with a first aspect of the present invention there is provided a method for automatic frequency correction in UTRA TDD mode, the method comprising:  
           [0008]    performing a frequency lock with a signal including received samples; and  
           [0009]    receiving a channel estimate from beacon function, receiving a channel estimate from at least one other physical channel, and receiving output from a primary synchronisation code correlator, and for producing therefrom signals for use in frequency correction.  
           [0010]    In accordance with a second aspect of the present invention there is provided an arrangement for automatic frequency correction in UTRA TDD mode, the arrangement comprising:  
           [0011]    means for performing a frequency lock with a signal including received samples; and  
           [0012]    means for receiving a channel estimate from beacon function, receiving a channel estimate from at least one other physical channel, and receiving output from a primary synchronisation code correlator, and for producing therefrom signals for use in frequency correction.  
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0013]    One method and arrangement for multistage frequency correction incorporating the present invention will now be described, by way of example only, with reference to the accompanying drawings, in which:  
         [0014]    [0014]FIG. 1 shows in schematic form the format of SCH in UTRA TDD mode;  
         [0015]    [0015]FIG. 2 shows in schematic form a prior art arrangement for Automatic Frequency Control in UTRA TDD mode;  
         [0016]    [0016]FIG. 3 shows a graphical representation of the Frequency Offset performance of the AFC arrangement of FIG. 2 as a function of Signal-to-Noise Ratio (SNR);  
         [0017]    [0017]FIG. 4 shows in block schematic form the process flow of AFC employed in the present invention;  
         [0018]    [0018]FIG. 5 shows in block schematic form a first stage in AFC employed in the present invention;  
         [0019]    [0019]FIG. 6 shows in block schematic form a second stage in AFC employed in the present invention; and  
         [0020]    [0020]FIG. 7 shows a graphical representation of the Frequency Offset performance of the AFC arrangement of FIGS. 4, 5 &amp;  6  as a function of Signal-to-Noise Ratio (SNR). 
     
    
     DESCRIPTION OF PREFERRED EMBODIMENTS  
       [0021]    The general format of the SCH is shown schematically in FIG. 1. As shown, the primary synchronisation code (PSC), C p , is a real-valued sequence of length 256 chips, transmitted at power P PSC . The secondary synchronisation code (SSC), C s,i (i=1, 2, 3), of length 256 is transmitted simultaneously with the PSC; the total power of the SSC is set to P SSC . In addition these codes are multiplied by a complex value, b j (j=1, 2, 3). The subscript s in C s,i  refers to a code set, of which there 32, as specified in the technical specification ‘3GPP TS 25.223’ publicly available on the website (www.3gpp.org) of the 3 rd  Generation Partnership Project. The code sets, s, in conjunction with the complex multiplier values, b j , are used to transfer the information bits to the UE.  
         [0022]    The location of the SCH relative to the beginning of the time slot is defined by t offset,n . It is calculated as follows:  
         t     offset              ,   n       =     {               n   .     T   c            ⌊       976   -   256     15     ⌋                   n     &lt;   16                     (     976   +   512   +       (     n   -   16     )          ⌊       976   -   256     15     ⌋         )          T     c                                n     ≥   16                                                
 
         [0023]    which can be simplified to:  
         t     offset              ,   n       =     {             n        .48   .     T   c                     n     &lt;   16                     (     720   +     n      .48       )          T   c                   n     ≥   16                                                
 
         [0024]    where T c  is the chip duration and n=0, 1, . . . , 31. The value of n is related to the code group and is obtained by demodulating the information on the SSC.  
         [0025]    The PSC, p, is constructed as a generalised hierarchical Golay sequence. The sequence used for p has been chosen to have good a periodic autocorrelation properties. Defining a sequence ‘G’ as  
         [0026]    G=[g 1 g 2 g 3  . . . g 16 ]=[1 1 1 −1 −1 1 −1 −1 1 1 −1 −1 1 1] 
         [0027]    and defining a sequence ‘a’ as  
         [0028]    a=[1 1 1 1 1 1 −1 −1 1 −1 1 −1 1 −1 −1 1] 
         [0029]    the primary code sequence is obtained by spreading sequence ‘G’ by the sequence ‘a’, producing the resulting primary sequence given by 
           p =(1 +j ).[ g   1   ·a g   2   ·a g   3   ·a . . . g   16   ·a]   
         [0030]    Referring now to FIG. 2, a conventional Automatic Frequency Correction (AFC) system  200  consists of a frequency estimator  210 , a filter  220 , and a Voltage Controlled Oscillator (VCO)  230 .  
         [0031]    The received samples are applied to PSC correlator  240 . The vector of received samples that produced the highest correlation peak are applied to the frequency estimator  210 . Let r=(r 0 , . . . , r 255 ) be the sequence of received samples that produce the highest complex peak at the output of PSC correlator, and p=(p 0 , . . . , p 255 ) be the complex PSC. Then we can write 
         
       r=p+n 
     
         [0032]    where n=(n 0 , . . . , n 255 ) is a noise/interference vector with zero mean and variance 2σ 2 . In order to obtain an estimate of the frequency offset, we take partial correlations of the PSC such that  
         pc   1     =       ∑     i   =   0     127            r   i          p   i   *                   pc   2     =       ∑     i   =   0     127            r     i   +   128            p     i   +   128     *                               
 
         [0033]    where pc 1  and pc 2  are the result of 2 partial correlations of length 128. The phase difference between pc 1  and pc 2  is given by: 
         
       C=pc 
       1 
       ×pc* 
       2 
       
         
           
             Δφ 
             = 
             
               
                 tan 
                 
                   - 
                   1 
                 
               
                
               
                 ( 
                 
                   
                     Im 
                      
                     
                       ( 
                       C 
                       ) 
                     
                   
                   
                     Re 
                      
                     
                       ( 
                       C 
                       ) 
                     
                   
                 
                 ) 
               
             
           
         
                 
         
             
         
       
     
         [0034]    A look-up table generally provides the tan −1 (·) function. The instantaneous frequency offset is given by:  
         Δ                   f   k       =         1     2      π            Δφ   dt       =       1     2      π            Δφ     128        T   c            Hz                             
 
         [0035]    where T c  is the chip period and  128  is the distance in chips between the correlation peaks pc 1  and pc 2 . The instantaneous frequency offset is filtered to obtain an average value, and then applied to a Voltage Controlled Oscillator, which is adjusted to remove the frequency difference.  
         [0036]    Considering the frequency estimator in more detail, and supposing there is no frequency offset, but Gaussian noise is present, then the output of the two partial correlators is given by 
         
       pc 
       1 
       =U 
       1 
       +N 
       1 
     
         
       pc 
       2 
       =U 
       2 
       +N 
       2 
     
         [0037]    where U 1 =U 2 =128,  
         N   1     =       ∑     i   =   0     127            n   i          p   i   *                               
 
         [0038]    and  
         N   2     =       ∑     i   =   0     127            n     i   +   128              p     i   +   128     *     .                               
 
         [0039]    The phase perturbation by the noise term is given by  
       C   =     (       128   2     +     128        (       N   2   *     +     N   1       )         )             Δφ   =       tan     -   1            (       [     Im   (       N   2   *     +     N   1       )     ]       [     Re   (     128   +     N   2   *     +     N   1       )     ]       )                             
 
         [0040]    We note the maximum phase perturbation occurs when (N* 2 +N 1 ) is purely imaginary. We write  
         Δφ   max     =       tan     -   1            (       [     Im        (       N   2   *     +     N   1       )       ]     128     )                             
 
         [0041]    Recognising that the variance of the items inside the brackets yields  
             E        (     |     N   2   *          |   2       )       +     E        (     |     N   1          |   2       )           128   2       =       2        σ   2       128                           
 
         [0042]    we can rewrite the phase perturbation at the output of the partial correlator as  
         φ     1   ,   n       =       tan     -   1            (     1       128   ×                SNR   ip           )                             
 
         [0043]    where the SNR at the input to the partial correlator is given by  
         SNR   ip     =         E        (          p        2     )         E        (          n        2     )         =     1     2        σ   2                                 
 
         [0044]    and the expectation operator, E(·), is taken over 128 chips. FIG. 3 shows the frequency offset generated for varying levels of SNR ip . In UTRA TDD mode the PSC typically operates in negative values of SNR, which with the above-described conventional method of AFC gives rise to a large frequency offset, degrading performance.  
         [0045]    The present invention proposes a method and arrangement for AFC in UTRA TDD mode which facilitates improved performance under low values of SNR.  
         [0046]    Referring now to FIG. 4, in a preferred embodiment of the invention AFC consists of two stages:  
         [0047]    Stage 1—operated in Idle mode only  
         [0048]    Stage 2—operated in Idle/Connected mode  
         [0049]    The first stage is used to obtain fast acquisition, by initially using a wide bandwidth and then narrowing to suppress noise and interference. The second stage is used to further improve performance under severe noise conditions.  
         [0050]    The analysis below utilises the following variables:  
         [0051]    mx 0 : Complex peak from the output of the PSC correlator,  
         [0052]    mx 1 : Complex peak from the output of the Beacon function channel estimator, and  
         [0053]    mx 2 : Complex peak from the output of the channel estimator located in adjacent timeslot to the Beacon function (although the adjacent timeslot is used here, it can be shown that other timeslot pairings also apply).  
         [0054]    As shown in FIG. 4, the AFC algorithm is given by: 
           C=X×Y*   (410) 
         [0055]    where X and Y ε{(pc 1 , pc 2 ),(mx 2 , mx 1 ),(mx 0 , mx 1 )}. An estimate of the phase difference is given by  
               Δ                 φ     =         tan     -   1            (       Im        (   C   )         Re        (   C   )         )          rads             (   420   )                               
 
         [0056]    A look-up table can provide this function. The instantaneous frequency offset is given by:  
               Δ                   f   k       =         1     2                 π          Δ                   φ   dt       =       1     2      π              Δ                 φ       NT   c          Hz               (   430   )                               
 
         [0057]    where N is the distance in chips between the X and Y samples and T c  is the chip period. The running mean of the frequency offset is given by  
         Δ                     f   -     k       =              ∑   k       i   =   1            Δ                   f   i                                    
 
         [0058]    where the over-bar denotes mean value. The mean of the frequency offset is used to trigger certain events during initial synchronization. The instantaneous frequency offset is filtered, giving 
           f   k   =Af   k−1   +BΔf   k   (440) 
         [0059]    The output of the filter is multiplied by the loop gain constant K, yielding the output 
           f   l,k   =Kf   k   (450) 
         [0060]    This output f l,k  is subsequently applied to a single-bit DAC (not shown), which is used to derive a suitable voltage level for tuning the VCO.  
         [0061]    AFC Stage 1  
         [0062]    As shown is FIG. 5, two processes are implemented in Stage 1 ( 500 ):  
         [0063]    a) Bandwidth reduction (processes  510  and  520 , shown together as 530), and  
         [0064]    b) Signalling of AFC lock ( 540 ) so Stage 2 can be entered.  
         [0065]    Stage1/Process A  
         [0066]    The UE is powered up and starts an initial cell search. Once Frame lock has been acquired, the UE attempts to achieve frequency lock with the Node B.  
         [0067]    Let the first radio frame after frame lock be k=1, and the initial loop parameters are set to X=pc 1 , Y=pc 2 , N=128, in addition to ensure a quick acquisition time filter constants A and B and the loop gain K are set to:  
         [0068]    A=Wide_ 1 , B=Wide_ 2 , K=Wide_ 3   
         [0069]    Where Wide_ 1 , Wide_ 2 , and Wide_ 3  have been chosen to ensure a wide bandwidth. After N B  samples of Δf k , the mean Δ{overscore (f)} k,B  is calculated. If Δ{overscore (f)} kB  is less than a first predetermined value Set_Frequency 1 , the counter N A  is incremented. Once N A  has reached a specified value the loop gain and also the filter constants are updated to:  
         [0070]    A=Narrow_ 1 , B=Narrow_ 2 , K=Narrow_ 3   
         [0071]    Where, Narrow_ 1 , Narrow_ 2 , and Narrow_ 3  have been chosen to ensure a narrow bandwidth. If Δ{overscore (f)} k,B  is greater than Set_Frequency 1  the next value ΔA{overscore (f)} k+1  is calculated, and ΔA{overscore (f)} k+1,B  is calculated, repeating the above test. This process operates under a sliding window of span N B  and is given by  
         Δ                     f   -       k   ,   B         =                ∑   k       i   =     k   -     N   B     +   1              Δ                   f   i              :     k   ≥     N   B                               
 
         [0072]    Process B can only be entered when the loop gain and filter constants have been updated in Process A.  
         [0073]    Stage1/Process B  
         [0074]    This process is used to signal that AFC lock has been acquired. N A  is reset to 0 and N B +A is considered to be the number of samples required to trigger the Process 1, where Δ is additional samples. After N B +Δ+N L  samples, ΔA{overscore (f)} k  is calculated across a range of N L . This is given by  
         Δ                     f   -     k       =                ∑   k       i   =     k   -     N   L     +   1              Δ                   f   i              :     k   ≥       N   B     +   Δ   +     2        N   L                                   
 
         [0075]    When ΔA{overscore (f)} k  is less than a second predetermined value Set_Frequency 2 , the counter N A  is incremented. Stage 1 is exited when N A  reaches a specified value that signifies AFC lock has occurred.  
         [0076]    AFC Stage 2  
         [0077]    Referring now also to FIG. 6, when Stage 1 has been exited the UE will attempt to demodulate the SSC to determine the cell time offset. Once the UE is aware of the cell time offset, it will attempt to demodulate the beacon function on every radio frame. Similarly, once the UE moves from idle mode into connected mode channel estimate information may be available from other physical channels.  
         [0078]    Therefore, in connected mode the UE should have at its disposal the channel estimate from the beacon function (mx 1 ), the channel estimate from other physical channels, for example the adjacent timeslot to the Beacon function (mx 2 ), and the output of the PSC correlator (mx 0 , pc 1 , pc 2 ). The algorithm for Stage 2 ( 600 ) is given by  
         [0079]    If ΔA{overscore (f)} k &lt;Set_Frequency 2   
         [0080]    If mx 1 &gt;0 &amp; mx 2 &gt;0  
         [0081]    X=mx 2    
         [0082]    Y=mx 1    
         [0083]    N=−2560  
         [0084]    elseif mx 1 &gt;0  
         [0085]    X=mx 0    
         [0086]    Y mx 1   
       N   =     (     1261   -     (         t     offset   ,              n         T   c       +   128     )       )                           
 
         [0087]    else  
         [0088]    X=pc 1    
         [0089]    Y=pc 2    
         [0090]    N=128  
         [0091]    end  
         [0092]    else  
         [0093]    X=pc 1    
         [0094]    Y=pc 2    
         [0095]    N=128  
         [0096]    end  
         [0097]    Essentially, the quality of the estimate degrades as we move through the control flow, the best estimate being given by mx 1  and mx 2 . The mean of the frequency estimate is continually examined in order to detect any sudden frequency changes. This is achieved by continually testing for Set_Frequency 2 , if this value is exceeded the partial correlations from the PSC are employed. When channel estimate information is used from other timeslots, we only use channel estimates from adjacent slots so as to prevent aliasing. The allowed timeslot pairings are given in the following table.  
                                       Pairing   mx 1     mx 2                     0   0   1       1   1   2       2   2   3       3   3   4       4   4   5       5   5   6       6   6   7       7   7   8       8   8   9                  
 
         [0098]    The value of N is fixed at −2560 for any pairing, and only one estimate should be used per frame. If multiple pairings are available, then the average should be taken.  
         [0099]    The improvement in SNR through AFC stage 2 is shown in the FIG. 7, in which three different cases (i), (ii) and (iii) are compared:  
         [0100]    (i) Conventional Method: X=pc 1 , Y=pc 2 , N=128  
         [0101]    (ii) X=mx 0 , Y=mx 1 , n=16, N=413  
         [0102]    (iii) X=mx 2 , Y=mx 1 , N=−2560  
         [0103]    For case (ii) the improvement for the smallest value of N can be seen, which occurs when n=15.  
         [0104]    As will be shown below, further improvement of the two-stage AFC process described above is possible to remove DC offset typically arising from imperfections in the hardware. DC removal is achieved in the following manner:  
         [0105]    Suppose the discrete time received sequence is given by 
         
       r=p+n+I 
       dc 
     
         [0106]    where I dc  is complex DC interference. If the sequence has a length of 128 chips, then we can write the autocorrelation function (ACF) at zero shift of P k  as  
       pc   =         ∑   127       i   =   0              r   i          p   i   *                               
 
         [0107]    Rewriting gives  
       pc   =           ∑   127       i   =   0              p   i          p   i   *         +         ∑   127       i   =   0              n   i          p   i   *         +       I   dc              ∑   127       i   =   0            p   i   *                                 
 
         [0108]    By designing the sequence such that the sum of the elements is zero the DC interference can be effectively removed, we have  
       pc   =         ∑     i   =   0     127                       p   i          p   i   *         +       ∑     i   =   0     127            n   i          p   i   *                 Let             ∑     i   =   0     127          p     i   +     α                 16           =     4   ×     (     1   +   j     )     ×       ∑     j   =   1     8          g     j   +   α                                 
 
         [0109]    where Σa=4, and α=(0,1, . . . , 8). The sequence balance is given in the table below.  
                                                                   α             Sequence                 Balance     =       ∑     j   =   1     8          g     j   +   a                                                           0   0           1   0           2   0           3   0           4   0           5   2           6   0           7   2           8   4                      
 
         [0110]    By examining the above table we see that the conventional approach uses sequences α=(0,8) which gives the highest level of DC gain. We choose a=(0,6) which gives a pair of with maximum distance in terms of N. The modified partial correlations become  
         pc   1     =       ∑     i   =   0     127            r   i          p   i   *                   pc   2     =       ∑     i   =   0     127            r     i   +   96            p     i   +   96     *                               
 
         [0111]    where the time shift of the second partial correlation has been reduced from 128 to 96 to ensure DC cancellation. In terms of frequency estimation, this means that N is also reduced from 128 to 96.  
         [0112]    It will be appreciated that the method for automatic frequency control described above will typically be carried out in software running on a processor (not shown), and that the software may be provided as a computer program element carried on any suitable data carrier (not shown) such as a magnetic or optical computer disc.  
         [0113]    It will be appreciated that the above described AFC method and arrangement are based on an improved AFC scheme for correction of frequency offsets in UTRA TDD mode.  
         [0114]    It will be understood that the improved AFC scheme provides the following advantages: the multistage scheme for correction of frequency offsets in UTRA TDD mode allows operation under very high levels of noise, and is also immune to DC offsets arising from imperfections in the hardware.