Abstract:
In a blind spreading factor detecting receiver, the amplitude of a desired signal term is decoupled from the spreading factor hypothesis for that signal. Furthermore, the amplitude of the desired signal and the variance of an associated impairment term are estimated, and the estimates used to form a spreading factor hypothesis. Additionally, in one or more embodiments, a suboptimal detector does not rely on estimates of the amplitude of the desired signal or variance of the impairment term. Rather, the detector relies on scaled values that are partially despread using an initial spreading factor not greater than the smallest possible spreading factor used by the signal of interest, and combined using combining weights from a Rake or G-Rake processor, wherein the scaling factor is chosen to yield a unity ratio between the signal amplitude and noise variance after scaling.

Description:
TECHNICAL FIELD 
     The present invention relates generally to wireless communication and in particular to blind spreading factor detection in Wideband Code Division Multiple Access (WCDMA) transmissions. 
     BACKGROUND 
     Wideband Code Division Multiple Access (WCDMA) is a widely deployed wireless communication network access protocol. Among other applications, WCDMA is the primary air interface for the 3G Universal Mobile Telecommunications System (UMTS) technology. 
     Interference Cancellation is a technology being considered for uplink WCDMA to improve the performance in mixed data and voice scenarios. In interference cancellation, a high-data-rate signal is detected first. After detection, the high-data-rate signal is cancelled from the received signal, prior to the detection of low-data-rate signals such as voice. This general approach is described in U.S. Pat. No. 7,389,099, “Method and apparatus for canceling interference from high power, high data rate signals,” the disclosure of which is incorporated herein by reference in its entirety. 
     The basic operations of interference cancellation consist of three steps. First, data bits carried in the interfering signal are detected. Next, the interference signal is regenerated at the receiver. Finally, the regenerated interfering signal is cancelled from the received signal. 
     The first step can be done before decoding (pre-decoding interference cancellation) or after decoding (post-decoding interference cancellation). The second step is basically to mimic how the transmitted bits arrive at the receiver. This involves going through the operations performed at the transmitter (what the transmitter has done to the data bits) and channel filtering (what the channel has done to the data bits). 
     Pre-decoding interference cancellation is preferable due to its lower latency. When an interfering signal uses 10 msec Transmission Time Interval (TTI) and the desired latency is on the order of a few slots, then the transport format information can not be detected via the reception of Enhanced Dedicated Physical Control Channel (E-DPCCH). This is because for 10 ms TTI (i.e. 15 WCDMA slots), an E-DPCCH message is also spread over 10 ms, which means that E-DPCCH can only be received very reliably after 10 ms. Thus, within the desired latency (a few slots) of pre-decoding interference cancellation, the transport format cannot be detected reliably through the reception of E-DPCCH. Early E-DPCCH detection is possible provided that E-DPCCH is boosted in power. However, the boosting E-DPCCH feature is not available for 10 msec TTI. 
     Accordingly, to perform pre-decoding interference cancellation for 10 msec TTI, the transport format (e.g., modulation, spreading factor, and number of spreading codes) must be blindly detected. 
     Blind spreading factor detection is known in the art, and is addressed in the IS-95 standard. For example, one known solution is to run a Viterbi decoder once for each rate (or spreading factor) hypothesis and formulate decision metrics based on the decoder outputs, as described in U.S. Pat. No. 5,566,206, “Method and apparatus for determining data rate of transmitted variable rate data in a communications receiver,” incorporated herein by reference in its entirety. However, these techniques have latency of 10 msec, and thus are not suitable for the case of 10 msec TTI. 
     An optimal pre-decoding blind spreading factor detector is described by E. Davis, et al., in the paper titled, “A MAP blind bit-rate detector for variable-gain multiple-access systems,” published in the  IEEE Trans. Commun., vol.  51, pp. 880-884, June 2003, which is incorporated herein by reference in its entirety. Another optimal pre-decoding blind spreading factor detector, and additionally a suboptimal scheme based on the autocorrelations of partially despread values, is described by M. Juntti and K. Pajukoski in the paper titled, “Blind spreading factor detection for DS-CDMA,” published in the  Proc. IEEE Int. Symp. Personal, Indoor, Mobile Radio Commun ., pp. 1395-1399, London, U. K., September 2000, which is incorporated herein by reference in its entirety. The optimal pre-decoding blind spreading factor detection schemes described in these papers are unnecessarily complex due to their treatment about the amplitude of the desired signal term as a function of the spreading factor hypothesis. Additionally, the papers do not elaborate how to obtain key parameters necessary for the optimal detectors. 
     SUMMARY 
     According to one or more embodiments described and claimed herein, the amplitude of the desired signal term is decoupled from the spreading factor. Furthermore, the amplitude of a desired signal and the variance of an associated impairment term are estimated, and the estimates are used to form detection metrics, each associated with a spreading factor hypothesis. Additionally, in one or more embodiments, a suboptimal detector does not rely on estimates of the amplitude of the desired signal or variance of the impairment term. Rather, the detector relies on scaled values that are partially despread using an initial spreading factor not greater than the smallest possible spreading factor used by the signal of interest, and combined using combining weights from a Rake or G-Rake processor, wherein the scaling factor is chosen to yield a unity ratio between the signal amplitude and noise variance after scaling. 
     One embodiment relates to a method of detecting the spreading factor of a received CDMA signal. The received signal is initially despread using an initial spreading factor that is no greater than the smallest possible spreading factor used to spread the signal. The despread values are combined using combining weights generated by a Rake receiver, to generate partially despread and combined signal values. Prior to further processing, an actual spreading factor is estimated based on a most likely data bit repetition factor. The detected data symbol repetition factor is used to further combine the partially despread and combined signal values prior to decoding. 
     Another embodiment relates to a CDMA receiver. The receiver includes one or more antennas receiving a CDMA communication signal. The receiver also includes a despreader operative to despread the received signal using an initial spreading factor that is no greater than the smallest possible spreading factor used to spread the signal. The receiver further includes one of a Rake or G-Rake receiver operative to generate combining weights for the received signal, and a combiner operative to combine the despread values using the combining weights, and to generate a partially despread and combined signal. The receiver additionally includes a blind spreading factor detector, upstream of a decoder, operative to estimate an actual spreading factor of the received signal based on a most likely data bit repetition factor. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  is a functional block diagram of part of a receiver featuring a blind spreading factor detector operating from an initial despreading factor. 
         FIG. 2  is a graph of exact and approximated values for a mathematical approximation used in a repetition factor likelihood function. 
     
    
    
     DETAILED DESCRIPTION 
       FIG. 1  depicts a portion of a blind spreading factor (SF) receiver  10 . A front end (not shown) receives, low-noise amplifies, filters, downconverts, and digitizes received signals, providing baseband chip samples from a plurality of antennas. The baseband chip samples are despread by a despreader  12 , using an initial despreading factor L 0 , where L 0 , is no greater than the smallest possible SF used by the signal of interest (e.g., the interfering signal that is being detected). For example, if the signal of interest could use SF 4, 8, or 16, according to its configuration, then L 0  could be 1, 2, or 4. A Rake or Generalized Rake (G-Rake) processor  14  generates finger delays and combining weights, as known in the art. A combiner  16  combines the signals despread with the initial despreading factor L 0 , based on the combining weights from the (G)-Rake receiver  14 , to generate partially despread and combined values. As used herein, the term “partially despread and combined values” refers to combined values that were despread using an initial despreading factor L 0  that is no larger than the actual SF used to spread the signal of interest. 
     The partially despread and combined value at time i are denoted as z(i):
 
 z ( i )= Ax ( i )+ u ( i ),
 
where x(i) is the signal component, with power A 2 ; and u(i) is the noise component, with variance σ 2 .
 
     In WCDMA uplink, SF detection can be done based on the 1st data channel (E-DPDCH 1 ), which is transmitted on the I or Q branch, depending on the configuration. In either case, the receiver can take the real or imaginary part of the complex-valued partially despread and combined values to get real-valued y(i). Without loss of generality, assume the 1 st  data channel is carried in the I branch,
 
 y ( i )= Re{z ( i )}= Ax ( i )+ Re{u ( i )}= Ax ( i )+ n ( i ).  (1)
 
     The signal component in y(i) is 
                 x   ⁡     (   i   )       =     b   ⁡     (     ⌊     i   L     ⌋     )         ,         
where b(i) is the ith data bit; and L is the number of repetitions of a particular data bit in x(i). Assuming the initial despreading factor is L 0  and the true spreading factor is N,
 
     
       
         
           
             L 
             = 
             
               
                 N 
                 
                   L 
                   0 
                 
               
               . 
             
           
         
       
     
     Let y=(y(0), y(1), . . . y(K−1)) T  be the vector of partially despread and combined values available to the detector  18 . A maximum likelihood (ML) detector will detect the SF as L o {circumflex over (L)}, if p(y|{circumflex over (L)})≧p(y|L), LεS L , where S L  is the set of possible repetition values. Based on p(y|L), we can formulate log-likelihood function of L as follows: 
     
       
         
           
             
               
                 
                   
                     Λ 
                     ⁡ 
                     
                       ( 
                       L 
                       ) 
                     
                   
                   = 
                   
                     
                       
                         - 
                         
                           K 
                           2 
                         
                       
                       ⁢ 
                       
                         ( 
                         
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               ( 
                             
                             ⁢ 
                             2 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               πσ 
                               2 
                             
                           
                           + 
                           
                             
                               A 
                               2 
                             
                             
                               σ 
                               2 
                             
                           
                         
                         ) 
                       
                     
                     + 
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           0 
                         
                         
                           K 
                           - 
                           1 
                         
                       
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         ln 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         
                           
                             cosh 
                             ( 
                             
                               
                                 A 
                                 ⁢ 
                                 
                                   
                                     ∑ 
                                     
                                       l 
                                       = 
                                       0 
                                     
                                     
                                       L 
                                       - 
                                       1 
                                     
                                   
                                   ⁢ 
                                   
                                       
                                   
                                   ⁢ 
                                   
                                     y 
                                     ⁡ 
                                     
                                       ( 
                                       
                                         Li 
                                         + 
                                         l 
                                       
                                       ) 
                                     
                                   
                                 
                               
                               
                                 σ 
                                 2 
                               
                             
                             ) 
                           
                           . 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
     The variance of noise can be estimated through 
                         σ   ^     2     =       1   2     ⁢     w   H     ⁢   Rw       ,           (   3   )               
where w are the combining weights used to obtain the partially despread and combined values; and R is the impairment covariance estimate for complex-valued noise u(i). R can be obtained, for example, using unused codes as proposed in U.S. patent application Ser. No. 12/135,268, titled “Method and apparatus for estimating impairment covariance matrices using unoccupied spreading codes,” filed Jun. 9, 2008, and assigned to the assignee of the present application, the disclosure of which is incorporated herein by reference in its entirety. The factor of ½ in (3) is due to the variance of real-valued noise n(i) being one half that of the complex-valued noise u(i).
 
     The signal amplitude A can be estimated through,
 
 Â=w   H   h   (4)
 
where h is the net response according to E-DPDCH 1  power. h can be related to the net response of the pilot carried in DPCCH h p  by
 
 h =β( L ) h   p .  (5)
 
Here, β(L) accounts for the energy difference between DPCCH and E-DPCCH 1 . As the notation implies, this difference is a function of L, as in practice the power offset between DPCCH and E-DPDCH 1  depends on the data rate of E-DPDCH 1 . As such, such a power offset will also depend on the SF.
 
     Combining equations (4) and (5) yields,
 
 Â ( L )=β( L ) w   H   h   p =β( L ) A   p .  (6)
 
We assume that the base station has knowledge of β(L). As a result, the amplitude of the desired signal can be obtained for each hypothesis of L.
 
     However, making A dependent on L introduces complexity in the detector  18 . Alternatively, A can be estimated by other means, that can make it independent of L. As such, the first term in the log-likelihood function of equation (2) can be omitted. 
     Taking the magnitude square of both sides of equation (1) gives
 
| y ( i )| 2   =A   2 +σ 2 .
 
Thus, an estimate of A can be obtained through
 
{circumflex over ( A )}=√{square root over (| y ( i )| 2 −σ 2 )}.  (7)
 
     In equation (7), the estimate of A does not depend on the hypothesis of L. With estimated signal amplitude and noise variance, and dropping out terms that do not depend on L, yields the new log-likelihood function: 
     
       
         
           
             
               
                 
                   
                     Λ 
                     ⁡ 
                     
                       ( 
                       L 
                       ) 
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         0 
                       
                       
                         K 
                         - 
                         1 
                       
                     
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     
                       ln 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         
                           cosh 
                           ( 
                           
                             
                               
                                 A 
                                 ^ 
                               
                               ⁢ 
                               
                                 
                                   ∑ 
                                   
                                     l 
                                     = 
                                     0 
                                   
                                   
                                     L 
                                     - 
                                     1 
                                   
                                 
                                 ⁢ 
                                 
                                     
                                 
                                 ⁢ 
                                 
                                   y 
                                   ⁡ 
                                   
                                     ( 
                                     
                                       Li 
                                       + 
                                       l 
                                     
                                     ) 
                                   
                                 
                               
                             
                             
                               
                                 σ 
                                 ^ 
                               
                               2 
                             
                           
                           ) 
                         
                         . 
                       
                     
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
     The L that maximizes the log-likelihood function of equation (8) will be chosen as the most likely repetition factor,
 
 {circumflex over (L)}= arg max L Λ( L ),  (9)
 
and the detected SF is thus L o {circumflex over (L)}.
 
     In one embodiment, the present invention relates to a suboptimal blind SF detector that removes the dependence on signal amplitude and noise variance from the SF detection task. In equation (8), if 
                 A     σ   2       ≈   1     ,         
then the terms associated with signal power and noise variance can be removed from the likelihood function. The partially despread and combined values may be scaled by a positive scaling factor to get
 
 y′ ( i )=α y ( i )=α Ax ( i )+α n ( i )= A′x ( i )+ n′ ( i ).
 
Note that the new amplitude in the y′(i) term is now A′=αA and the noise variance is σ′ 2 =α 2 α 2 . Ideally,
 
               α   =     A     σ   2         ,         
which results in a unity ratio between the signal amplitude and noise variance after scaling. However, since the objective is to drop the requirements of the knowledge of signal power and noise variance, in practice a has to be estimated through other means.
 
     Using the scaled partially despread and combined values y′(i) in the detector, and assuming a unity ratio between the new signal amplitude and noise variance, we can derive a new likelihood function as 
                     Λ   ⁡     (   L   )       =       ∑     i   =   0       K   -   1       ⁢           ⁢     ln   ⁢           ⁢       cosh   (       ∑     l   =   0       L   -   1       ⁢           ⁢       y   ′     ⁡     (     Li   +   l     )         )     .                 (   10   )               
Furthermore, for x&gt;&gt;1,
 
     
       
         
           
             
               
                 
                   
                     ln 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     
                       cosh 
                       ⁡ 
                       
                         ( 
                         x 
                         ) 
                       
                     
                   
                   = 
                   
                     
                       ln 
                       ⁡ 
                       
                         ( 
                         
                           
                             
                               ⅇ 
                               x 
                             
                             + 
                             ⅇ 
                             ⁢ 
                             
                               - 
                               x 
                             
                           
                           2 
                         
                         ) 
                       
                     
                     ≈ 
                     
                       
                          
                         x 
                          
                       
                       - 
                       
                         ln 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         2. 
                       
                     
                   
                 
               
               
                 
                   ( 
                   11 
                   ) 
                 
               
             
           
         
       
     
     The approximation of equation (11) can be further lower-bounded by 0. This approximation is illustrated in  FIG. 2 , which shows that the approximation is good for x&gt;2, and relatively poor for smaller |x|. Thus, another role for the scaling factor α is to control the value of y′(i) to be in a region where the approximation in (11) yields a good detection performance. The inventors have found empirically that a good choice of α is 
     
       
         
           
             
               
                 
                   α 
                   = 
                   
                     
                       1 
                       
                         E 
                         ⁡ 
                         
                           [ 
                           
                              
                             
                               y 
                               ⁡ 
                               
                                 ( 
                                 i 
                                 ) 
                               
                             
                              
                           
                           ] 
                         
                       
                     
                     . 
                   
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
           
         
       
     
     Using the α of equation (12) in equation (11) yields a suboptimal detector 
                     Λ   ⁡     (   L   )       =         ∑     i   =   0       K   -   1       ⁢            ∑     l   =   0       L   -   1       ⁢           ⁢     αy   ⁡     (     Li   +   l     )                -       K   L     ⁢   ln   ⁢           ⁢   2               (   13   )               
As in equation (9), the value of L that maximizes the above log-likelihood function will be chosen as the most likely repetition factor,
 
 {circumflex over (L)} =arg max L Λ( L ),  (9)
 
and the detected SF is thus L o {circumflex over (L)}.
 
     By the methods of the present invention, the SF used at the transmitter can be detected very reliably, even at low values of SINR. For example, the optimal detector can achieve 1% detection error rate at −9.7 dB E c /N 0  in the flat channel, where E c  is the energy per chip and N 0  is the one-sided noise power spectral density. When there is a 3 dB estimation error in the signal amplitude estimation, the optimal scheme achieves 1% detection error rate at −6.2 dB E c /N 0  in the flat channel. 
     The suboptimal scheme can achieve 1% detection error rate at −7.7 dB E c /N 0 . By comparison, this outperforms the autocorrelation scheme proposed by Juntti and Pajukoski, cited above, which requires −5.2 dB E c /N 0  to achieve 1% detection error rate. 
     The present invention may, of course, be carried out in other ways than those specifically set forth herein without departing from essential characteristics of the invention. The present embodiments are to be considered in all respects as illustrative and not restrictive, and all changes coming within the meaning and equivalency range of the appended claims are intended to be embraced therein.