Abstract:
Timing parameters and an identity of a particular one of a number of cell groups are indicated in a signal transmitted in a cellular communication system having a radio frame in a physical layer, the radio frame comprising a number of time slots. In a known one of the time slots, a synchronization signal, S 1 , is transmitted that comprises a pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  ({tilde over (S)} i ≠{tilde over (S)} j ) arranged in a first ordering. In another known one of the time slots, a synchronization signal, S 2 , is transmitted that comprises the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  arranged in a second ordering. The selected pair of sequences is uniquely identified with the particular cell group, and the first ordering of the sequences is used only for transmission in the known one of the time slots, and the second ordering of the sequences is used only for transmission in said another known one of the time slots.

Description:
CLAIMING BENEFIT OF PRIOR FILED U.S. APPLICATION 
       [0001]    This application is a continuation of Ser. No. 13/159,017 filed on Jun. 13, 2011, which is a continuation of U.S. patent application Ser. No. 12/522,166, filed Aug. 28, 2009, which is a National Phase Entry of International Application PCT/EP2007/063493, with an international filing date of Dec. 7, 2007, which claims the benefit of U.S. Provisional Application No. 60/883,898 filed on Jan. 8, 2007, and the contents of all of the preceding are hereby incorporated herein by reference. 
     
    
     BACKGROUND 
       [0002]    The present invention relates to methods and apparatuses for identifying cells in a cellular communication system. 
         [0003]    In the forthcoming evolution of the mobile cellular standards like the Global System for Mobile Communication (GSM) and Wideband Code Division Multiple Access (WCDMA), new transmission techniques like Orthogonal Frequency Division Multiplexing (OFDM) are likely to occur. Furthermore, in order to have a smooth migration from the existing cellular systems to the new high capacity high data rate system in existing radio spectrum, a new system has to be able to utilize a bandwidth of varying size. A proposal for such a new flexible cellular system, called Third Generation Long Term Evolution (3G LTE), can be seen as an evolution of the 3G WCDMA standard. This system will use OFDM as the multiple access technique (called OFDMA) in the downlink and will be able to operate on bandwidths ranging from 1.25 MHz to 20 MHz. Furthermore, data rates up to 100 Mb/s will be supported for the largest bandwidth. However, it is expected that 3G LTE will be used not only for high rate services, but also for low rate services like voice. Since 3G LTE is designed for Transmission Control Protocol/Internet Protocol (TCP/IP), Voice over IP (VoIP) will likely be the service that carries speech. 
         [0004]    The physical layer of a 3G LTE system includes a generic radio frame having a duration of 10 ms.  FIG. 1  illustrates one such frame  100 . Each frame has 20 slots (numbered  0  through  19 ), each slot having a duration of 0.5 ms. A sub-frame is made up of two adjacent slots, and therefore has a duration of 1 ms. 
         [0005]    One important aspect of LTE is the mobility function. Hence, synchronization symbols and cell search procedures are of major importance in order for the User Equipment (UE) to detect and synchronize with other cells. To facilitate cell search and synchronization procedures, defined signals include primary and secondary synchronization signals (P-SyS and S-SyS, respectively), which are transmitted on a Primary Synchronization Channel (P-SCH) and a Secondary Synchronization Channel (S-SCH), respectively. The P-SySs and S-SySs are each broadcast twice per frame: once in sub-frame  0 , and again in sub-frame  5 , as shown in  FIG. 1 . 
         [0006]    The currently proposed cell search scheme for LTE is as follows: 
         [0007]    1. Detect one out of three possible P-SyS symbols, thereby indicating the 5 ms timing and the cell ID within a currently unknown cell group. 
         [0008]    2. Detect frame timing and cell group using the S-SyS. This in combination with the results from step 1 gives an indication of the full cell ID. 
         [0009]    3. Use the reference symbols (also called CQI pilots) to detect the cell ID. The interested reader is referred to the document R1-062990, entitled “Outcome of cell search drafting session”, TSG-RAN WG1 #46bis, Oct. 9-13, 2006 for more information about this proposal. 
         [0010]    4. Read the Broadcast Channel (BCH) to receive cell-specific system information. 
         [0011]    The SyS signals transmitted on the S-SCH are constructed as a pair of sequences, S 1 , S 2  (see  FIG. 1 ). The sequences are defined in the frequency domain. The signals to be transmitted on the S-SCH should be constructed such that the SyS pair S 1 , S 2  should uniquely define the cell group and 10 ms frame timing once detected by the UE such that the cell group pn-sequence is detected and the UE can start the verification step (stage  3 ) of the above-described process (i.e., verification of the cell ID detected from stage  1  and stage  2  processing). 
         [0012]    Furthermore, in order to minimize interruption time when performing Inter-frequency and Inter-Radio Access Technology (InterRAT) measurements, it is desirable that it also be possible to detect the cell group using only one SyS (i.e., S 1  or S 2  alone). 
         [0013]    Consequently, there is a need for an S-SyS sequence design that will satisfy both requirements. 
       SUMMARY 
       [0014]    It should be emphasized that the terms “comprises” and “comprising”, when used in this specification, are taken to specify the presence of stated features, integers, steps or components; but the use of these terms does not preclude the presence or addition of one or more other features, integers, steps, components or groups thereof. 
         [0015]    In accordance with one aspect of the present invention, the foregoing and other objects are achieved in a methods and apparatuses that indicate timing parameters and an identity of a particular cell group from a number, M, of possible cell groups in a signal transmitted in a cellular communication system that employs a radio frame in a physical layer, the radio frame comprising a number of time slots. Indicating these parameters involves transmitting, in a known one of the time slots of the radio frame, a synchronization signal, S 1 , that comprises a pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  arranged in a first ordering; and transmitting, in another known one of the time slots of the radio frame, a synchronization signal, S 2 , that comprises the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  arranged in a second ordering, wherein: 
         [0016]    each member of the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j , is selected from a group comprising at least 
         [0000]    
       
         
           
             
               N 
               Seq 
             
             = 
             
               ceil 
               ( 
               
                 
                   1 
                   + 
                   
                     
                       1 
                       + 
                       
                         8 
                          
                         M 
                       
                     
                   
                 
                 2 
               
               ) 
             
           
         
       
     
         [0000]    different sequences; and the selected pair of sequences is uniquely identified with the particular cell group, wherein i, jε[1, . . . , N Seq ] and {tilde over (S)} i ≠{tilde over (S)} j . 
         [0017]    The first ordering of the sequences is used only for transmission in the known one of the time slots of the radio frame, and the second ordering of the sequences is used only for transmission in said another known one of the time slots. Consequently, detection of the ordering of just one pair of sequences can be used by a receiver as a time slot identifier, which in turn allows radio frame timing to be determined. 
         [0018]    In some embodiments, the first ordering of the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  is effected by transmitting the sequence {tilde over (S)} i  before transmitting the sequence {tilde over (S)} j ; and the second ordering of the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  is effected by transmitting the sequence {tilde over (S)} j  before transmitting the sequence {tilde over (S)} i . In such cases, S 1  and S 2  can each be of length n, and each of the sequences {tilde over (S)} i ,{tilde over (S)} j  can be of length n/2. 
         [0019]    In alternative embodiments, in which the physical layer of the cellular communication system employs Orthogonal Frequency Division Multiplexing, the first ordering of the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  is effected by transmitting the sequence {tilde over (S)} i  on a first set of one or more sub-carriers, and transmitting the sequence {tilde over (S)} j  on a second set of one or more sub-carriers. Conversely, the second ordering of the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  is effected by transmitting the sequence {tilde over (S)} j  on the first set of one or more sub-carriers, and transmitting the sequence {tilde over (S)} i  on the second set of one or more sub-carriers. 
         [0020]    In yet other alternative embodiments, ordering of the pair of sequences can be effected by generating the synchronization signals S 1  and S 2  in accordance with: 
         [0000]        S   1   =α{tilde over (S)}   i   +β{tilde over (S)}   j ; and 
         [0000]        S   2   =β{tilde over (S)}   i   +α{tilde over (S)}   j , 
         [0000]    wherein: 
         [0021]    α is a first multiplicand; 
         [0022]    β is a second multiplicand, α≠β. 
         [0023]    Each of the multiplicands, α and β, can for example be a scalar value and correspond to an amount of signal amplitude. Alternatively, each of the multiplicands, α and β, can correspond to an amount of signal power. 
         [0024]    In some such embodiments, the synchronization signals S 1  and S 2  and the sequences {tilde over (S)} i  and {tilde over (S)} j  can all be of equal length. 
         [0025]    In some variants of such embodiments, transmitting the synchronization signal S 1  comprises transmitting α{tilde over (S)} i  and β{tilde over (S)} j  simultaneously; and transmitting the synchronization signal S 2  comprises transmitting β{tilde over (S)} i  and α{tilde over (S)} 1  simultaneously. 
         [0026]    Various aspects of the invention are also reflected on the receiver side of the communication system, in which methods and apparatuses are provided that detect timing parameters and an identity of a particular cell group from a number, M, of possible cell groups in a signal received in a cellular communication system that employs a radio frame in a physical layer, the radio frame comprising a number of time slots including two time slots associated with a synchronization channel. Such detection includes receiving, in one of the time slots associated with the synchronization channel, one of first and second synchronization signals, S 1  and S 2 , wherein the first synchronization signal S 1  comprises a pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  arranged in a first ordering and the second synchronization signal S 2  comprises the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  arranged in a second ordering. It is then determined which of a number of predefined sequences best matches the received sequence {tilde over (S)} i , which of the number of predefined sequences best matches the received sequence {tilde over (S)} j , and whether the pair of received sequences {tilde over (S)} i ,{tilde over (S)} j  were arranged in the first ordering or the second ordering, wherein the number of predefined sequences is selected from a group comprising at least 
         [0000]    
       
         
           
             
               N 
               Seq 
             
             = 
             
               ceil 
               ( 
               
                 
                   1 
                   + 
                   
                     
                       1 
                       + 
                       
                         8 
                          
                         M 
                       
                     
                   
                 
                 2 
               
               ) 
             
           
         
       
     
         [0000]    different sequences. 
         [0027]    The particular cell group is identified by performing a cell group identification process that includes determining with which cell group the pair of received sequences, {tilde over (S)} i ,{tilde over (S)} j , is uniquely associated. It is also determined in which one of the two time slots associated with the synchronization channel the one of first and second synchronization signals was received by using information that indicates whether the sequences {tilde over (S)} i ,{tilde over (S)} j  were received in the first ordering or the second ordering. 
         [0028]    In yet another aspect, identifying the particular cell group by determining with which cell group the pair of received sequences, {tilde over (S)} i ,{tilde over (S)} j , is uniquely associated comprises using the pair of received sequences {tilde over (S)} i ,{tilde over (S)} j  to locate an entry in a look-up table. 
         [0029]    In still another aspect, using information about whether the sequences {tilde over (S)} i ,{tilde over (S)} j  were arranged in the first ordering or the second ordering to determine in which one of the two time slots associated with the synchronization channel the received one of the first and second synchronization signals was received comprises using the pair of received sequences {tilde over (S)} i ,{tilde over (S)} j  to locate an entry in a look-up table. 
         [0030]    In another aspect, whether to rely on just one or both of the received synchronization signals can be made dependent on the type of cell search being performed. For example, such embodiments can include receiving, in an other one of the time slots associated with the synchronization channel, an other one of the first and second synchronization signals. It is then determined whether a type of cell search procedure to be performed is an inter-frequency cell search procedure, an inter-radio access technology cell search procedure, or an intra-cell search procedure. If the type of cell search procedure to be performed is none of these, then it is determined which of the number of predefined sequences best matches the received sequence {tilde over (S)} i  of the other one of the first and second synchronization signals, which of the number of predefined sequences best matches the received sequence {tilde over (S)} j  of the other one of the first and second synchronization signals, and whether the pair of received sequences {tilde over (S)} i ,{tilde over (S)} j  of the other one of the first and second synchronization signals were arranged in the first ordering or the second ordering. In such cases, the cell group identification process further includes determining with which cell group the pair of received sequences, {tilde over (S)} i ,{tilde over (S)} j , of the other one of the first and second synchronization signals is uniquely associated. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0031]    The objects and advantages of the invention will be understood by reading the following detailed description in conjunction with the drawings in which: 
           [0032]      FIG. 1  is an exemplary radio frame suitable for communications systems like the 3G LTE system. 
           [0033]      FIGS. 2(   a ) and  2 ( d ) illustrate a number of exemplary alternative ways of constructing the symbols S i  (1≦i≦2) from sequences {tilde over (S)} i ,{tilde over (S)} j  in accordance with an aspect of embodiments consistent with the invention. 
           [0034]      FIGS. 2(   b ) and  2 ( c ) show alternative arrangements in the frequency domain of sub-sequences that make up each of the SyS sequences S 1  and S 2  in accordance with an aspect of alternative embodiments consistent with the invention. 
           [0035]      FIG. 3  is a flow chart of exemplary processes/steps performed by circuitry in a UE for utilizing the inventive secondary synchronization symbols to determine cell group and frame timing in accordance with other embodiments consistent with the invention. 
       
    
    
     DETAILED DESCRIPTION 
       [0036]    The various features of the invention will now be described with reference to the figures, in which like parts are identified with the same reference characters. 
         [0037]    The various aspects of the invention will now be described in greater detail in connection with a number of exemplary embodiments. To facilitate an understanding of the invention, many aspects of the invention are described in terms of sequences of actions to be performed by elements of a computer system or other hardware capable of executing programmed instructions. It will be recognized that in each of the embodiments, the various actions could be performed by specialized circuits (e.g., discrete logic gates interconnected to perform a specialized function), by program instructions being executed by one or more processors, or by a combination of both. Moreover, the invention can additionally be considered to be embodied entirely within any form of computer readable carrier, such as solid-state memory, magnetic disk, or optical disk containing an appropriate set of computer instructions that would cause a processor to carry out the techniques described herein. Thus, the various aspects of the invention may be embodied in many different forms, and all such forms are contemplated to be within the scope of the invention. For each of the various aspects of the invention, any such form of embodiments may be referred to herein as “logic configured to” perform a described action, or alternatively as “logic that” performs a described action. 
         [0038]    An aspect of embodiments consistent with the invention is the provision of a minimum amount of S-SyS sequences needed to satisfy the requirement that the pair [S 1 , S 2 ] uniquely defines the cell group and frame timing, and at the same time also makes it possible to detect the cell group using only one S-SyS (i.e., only one member of the pair [S 1 , S 2 ]). 
         [0039]    Another aspect is the provision of methods and apparatuses that utilize the above-mentioned S-SyS sequences for cell group detection. 
         [0040]    To facilitate a better understanding of the various aspects of the invention, the following description assumes an exemplary stage  2  process in the LTE cell search procedure; that is, cell group detection. However, the invention is not limited to this exemplary embodiment, but rather is applicable to any comparable radio communications environment. 
         [0041]    Furthermore, the sequences described below can be defined and detected in both the time and frequency domains, and the exact sequences utilized (e.g., Hadamard, pn, Zadoff-Chu, M-sequences, etc.) are not limited by the invention. 
         [0042]    To begin the discussion, assume that Munique cell groups are needed and that each cell group is uniquely associated with a pair of sequences {tilde over (S)} i ,{tilde over (S)} j . Furthermore, taking 3G LTE as a non-limiting example, assume that the S-SyS symbols that are transmitted at two locations per frame  100  (e.g., in subframes  0  and  5 , the first transmission within the frame being labeled S 1  and the second transmission within the frame being labeled S 2 ) are each created as a function of these sequences. That is, S 1 =f 1 ({tilde over (S)} 1 ,{tilde over (S)} 2 ) and S 2 =f 2  ({tilde over (S)} 1 ,{tilde over (S)} 2 ). The detection of at least one of these sequences should also give information about where subframe  0  is placed. The lowest number of sequences that provides all of the above information can be determined as follows: Let N Seq  be the number of sequences needed to represent the M cell groups. The number of possible combinations of these sequences, taken two at a time, is given by the expression N Seq ·(N Seq −1)−2. The minimum value of N Seq  that will allow M cell groups to be represented can then be found in accordance with: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         N 
                         Seq 
                       
                       · 
                       
                         ( 
                         
                           
                             N 
                             Seq 
                           
                           - 
                           1 
                         
                         ) 
                       
                     
                     2 
                   
                   = 
                   M 
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
         [0000]    This leads to the following quadratic equation: 
         [0000]        N   Seq   2   −N   Seq −2 M= 0  (2)
 
         [0000]    Applying the well-known quadratic formula for finding the roots of a quadratic equation, one finds that the positive value of N Seq  that satisfies the above requirements is given by: 
         [0000]    
       
         
           
             
               
                 
                   
                     N 
                     Seq 
                   
                   = 
                   
                     
                       1 
                       + 
                       
                         
                           1 
                           + 
                           
                             8 
                              
                             M 
                           
                         
                       
                     
                     2 
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
     
         [0000]    In practice, N Seq  cannot be permitted to be a non-integer number, so the minimum acceptable integer value of N Seq  is given by 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       N 
                       Seq 
                     
                     = 
                     
                       ceil 
                       ( 
                       
                         
                           1 
                           + 
                           
                             
                               1 
                               + 
                               
                                 8 
                                  
                                 M 
                               
                             
                           
                         
                         2 
                       
                       ) 
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where ceil( ) is a function that rounds its argument up to the nearest integer. 
         [0043]    Using the above in a simple example, suppose it is desired to represent M=340 different cell groups with unique combinations (pairings) of sequence values. The minimum number of sequences required in this instance is: 
         [0000]    
       
         
           
             
               
                 
                   
                     N 
                     Seq 
                   
                   = 
                   
                     
                       ceil 
                       ( 
                       
                         
                           1 
                           + 
                           
                             
                               1 
                               + 
                               
                                 8 
                                 · 
                                 340 
                               
                             
                           
                         
                         2 
                       
                       ) 
                     
                     = 
                     
                       
                         ceil 
                         ( 
                         
                           
                             1 
                             + 
                             
                               
                                 1 
                                 + 
                                 2720 
                               
                             
                           
                           2 
                         
                         ) 
                       
                       = 
                       27. 
                     
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
           
         
       
     
         [0044]    A reason why it is desirable to minimize the number of sequences needed is to reduce the complexity of the processing required in the UE for detecting the cell group.  FIGS. 2(   a ) and  2 ( d ) illustrate a number of exemplary alternative ways of constructing the symbols S i  (1≦i≦2) from {tilde over (S)} i ,{tilde over (S)} j . 
         [0045]    With reference to  FIG. 2(   a ), a first exemplary embodiment involves transmitting, as the symbol S i  associated with the particular cell group, the corresponding pair of sequences {tilde over (S)} i ,{tilde over (S)} j  (i≠j), with the order of the pair (in either the time or frequency domains) indicating whether the transmitted symbol is S 1  or S 2 . The length of each of {tilde over (S)} i  and {tilde over (S)} j  is, in this example, half the length of S i . (In theory, {tilde over (S)} i  and {tilde over (S)} j  need not be of equal length, but in practice they are chosen to be so.) For example, a time domain embodiment would include transmitting as the secondary synchronization signals S 1 ={tilde over (S)} i ,{tilde over (S)} j  (i.e., first transmitting {tilde over (S)} i  and then transmitting {tilde over (S)} j ) and S 2 ={tilde over (S)} j ,{tilde over (S)} i  (i.e., first transmitting {tilde over (S)} j  and then transmitting {tilde over (S)} i ) in each radio frame. 
         [0046]    Alternatively, frequency domain embodiments applying the principle illustrated in  FIG. 2(   a ) transmit the sequences {tilde over (S)} i  and {tilde over (S)} j  simultaneously, with for example, transmission of the symbol S 1  being performed by transmitting the sequence {tilde over (S)} i  in a lower set of frequencies and the sequence {tilde over (S)} j  being transmitted in a higher set of frequencies. Transmission of the symbol S 2  is the opposite, with the sequence {tilde over (S)} j  being transmitted in the lower set of frequencies and the sequence {tilde over (S)} i  being transmitted in the higher set of frequencies. This arrangement is illustrated in  FIG. 2(   b ). 
         [0047]    In other frequency domain embodiments applying the principle illustrated in  FIG. 2(   a ) the sequences {tilde over (S)} i  and {tilde over (S)} j  are transmitted simultaneously by means of interleaving. For example, given two sets of frequencies that are interleaved with one another, transmission of the symbol S 1  can be performed by transmitting the sequence {tilde over (S)} i  in a “lower” one of the sets of interleaved frequencies and transmitting the sequence {tilde over (S)} j  in a “higher” one of the sets of frequencies. (Here, the words “higher” and “lower” do not refer to the sets of frequencies as a single contiguous group, but rather to pairs of resource elements associated with the interleaved frequencies, so that one resource element associated with {tilde over (S)} i  is on a lower frequency than the neighboring resource element associated with {tilde over (S)} j .) Transmission of the symbol S 2  is the opposite, with the sequence {tilde over (S)} j  being transmitted in a lower one of the sets of frequencies and the sequence {tilde over (S)} i  being transmitted a higher one of the sets of frequencies. This arrangement is illustrated in  FIG. 2(   c ). 
         [0048]    In either case (i.e., time domain embodiment or frequency domain embodiment), the detector (UE) preferably includes a look-up table that associates each sequence pair and ordering with a cell group identifier and frame timing information (i.e., whether the ordering of the sequence pair indicates sub-frame  0  or sub-frame  5 ), so that the detector can easily identify the cell group and frame timing. 
         [0049]    With reference to  FIG. 2(   d ), another exemplary alternative embodiment involves generating each symbol S i  as a weighted sum of the sequence pair {tilde over (S)} i ,{tilde over (S)} j  (i≠j), with each particular pairing being uniquely associated with one of the M cell groups. Furthermore, the amount of weighting applied to each of the sequences indicates whether the sequence pair is being transmitted in sub-frame  0  (S 1 ) or in sub-frame  5  (S 2 ). That is, the secondary synchronization symbols for each radio frame can be represented as follows: 
         [0000]        S   1   =α{tilde over (S)}   i   +β{tilde over (S)}   j  (for sub-frame 0) 
         [0000]        S   2   =β{tilde over (S)}   i   +α{tilde over (S)}   j  (for sub-frame 5)  (6)
 
         [0050]    In such embodiments, the length of each sequence {tilde over (S)} i ,{tilde over (S)} j  can be the same as the length of the symbol S i , and both sequences are transmitted at the same time. The different weightings (α and β, with α≠β) that indicate in which sub-frame the symbol is being transmitted can be achieved by transmitting the sequences at different amplitudes and/or powers relative to one another. 
         [0051]    In this embodiment, the detector (UE) preferably includes a look-up table that associates each sequence pair and relative weighting of the sequences (e.g., as indicated by signal amplitude and/or power) with a cell group identifier and frame timing information (i.e., whether the applied multiplicands α and β indicate sub-frame  0  or sub-frame  5 ), so that the detector can easily identify the cell group and frame timing. In alternative embodiments, a logic circuit associates each sequence pair and relative weighting of the sequences with a cell group identifier and frame timing information, so that the detector can easily identify the cell group and frame timing. 
         [0052]    One possibility for constructing the multiplicands α and β is to interpret them as diagonal matrices, that is: 
         [0000]    
       
         
           
             
               
                 
                   α 
                   = 
                   
                     [ 
                     
                       
                         
                           
                             α 
                             1 
                           
                         
                         
                           
                               
                           
                         
                         
                           
                               
                           
                         
                         
                           
                               
                           
                         
                       
                       
                         
                           
                               
                           
                         
                         
                           
                             α 
                             2 
                           
                         
                         
                           
                               
                           
                         
                         
                           
                               
                           
                         
                       
                       
                         
                           
                               
                           
                         
                         
                           
                               
                           
                         
                         
                           ⋱ 
                         
                         
                           
                               
                           
                         
                       
                       
                         
                           
                               
                           
                         
                         
                           
                               
                           
                         
                         
                           
                               
                           
                         
                         
                           
                             α 
                             N 
                           
                         
                       
                     
                     ] 
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Hence, S 1 =α{tilde over (S)} j +β{tilde over (S)} j  can be interpreted as element-wise multiplication, that is: 
         [0000]        S   1,k =α k   {tilde over (S)}   i,k +β k   {tilde over (S)}   j,k ,  (8)
 
         [0000]    wherein k is the kth element of the vector. 
         [0053]    An alternative way to construct the multiplicands α and β is to allow β to be a function of the sequence in front of α in the formula for S 1 , that is: 
         [0000]        S   1   =α{tilde over (S)}   i +β( {tilde over (S)}   i ) {tilde over (S)}   j  (for sub-frame 0)
 
         [0000]        S   2 =β( {tilde over (S)}   j ) {tilde over (S)}   i   +α{tilde over (S)}   j  (for sub-frame 5).  (9)
 
         [0000]    In this embodiment, the UE should first correlate to the sequence {tilde over (S)} i  and detect that one. Then, based on the detected S i  sequence, the UE looks in, for example, a look-up table to determine the β sequence, and then correlates and detects the {tilde over (S)} j  sequence. 
         [0054]    Yet another alternative is similar to the one just described, but instead allows α to be a function of the sequence in front of β. 
         [0055]    It will be appreciated that various embodiments can be implemented in OFDM as well as non-OFDM environments. In an OFDM system, for example, a first ordering of the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  can be effected by transmitting the sequence {tilde over (S)} i  on a first set of one or more sub-carriers, and transmitting the sequence {tilde over (S)} j  on a second set of one or more sub-carriers. A second ordering of the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  can be effected by transmitting the sequence {tilde over (S)} j  on the first set of one or more sub-carriers, and transmitting the sequence {tilde over (S)} i  on the second set of one or more sub-carriers. 
         [0056]    In a non-OFDM environment, the physical layer of the cellular communication system can still involve the symbols of the synchronization signal, S 1 , being separated in a frequency domain. In such embodiments, the first ordering of the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  can be effected by transmitting the sequence {tilde over (S)} i  on a first set of frequencies, and transmitting the sequence {tilde over (S)} j  on a second set of frequencies. The second ordering of the pair of sequences, {tilde over (S)} i ,{tilde over (S)} j  can be effected by transmitting the sequence {tilde over (S)} j  on the first set of frequencies, and transmitting the sequence {tilde over (S)} i  on the second set of frequencies. 
         [0057]      FIG. 3  is a flow chart of exemplary processes/steps performed by circuitry in a UE (e.g., a detector) for utilizing the above-described secondary synchronization symbols to determine cell group and frame timing in accordance with embodiments consistent with the invention. The various blocks shown in  FIG. 3  can also be considered to represent the UE&#39;s logic configured to perform the indicated function. 
         [0058]    The UE begins by performing stage  1  processing, which includes beginning the cell search and detecting a newly found cell&#39;s slot timing (e.g., 5 ms timing) and cell ID within an unknown cell group using the P-SyS signals received on the P-SCH (step  301 ). Techniques for performing this step are well-known, and beyond the scope of the invention. 
         [0059]    The UE is now ready to perform stage  2  processing. However, in accordance with an aspect of embodiments consistent with the invention, the type of cell search being performed will determine whether both S 1  and S 2  are used, or whether just one of these is used. More particularly, there are a number of different types of cell searches (e.g., initial cell search, neighbor cell search, inter-frequency cell search, and inter-radio access technology cell search), and each performs stage  2  processing to detect frame timing and to identify a cell&#39;s cell group. The cell search procedures are essentially the same for the different types, but there are some differences. For example, for an intra-frequency cell search the UE can perform cell searching simultaneously with data reception from the serving cell. However, for inter-frequency or inter-radio access technology cell searches (e.g., camping on a GSM system and performing cell search on an LTE system carrier) the UE must interrupt its data reception from the serving cell when changing carrier frequencies for the cell search. In order to reduce the interruption length (i.e., interruption in data reception), one wants to be able to detect all cell information in one synchronization frame. This eliminates the possibility of accumulating cell search information over a number of synchronization frames and therefore results in inter-frequency and inter-radio access technology cell searches having worse performance than intra-frequency cell searches. To accommodate this, networks are typically planned to tolerate slower cell searching for the inter-frequency and inter-radio access technology cell searching than for intra-frequency cell searching. 
         [0060]    As to initial cell search procedures, the frequency error can be large. This creates a need to perform a frequency error correction step, typically between stages  1  and  2 . Initial cell search performance is typically not as good as that of neighbor cell searching, but initial cell search is performed only when the UE is turned on, so it does not seriously affect the UE&#39;s overall performance. 
         [0061]    Returning now to a discussion of  FIG. 3 , if it is determined that the type of cell search being performed is an inter-frequency (“IF”), inter-cell (“IC”) or inter-radio access technology (IRAT) cell search (“YES” path out of decision block  303 ), stage  2  processing is invoked that uses only one S-SyS (either S 1  or S 2 ) per radio frame to detect cell group and frame timing (step  305 ). The sequence pair {tilde over (S)} i ,{tilde over (S)} j  maximizing the correlation power is chosen as an indicator of the detected cell group. Depending on which embodiment is implemented, the specific order of the sequences or alternatively the power relation order of {tilde over (S)} i ,{tilde over (S)} j  determines the frame timing (e.g., the 10 ms timing in an LTE system). 
         [0062]    However, if it is determined that the type of cell search being performed is not an inter-frequency, inter-cell, or inter-radio access technology cell search (“NO” path out of decision block  303 ), this means that the UE is performing a cell search that requires a more accurate determination of frame timing and cell group, such as an initial cell search or a neighbor cell search. Consequently, stage  2  processing is invoked that uses both S-SySs (i.e., both S 1  and S 2 ) per radio frame to detect cell group and frame timing (step  307 ). 
         [0063]    The results obtained from stage  2  processing (either step  305  or step  307 ) are then used in the usual way to facilitate stage  3  processing. In some embodiments, this can include verifying the cell ID obtained from earlier processing by using reference symbols associated with the identified cell group (step  309 ). That is, the reference symbols used for cell ID detection are descrambled using the scrambling code determined by the cell group and cell ID. 
         [0064]    To complete the example,  FIG. 3  also shows that stage  4  processing (i.e., reading the BCH to obtain cell-specific system information) is also performed. However, neither stage  3  nor stage  4  processing are an essential aspect of the invention, and are therefore not described here in great detail. 
         [0065]    The invention has been described with reference to particular embodiments. However, it will be readily apparent to those skilled in the art that it is possible to embody the invention in specific forms other than those of the embodiment described above. The described embodiments are merely illustrative and should not be considered restrictive in any way. The scope of the invention is given by the appended claims, rather than the preceding description, and all variations and equivalents which fall within the range of the claims are intended to be embraced therein.