Adaptive diversity combining for wide band code division multiple access (W-CDMA) based on iterative channel estimation

Abstract

The present invention provides a method for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising: splitting multi-path interference into I known and I unknown components, precomputing said I known interference components, iteratively estimating channel interference after removing I known components of the multi-path interference from the pilot symbols, using the convergence/divergence of the iteration as an indicator of the channel condition, and selecting the combining technique (MRC or EGC) automatically depending on the channel condition. The instant invention also provides a system and configured computer program product for carrying out the above method.

1 . A method for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising: 
 splitting multi-path interference into I known  and I unknown  components,    precomputing said I known  interference components,    iteratively estimating channel interference after removing I known  components of the multi-path interference from the pilot symbols,    using the convergence/divergence of the iteration as an indicator of the channel condition, and    selecting the combining technique (MRC or EGC) automatically depending on the channel condition.    
     
     
         2 . A method as claimed in  claim 1  wherein EGC is selected if said iteration diverges and MRC is selected if it converges.  
     
     
         3 . A method as claimed in  claim 1  wherein precomputation of said I known  interference components is calculated by the following formulae  
       
         
           
             
               
                 c 
                 l 
               
               = 
               
                 
                   
                     d 
                     l 
                   
                   - 
                   
                     ∑ 
                     
                       
                         c 
                         m 
                       
                        
                       
                         I 
                         known 
                       
                     
                   
                   - 
                   
                     I 
                     unknown 
                   
                 
                 
                   S 
                   
                     l 
                     , 
                     l 
                   
                 
               
             
           
           
           
               
           
         
       
       where, 
 c l =refined channel estimate of lth finger  
 d l =de-spread data of lth finger  
 c m =channel estimate of mth path  
 S ll =signal component that will be received if no path other than path l is present.  
 
     
     
         4 . A method as claimed in  claim 1  wherein refined channel estimates c l   n  are obtained using the following iteration  
         c   l   (n)   =d   l ( j )−Σ c   m   (n−1)   I   known    
       where 
 c l   (n) =nth iterative value of channel estimate  
 d l (j)=jth de-spread data of lth finger  
 c m   (n−1) =(n−1)th refined channel estimate of mth path.  
 
     
     
         5 . A method as claimed in  claim 1  wherein said convergence of the iteration is monitored using the following formula  
       δ=| c   l   (n)   −c   l   (n−1) | 
       where 
 δ=convergence measurement parameter  
 c l   (n) =nth iterative value of channel estimate  
 c m   (n−1) =(n−1)th refined channel estimate of mth.  
 
     
     
         6 . A method as claimed in  claim 1  wherein an increasing value of convergence measurement parameter indicates a diverging iteration while a reducing value of convergence measurement parameter indicates a converging iteration and the iteration is stopped when the following condition is satisfied wherein δ th  is fixed depending on the degree of refinement required for the channel estimates  
       δ<δ th    
       where, 
 δ=convergence of iteration  
 δ th =predefined threshold value of refinement required for channel estimate.  
 
     
     
         7 . A system for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising: 
 means for splitting multi-path interference into I known  and I unknown  components,    means for precomputing said I known  interference components,    means for iteratively estimating interference after removing I known  components of the multi-path interference from the pilot symbols,    means for monitoring the convergence/divergence of the iteration as an indicator of the channel condition, and    means for selecting the combining technique (MRC or EGC) automatically depending on the channel condition.    
     
     
         8 . A system as claimed in  claim 7  wherein said means for selecting chooses EGC if said iteration diverges and MRC if said iteration converges.  
     
     
         9 . A system as claimed in  claim 7  wherein means for precomputation of said I known  interference components uses following formulae  
       
         
           
             
               
                 c 
                 l 
               
               = 
               
                 
                   
                     d 
                     l 
                   
                   - 
                   
                     ∑ 
                     
                       
                         c 
                         m 
                       
                        
                       
                         I 
                         known 
                       
                     
                   
                   - 
                   
                     I 
                     unknown 
                   
                 
                 
                   S 
                   
                     l 
                     , 
                     l 
                   
                 
               
             
           
           
           
               
           
         
       
       where, 
 c l =refined channel estimate of lth finger  
 d l =de-spread data of lth finger  
 c m =channel estimate of mth path  
 S ll =signal component that will be received if no path other than path l is present.  
 
     
     
         10 . A system as claimed in  claim 7  wherein said means for iterative estimation uses:  
         c   l   (n)   =d   l ( j )−Σ c   m   (n−1)   I   known    
       where 
 c l   (n) =nth iterative value of channel estimate  
 d l (j)=jth de-spread data of lth finger  
 c m   (n−1) =(n−1)th refined channel estimate of mth path.  
 
     
     
         11 . A system as claimed in  claim 7  wherein said means for monitoring uses:  
       δ=| c   l   (n)   −c   l   (n−1) | 
       where 
 =convergence of iteration  
 c l   (n) =nth iterative value of channel estimate  
 c m   (n−1) =(n−1)th refined channel estimate of mth.  
 
     
     
         12 . A system as claimed in  claim 7  wherein said means for monitoring uses an increasing value of convergence measurement parameter to indicate a diverging iteration and a reducing value of convergence measurement parameter to indicate a converging iteration and the iteration is stopped when the following condition is satisfied wherein δ th  is fixed depending on the degree of refinement required for the channel estimates  
       δ<δ th    
       where, 
 δ=convergence of iteration  
 δ th =predefined threshold value of refinement required for channel estimate.  
 
     
     
         13 . A computer program product comprising computer readable program code stored on computer readable storage medium embodied therein for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising: 
 computer readable program code means configured for splitting multi-path interference into I known  and I unknown  components,    computer readable program code means configured for precomputing said I known  interference components,    computer readable program code means configured for iteratively estimating interference after removing I known  components of the multi-path interference from the pilot symbols,    computer readable program code means configured for monitoring the convergence/divergence of the iteration as an indicator of the channel condition, and    computer readable program code means configured for selecting the combining technique (MRC or EGC) automatically depending on the channel condition.    
     
     
         14 . A computer program product as claimed in  claim 13  wherein said computer readable program code means configured for selecting chooses EGC if said iteration diverges and MRC if said iteration converges.  
     
     
         15 . A system as claimed in  claim 13  wherein computer readable program code means configured for precomputation of said I known  interference components uses following formulae  
       
         
           
             
               
                 c 
                 l 
               
               = 
               
                 
                   
                     d 
                     l 
                   
                   - 
                   
                     ∑ 
                     
                       
                         c 
                         m 
                       
                        
                       
                         I 
                         known 
                       
                     
                   
                   - 
                   
                     I 
                     unknown 
                   
                 
                 
                   S 
                   
                     l 
                     , 
                     l 
                   
                 
               
             
           
           
           
               
           
         
       
       where, 
 c l =refined channel estimate of lth finger  
 d l =de-spread data of lth finger  
 c m =channel estimate of mth path  
 S ll =signal component that will be received if no path other than path l is present.  
 
     
     
         16 . A system as claimed in  claim 13  wherein said computer readable program code means configured for iterative estimation uses:  
         c   l   (n)   =d   l ( j )−Σ c   m   (n−1)   I   known    
       where 
 c l   (n) =nth iterative value of channel estimate  
 d l (j)=jth de-spread data of lth finger  
 c m   (n−1) =(n−1)th refined channel estimate of mth path.  
 
     
     
         17 . A system as claimed in  claim 13  wherein said computer readable program code means configured for monitoring uses:  
       δ=| c   l   (n)   −c   l   (n−1) | 
       where 
 =convergence of iteration  
 c l   (n) =nth iterative value of channel estimate  
 c m   (n−1) =(n−1)th refined channel estimate of mth.  
 
     
     
         18 . A system as claimed in  claim 13  wherein said computer readable program code means configured for monitoring uses an increasing value of convergence measurement parameter to indicate a diverging iteration and a reducing value of convergence measurement parameter to indicate a converging iteration and the iteration is stopped when the following condition is satisfied wherein δ th  is fixed depending on the degree of refinement required for the channel estimates  
       δ<δ th    
       where, 
 δ=convergence of iteration  
 δ th =predefined threshold value of refinement required for channel estimate.