Abstract:
A method of wireless communication including a plurality of fixed base stations and a plurality of mobile user equipment with each base station transmitting to any user equipment within a corresponding cell a sounding reference signal sub-frame configuration indicating sub-frames when sounding is permitted. Each user equipment recognizes the sounding reference signal sub-frame configuration and sounds only at permitted sub-frames. Differing cells may have differing sounding reference signal sub-frame configurations. There are numerous manners to encode the transmitted information.

Description:
CLAIM OF PRIORITY 
     This application claims priority under 35 U.S.C. 119(e) (1) to U.S. Provisional Application No. 61/048,738 filed Apr. 29, 2008, U.S. Provisional Application No. 61/051,453 filed May 8, 2008 and U.S. Provisional Application No. 61/051,482 filed May 8, 2008. 
    
    
     TECHNICAL FIELD OF THE INVENTION 
     The technical field of this invention is wireless communication. 
     BACKGROUND OF THE INVENTION 
       FIG. 1  shows an exemplary wireless telecommunications network  100 . The illustrative telecommunications network includes base stations  101 ,  102  and  103 , though in operation, a telecommunications network necessarily includes many more base stations. Each of base stations  101 ,  102  and  103  are operable over corresponding coverage areas  104 ,  105  and  106 . Each base station&#39;s coverage area is further divided into cells. In the illustrated network, each base station&#39;s coverage area is divided into three cells. Handset or other user equipment (UE)  109  is shown in Cell A  108 . Cell A  108  is within coverage area  104  of base station  101 . Base station  101  transmits to and receives transmissions from UE  109 . As UE  109  moves out of Cell A  108  and into Cell B  107 , UE  109  may be handed over to base station  102 . Because UE  109  is synchronized with base station  101 , UE  109  can employ non-synchronized random access to initiate handover to base station  102 . 
     Non-synchronized UE  109  also employs non-synchronous random access to request allocation of up-link  111  time or frequency or code resources. If UE  109  has data ready for transmission, which may be traffic data, measurements report, tracking area update, UE  109  can transmit a random access signal on up-link  111 . The random access signal notifies base station  101  that UE  109  requires up-link resources to transmit the UE&#39;s data. Base station  101  responds by transmitting to UE  109  via down-link  110 , a message containing the parameters of the resources allocated for UE  109  up-link transmission along with a possible timing error correction. After receiving the resource allocation and a possible timing advance message transmitted on down-link  110  by base station  101 , UE  109  optionally adjusts its transmit timing and transmits the data on up-link  111  employing the allotted resources during the prescribed time interval. 
       FIG. 2  shows the Evolved Universal Terrestrial Radio Access (E-UTRA) time division duplex (TDD) Frame Structure. Different sub-frames are allocated for downlink (DL) or uplink (UL) transmissions. Table 1 shows applicable DL/UL sub-frame allocations. 
     
       
         
               
               
               
             
               
               
               
               
               
               
               
               
               
               
               
               
             
           
               
                 TABLE 1 
               
             
             
               
                   
               
               
                 Con- 
                 Switch-point 
                 Sub-frame number 
               
             
          
           
               
                 figuration 
                 periodicity 
                 0 
                 1 
                 2 
                 3 
                 4 
                 5 
                 6 
                 7 
                 8 
                 9 
               
               
                   
               
               
                 0 
                  5 ms 
                 D 
                 S 
                 U 
                 U 
                 U 
                 D 
                 S 
                 U 
                 U 
                 U 
               
               
                 1 
                  5 ms 
                 D 
                 S 
                 U 
                 U 
                 D 
                 D 
                 S 
                 U 
                 U 
                 D 
               
               
                 2 
                  5 ms 
                 D 
                 S 
                 U 
                 D 
                 D 
                 D 
                 S 
                 U 
                 D 
                 D 
               
               
                 3 
                 10 ms 
                 D 
                 S 
                 U 
                 U 
                 U 
                 D 
                 D 
                 D 
                 D 
                 D 
               
               
                 4 
                 10 ms 
                 D 
                 S 
                 U 
                 U 
                 D 
                 D 
                 D 
                 D 
                 D 
                 D 
               
               
                 5 
                 10 ms 
                 D 
                 S 
                 U 
                 D 
                 D 
                 D 
                 D 
                 D 
                 D 
                 D 
               
               
                 6 
                 10 ms 
                 D 
                 S 
                 U 
                 U 
                 U 
                 D 
                 S 
                 U 
                 U 
                 D 
               
               
                   
               
             
          
         
       
     
     Sounding RS enables time and frequency domain scheduling and has been adopted as a RAN1 working assumption for EUTRA. The channel quality indicator (CQI) estimate obtained from sounding can be expired or stale because of the inevitable time delay between channel sounding and the follow-up scheduled transmission. This is more pronounced for faster user equipment (UE). Thus faster UE needs to have more frequent sounding in order to maintain the fresh CQI at the NodeB. For example a UE with a Doppler of 200 Hz requires a propagation channel for every fifth sub-frame because the sub-frame rate is 1000 Hz. In such case for channel adaptive modulation and coding (AMC) to be performed, the UE must sound nearly every sub-frame or every other sub-frame. The objective of maintaining a fresh CQI at the NodeB may be impossible for very fast UEs having a Doppler of 200 Hz or more because the channel can change substantially between sub-frames. For such fast UEs, a slow rate of infrequent sounding can be performed. Slower UEs naturally ought to sound less frequently. As the UE speed increases, the sounding period should reduce up to a point. Very fast UEs should abandon the goal of maintaining a fresh CQI and sound less frequently. 
     A simple solution is to configure each cell with a common sounding period for each UE and for each sounding resource. However, any cell may contain UEs with a spread of velocities yielding a spread of Dopplers. Allocating sounding resources to UEs corresponding to the set of UEs velocities would be efficient. This allocation enables efficient utilization of sounding resources. In another proposed allocation, very slow UEs sound only once per several sub-frames and intermediate speed UEs sound once per few sub-frames. This allocation is not straight forward and not always possible. It is mathematically impossible to share a common sounding resource between one UE sounding every 2 sub-frames and a second UE sounding every 3 sub-frames. There is a need in the art to use different sounding periods different cells while tailoring each sounding period to the velocity of a UE or subset of UEs. 
     SUMMARY OF THE INVENTION 
     A method of wireless communication including a plurality of fixed base stations and a plurality of mobile user equipment with each base station transmitting to any user equipment within a corresponding cell a sounding reference signal sub-frame configuration indicating sub-frames when sounding is permitted. Each user equipment recognizes the sounding reference signal sub-frame configuration and sounds only at permitted sub-frames. Differing cells may have differing sounding reference signal sub-frame configurations. There are numerous manners to encode the transmitted information. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       These and other aspects of this invention are illustrated in the drawings, in which: 
         FIG. 1  is a diagram of a communication system of the prior art related to this invention having three cells; 
         FIG. 2  shows the Evolved Universal Terrestrial Radio Access (E-UTRA) TDD Frame Structure of the prior art; 
         FIG. 3  shows an alternative manner of determining the sounding frequency in sub-frames and the sub-frame offset. 
     
    
    
     DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS 
     Sounding involves exchange of signals between the base station and the connected user equipment. Each sounding uses a reference resource identifier selected from an available reference resource identifier map h(t, L) and a portion of the spectrum selected from an available spectrum identifier map f(t, N); where L is a group of shared parameters signaled to each UE from the group; and N is a group of shared parameters signaled to each UE from the group. Some examples utilize Constant Amplitude Zero Auto-correlation (CAZAC) sequences as the reference sequences. CAZAC sequences are complex-valued sequences with: constant amplitude (CA); and zero cyclic autocorrelation (ZAC). Examples of CAZAC sequences include: Chu sequences, Frank-Zadoff sequences, Zadoff-Chu (ZC) sequences and generalized chirp-like (GCL) sequences. CAZAC (ZC or otherwise) sequences are presently preferred. 
     Zadoff-Chu (ZC) sequences, as defined by: 
     
       
         
           
             
               
                 
                   a 
                   m 
                 
                 ⁡ 
                 
                   ( 
                   k 
                   ) 
                 
               
               = 
               
                 
                   ⅇ 
                   
                     [ 
                     
                       j 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       2 
                       ⁢ 
                       
                         
                           π 
                           ⁡ 
                           
                             ( 
                             
                               m 
                               / 
                               N 
                             
                             ) 
                           
                         
                         ⁡ 
                         
                           [ 
                           
                             
                               
                                 k 
                                 ⁡ 
                                 
                                   ( 
                                   
                                     k 
                                     + 
                                     1 
                                   
                                   ) 
                                 
                               
                               2 
                             
                             + 
                             qk 
                           
                           ] 
                         
                       
                     
                     ] 
                   
                 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 for 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 N 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 odd 
               
             
             , 
             
               
 
             
             ⁢ 
             
               
                 
                   a 
                   m 
                 
                 ⁡ 
                 
                   ( 
                   k 
                   ) 
                 
               
               = 
               
                 
                   ⅇ 
                   
                     [ 
                     
                       j 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       2 
                       ⁢ 
                       
                         
                           π 
                           ⁡ 
                           
                             ( 
                             
                               m 
                               / 
                               N 
                             
                             ) 
                           
                         
                         ⁡ 
                         
                           [ 
                           
                             
                               
                                 k 
                                 2 
                               
                               2 
                             
                             + 
                             qk 
                           
                           ] 
                         
                       
                     
                     ] 
                   
                 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 for 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 N 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 
                   even 
                   . 
                 
               
             
           
         
       
     
     An alternative convention of the ZC definition replaces j (the complex number √{square root over (−1)}) in these formulas with −j. In the formula: m is the index of the root ZC sequence; N is the length of the sequence, with m and N are relatively prime; q is any fixed integer, for example, q=0 is a good choice because it simplifies computation as qk=0); and k is the index of the sequence element from {0, 1, . . . N−1}. Making N a prime number maximizes the set of root ZC sequences having optimal cross-correlation. When N is prime, there are N−1 possible choices for m and each choice results in a distinct root ZC CAZAC sequence. The terms Zadoff-Chu, ZC, and ZC CAZAC are commonly used interchangeably. 
     The problem of allocating sounding resources is to cover each UE with sounding fast enough to meet their requirements. The maximum sounding period is generally related the UE Doppler, a measure of how fast the UE is moving relative to the base station. We assume that the sounding requirements of the set of UEs are fixed at any point in time but may vary slowly with time. This slow time change enables computing and using repeating patterns for the sounding resource allocation. 
     The sounding reference signal (SRS) sub-frame configuration is broadcast by base station  101  in system information blocks (SIB). This sub-frame configuration indicates which sub-frames are SRS sub-frames. Broadcast of the SRS sub-frame configuration is useful even for UEs  109  which do not transmit any SRS. SRS shouldn&#39;t collide with physical uplink shared channel (PUSCH) transmission. Thus non-SRS UEs  109  can extract some of their silent symbol periods from the SRS sub-frame configuration. These silent periods are useful for performing some measurements at UE  109 . In general each cell  107  and  108  would employ a different SRS sub-frame configuration. Ideally, base stations  101 ,  102  and  103  would select SRS sub-frame configurations to minimize cross-cell interference. 
     There are two main ways of signaling and interpreting the SRS sub-frame configuration parameters. Sub-frame configuration can be defined by two parameters: the sub-frame period T SFC ; and the offset Δ SFC . Both UEs  109  and base station  101  keep a sub-frame counter C SFC  permitting UE  109  and base station  101  to determine which sub-frames are configured for SRS transmission. A sub-frame is an SRS sub-frame if and only if Δ SFC =(C SFC )mod T SFC . The exact range of values of ΔSFC and T SFC  need to be defined with the number of bits and encoding for each. For example, T SFC  could be selected from the set {1, 2, 3, 4, 5, . . . , 32} allowing flexible system deployment Δ SFC  could be selected from the same set. This yields maximum flexibility, but requires 10 bits of broadcast SIB signaling, which can be very costly. A reduced overhead alternative encodes and signals T SFC  first. This requires greatest integer in log 2 (T SFC ) (ceil[ log 2 (T SFC )]) bits. The bits required for Δ SFC  would be either the ceil[ log 2 (T SFC )] or the least integer in log 2 (T SFC ) (floor [ log 2 (T SFC )]) because 0≦Δ SFC &lt;T SFC . This reduces the number of required bits for signaling Δ SFC , but only for certain scenarios where T SFC  is small. Another reduced overhead alternative hard codes a value for Δ SFC  such as zero. In that case, only T SFC  is signaled. 
     Configuration of the sounding reference signal (SRS) contains cell specific components and UE specific components. Cell specific components of the SRS configuration indicate particular subframes when the SRS transmission occurs. Cell specific components of the SRS configuration may include T SFC  the SRS sub-frame period and Δ SFC  SRS sub-frame offset. The UE keeps a sub-frame counter C SFC . 
     SRS sub-frames are those for which the counter C SFC  satisfies the condition Δ SFC =(C SFC )mod T SFC . These quantities T SFC  and Δ SFC  must be signaled to the UEs. This is generally preformed by through SIB signaling. This invention includes a specific bit-map table for this signaling. This invention supports a very wide range of T SFC  and the Δ SFC  values with 5-bit signaling. This invention supports values for T SFC  in the set of {1, 2, 5, 10, 20, 40, Inf} ms. This invention also includes a proposed bit-map tables allowing a wide range of Δ SFC . 
     Table 2 shows the 5 bits signaled via SIB designating T SFC  and Δ SFC  in time division duplex (TDD) applications according to one embodiment of this invention. For Δ SFC  of values 1 or 6 (i.e. Uplink Pilot Transmit Slot (UpPTS)), either one or both Single Carrier-Orthogonal Frequency Domain Multiplexing (SC-OFDM) symbols in UpPTS are used for SRS. The number of SC-OFDM symbols in UpPTS is broadcasted by another field in SIB. In other words, if UpPTS consists of 2 SC-OFDM symbols and is configured for SRS transmission, then both SC-OFDM symbols are used for SRS transmission. In TDD, sounding employs UpPTS resources except occupied by short Random Access Channel (RACH) are default for SRS. SRS is transmitted only in configured UL subframes or UpPTS. 
                                                               TABLE 2                       Decimal   Binary   T SFC     Δ SFC                                          0   00000   1   0           1   00001   5   1           2   00010   5   2           3   00011   5   3           4   00100   5   4           5   00101   10   1           6   00110   10   2           7   00111   10   3           8   01000   10   4           9   01001   10   6           10   01010   10   7           11   01011   10   8           12   01100   10   9           13   01101   20   1           14   01110   20   2           15   01111   20   3           16   10000   20   4           17   10001   20   6           18   10010   20   7           19   10011   20   8           20   10100   20   9           21   10101   40   1           22   10110   40   2           23   10111   40   3           24   11000   40   4           25   11001   40   6           26   11010   40   7           27   11011   40   8           28   11100   40   9           29   11101   Reserved   Reserved           30   11110   Reserved   Reserved           31   11111   Inf.   0                        
For the signaled number decimal 31 and binary 11111 Inf. indicates infinity. This means that there are no soundings thus the interval between soundings is infinite. In this case the offset Δ SFC  is 0. For the signaled number decimal 29, binary 11101 and for the signaled number decimal 30, binary 11110 the code are reserved.
 
       FIG. 3  illustrates an alternative formulation of this SRS selection. The set of possible SRS possible periods T SFC  is defined in an ordered list T SFC [1] to T SFC [k]m where T SFC [1]&lt;T SFC [2]&lt; . . . &lt;T SFC [k]. In  FIG. 3  this is set  310  {1, 5, 10, 20, 40, Inf.} ms, where k=6. A set of switch-point numbers N[1] to N[k+1] are formed in an ordered list where N[1]&lt;N[2]&lt; . . . &lt;N[k]&lt;N[k+1]. In  FIG. 3  these switch-point numbers are set  320  {0, 1, 5, 13, 21, 29, Inf.}. The base station signals via SIB a configuration index N. The UE may then finds the unique index k for which N[k]≦N&lt;N[k+1]. The sub-frame period is then T SFC =T SFC [k]. The offset Δ SFC  is calculated using formula  330 :
 
Δ SFC =0 if N=0 or N=31,
 
Δ SFC   =N−N[k]+ 1 if  N−N[k]+ 1≦4, and
 
Δ SFC   =N−N[k]+ 2 otherwise.
 
 FIG. 3  illustrates this process for N=15. If N=15 is broadcast in SIB, the UE determines that 15 is greater than or equal to N[4] which is 13 and less than N[5] which is 21. This designates an index k of 4. UE then selects T SFC =T SFC [4]=20 ms. For the offset Δ SFC , the UE notes that N−N[k]+1=15−13+1=3 is less than or equal to 4. Thus Δ SFC  is 3.
 
     Table 3 shows the 4 bits signaled via SIB designating T SFC  and Δ SFC  in time division duplex (TDD) applications according to yet another embodiment of this invention. 
     
       
         
               
               
               
               
             
               
               
               
               
             
           
               
                 TABLE 3 
               
               
                   
               
               
                 Decimal 
                 Binary 
                 T SFC   
                 Δ SFC   
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                 0 
                 0000 
                 5 
                 {1} 
               
               
                 1 
                 0001 
                 5 
                 {1, 2} 
               
               
                 2 
                 0010 
                 5 
                 {1, 3} 
               
               
                 3 
                 0011 
                 5 
                 {1, 4} 
               
               
                 4 
                 0100 
                 5 
                 {1, 2, 3} 
               
               
                 5 
                 0101 
                 5 
                 {1, 2, 4} 
               
               
                 6 
                 0110 
                 5 
                 {1, 3, 4} 
               
               
                 7 
                 0111 
                 5 
                 {1, 2, 3, 4} 
               
               
                 8 
                 1000 
                 10 
                 {1, 2, 6} 
               
               
                 9 
                 1001 
                 10 
                 {1, 3, 6} 
               
               
                 10 
                 1010 
                 10 
                 {1, 6, 7} 
               
               
                 11 
                 1011 
                 20 
                 {1, 2, 6, 11, 16} 
               
               
                 12 
                 1100 
                 20 
                 {1, 3, 6, 11, 16} 
               
               
                 13 
                 1101 
                 20 
                 {1, 6, 7, 11, 16} 
               
               
                 14 
                 1110 
                 Inf. 
                 NA 
               
               
                 15 
                 1111 
                 reserved 
                 reserved 
               
               
                   
               
             
          
         
       
     
     In Table 3 T SFC  is selected from the set including {5, 10, 20, Inf.}. There may be plural offsets Δ SFC  for each value of T SFC . For the signaled number decimal 12 and binary 1110 Inf. indicates infinity. This means that there are no soundings thus the interval between soundings is infinite. In this case the offset Δ SFC  is not applicable (NA). For signaled number decimal 15 and binary 1111 the code is reserved. For TDD, sounding reference signal is transmitted only in configured UL sub-frames or UpPTS. 
     Table 4 shows the 4 bits signaled via SIB designating T SFC  and Δ SFC  in time division duplex (TDD) applications according to still another embodiment of this invention. 
     
       
         
               
               
               
               
             
               
               
               
               
             
           
               
                 TABLE 4 
               
               
                   
               
               
                 Decimal 
                 Binary 
                 T SFC   
                 Δ SFC   
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                 0 
                 0000 
                 5 
                 {1} 
               
               
                 1 
                 0001 
                 5 
                 {1, 2} 
               
               
                 2 
                 0010 
                 5 
                 {1, 3} 
               
               
                 3 
                 0011 
                 5 
                 {1, 4} 
               
               
                 4 
                 0100 
                 5 
                 {1, 2, 3} 
               
               
                 5 
                 0101 
                 5 
                 {1, 2, 4} 
               
               
                 6 
                 0110 
                 5 
                 {1, 3, 4} 
               
               
                 7 
                 0111 
                 5 
                 {1, 2, 3, 4} 
               
               
                 8 
                 1000 
                 10 
                 {1, 2, 6} 
               
               
                 9 
                 1001 
                 10 
                 {1, 3, 6} 
               
               
                 10 
                 1010 
                 10 
                 {1, 6, 7} 
               
               
                 11 
                 1011 
                 10 
                 {1, 2, 6, 7} 
               
               
                 12 
                 1100 
                 10 
                 {1, 3, 6, 8} 
               
               
                 13 
                 1101 
                 10 
                 {1, 4, 6, 9} 
               
               
                 14 
                 1110 
                 Inf 
                 NA 
               
               
                 15 
                 1111 
                 reserved 
                 reserved 
               
               
                   
               
             
          
         
       
     
     In Table 4 T SFC  is selected from the set including {10, 20, Inf.}. There may be plural offsets Δ SFC  for each value of T SFC . For the signaled number decimal 14 and binary 1110 Inf. indicates infinity. This means that there are no soundings thus the interval between soundings is infinite. In this case the offset Δ SFC  is not applicable (NA). For signaled number decimal 15 and binary 1111 the code is reserved. 
     This invention describes a manner to encode the SRS sub-frame configuration. This could either be table based or described in text as described above.