Abstract:
A concept for estimating interfering channels in a multicellular radio communication system including a plurality of base stations and at least a mobile station is suggest, wherein pilot signals are transmitted from the base stations to at least a mobile station, additional pilot sequences are generated, a pattern is provided which defines a rule for distributing said pilot sequences to the base stations, said pilot sequences are modulated and superposed onto said pilot signals, and a pilot signal received at a mobile station is used for estimating interferences in the communication channel from the base station which transmits said pilot signal.

Description:
FIELD OF THE INVENTION 
       [0001]    The present invention relates to a method and a system for estimating interference channels in a multicellular radio telecommunication system including a plurality base stations and at least a mobile station. Moreover, the present invention relates to a base station and a mobile station in such a multicellular radio telecommunication system. Finally, the present invention relates to a pilot signal adapted to be used for estimating interfering channels in such a multicellular radio telecommunication system. 
       BACKGROUND OF THE INVENTION 
       [0002]    Multi-cell interference is undoubtedly the major limiting factor in full-coverage broadband wireless access networks. Mitigating its effect onto the downlink data transmission is one of the key challenges in future wireless communication systems. The better the knowledge about the interference channels, the better is also the basis for any interference mitigation. 
         [0003]    Multi-cell channel knowledge can be exploited by simple, receiver-based schemes as interference rejection combining (IRC) (cf. C. A. Baird and C. L. Zahm, “Performance criteria for narrowband array processing,” in  IEEE Conference on Decision and Control , vol. 10, 1971, pp. 564-565) so as to increase post-equalization SINR (signal-to-noise-ratio where noise includes both thermal noise and interference) of the terminal in the downlink, in particular in the LTE (long term evaluation) downlink, and thus the throughput, or advanced schemes based on cooperative base stations such as joint transmission (JT) (cf. T. Weber, I. Maniatis, A. Sklavos, Y. Liu, E. Costa, H. Haas, and E. Schulz, “Joint transmission and detection integrated network (joint), a generic proposal for beyond 3g systems,” in 9 th International Conference on Telecommunications  ( ICT&#39; 02),  Beijing , vol. 3, June 2002, pp. 479-483; H. Huang and S. Venkatesan, “Asymptotic downlink capacity of coordinated cellular networks,” in  Conference Record of the Thirty - Eighth Asilomar Conference on Signals, Systems and Computers,  2004., vol. 1, 2004, pp. 850-855). 
         [0004]    In order to estimate the channels of interferers, the base stations (base stations) must transmit pilot symbols as training signals being orthogonal among the antennas of different sectors and sites, wherein at the receiving site in the mobile terminal (MT) the received pilot symbols are compared with a reference in order to judge kind and extent of the interferences in the respective channels. On the other hand, quite a lot of these channels must be estimated to combat the interference until the noise floor is reached. The more interferer channels are distinguishable, the more orthogonal pilots must be transmitted. This consumes a large fraction of the potential capacity gain. 
         [0005]    In particular, in the standard of the cellular system LTE, the aforementioned issue has been left open which, however, needs to be considered for a fully working system achieving higher throughput. Therefore, it is of great interest to gain knowledge of the interference channels as already mentioned above. The 3G-LTE (third generation long term evaluation) system provides built-in means to independently estimate the intra-cell channels belonging to the same Node-B based on pilots. So far, there is no efficient proposal of how to extend this to all Node-base station in such a system. 
         [0006]    For Node-B cooperation in FDD (frequency division duplex) multi-cell applications any kind of channel state information is required at the Node-base station (coherent channel state information (CSI) or incoherent channel quality information, CQI)). This knowledge may be gained based on a multi-cell channel estimation to be performed at the terminal side based on orthogonal pilots. It is not possible to define as many orthogonal pilots as required for a reasonable estimation of the multi cellular channels since this would reduce the spectral efficiency of the system due to the pilot overhead. So it has to find some kind of a gap in the standard how to orthogonalize the base station signals. 
         [0007]    In the prior art, the use of code-division multiplexing is known from the WCDMA (wideband code division multiple access) systems. In this system, the common downlink pilot channel (CDPICH) is spread by a cell-specific length-256 sequence, which gives an estimator gain of at most 24 dB against other signals after correlation over the sequence length. In this way, at least the strongest interference signals can be estimated at the terminal side. 
         [0008]    There is no comparable technique available for OFDM-based cellular systems, where the channel is estimated in a frequency-selective manner, and most of the pilot resources available for interference suppression is used for accurate frequency-selective channel estimation. Spreading gains as high as in the WCDMA standard are unknown and not feasible in OFDM systems like 3G LTE. 
         [0009]    Moreover, it has been found that it is difficult to obtain a precise downlink CSI as required for joint transmission at the base station; namely, the requirements are stricter than whose for joint detection in the opposite uplink direction (cf. T. Haustein, C. von Helmolt, E. Jorswieck, V. Jungnickel, and V. Pohl, “Performance of MIMO systems with channel inversion,” in  IEEE  55 th Vehicular Technology Conference,  2002 . VTC Spring  2002., vol. 1, 2002, pp. 35-39). As already mentioned above, modern cellular systems may unfortunately not provide as many of orthogonal pilot symbols as need to estimate all channels independently. 
       SUMMARY OF THE INVENTION 
       [0010]    It is an object of the present invention to provide an efficient suggestion of how to extend the channel estimation to all base stations in a multi-cellular radio system. 
         [0011]    It is a further object of the present invention to provide a concept for multi-cell channel estimation in the downlink applicable for several physical layer concepts, in particular for coordinated joint transmission and interference rejection combining concepts. 
         [0012]    In order to achieve the above and further objects according to a first aspect of the present invention, there is provided a method for estimating interfering channels in a multicellular radio communication system including a plurality of base stations and at least a mobile station, comprising the steps of transmitting pilot signals from the base stations to at least a mobile station, and using a pilot signal received at a mobile station for estimating interferences in the communication channel from the base station which transmits said pilot signal, wherein additional pilot sequences are generated, a pattern is provided which defines a rule for distributing said pilot sequences to the base stations, and said pilot sequences are modulated and superposed onto said pilot signals. 
         [0013]    According to a second aspect of the present invention, there is provided a system for estimating interfering channels in a multicellular radio communication system including a plurality of base stations and at least a mobile station, comprising means for transmitting pilot signals from the base stations to at least a mobile station, means for generating additional pilot sequences, means for providing a pattern which defines a rule for distributing said pilot sequences to the base stations, means for modulating and superposing said pilot sequences onto said pilot signals, and means for using a pilot signal received at a mobile station for estimating interferences in the communication channel from the base station which transmits said pilot signal. 
         [0014]    According to a third aspect of the present invention, there is provided a base station in a multicellular radio communication system including a plurality of base stations and at least a mobile station, comprising a transmitter for transmitting pilot signals to at least a mobile station, a generator for generating additional pilot sequences according to an individual pattern allocated to this base station, and a modulator for modulating and superposing said pilot sequences onto said pilot signals. 
         [0015]    According to a fourth aspect of the present invention, there is provided a mobile station in a multicellular radio communication system including a plurality of base stations and at least a mobile station, comprising a receiver for receiving a pilot signal transmitted from a base station, said pilot signal includes at least a pilot sequence modulated and superposed onto pilot signal, wherein a pattern is provided which defines a rule for distributing pilot sequences to the base stations, and an estimator for estimating interferences in the communication channel from the base station which is determined in accordance with the pilot sequence as transmitting said pilot signal. 
         [0016]    According to a fifth aspect of the present invention, there is provided a pilot signal adapted to be used for estimating interfering channels in a multicellular radio communication system including a plurality of base stations and at least a mobile station, including at least an additional pilot sequence which is modulated to this pilot signal, wherein a pattern is provided which defines a rule for allocating said pilot sequence to a predetermined base station or a group of predetermined base stations. 
         [0017]    Exemplary embodiments of the present invention are defined in the dependent claims. 
         [0018]    The present invention provides a definition of reference signal sequence allocation allowing for optimum channel estimation in multicell scenarios with inter-cell interference. The suggested concept according to the present invention results in a trade-off between the ability to track the interference channels and the mobility of the user. The virtual pilot scheme according to the present invention does not consume any more pilots than in current systems. But it enables mobile terminals to distinguish the more of the strong interference channels the slower they are moved in the service area. Hence, without increasing the pilot overhead, low-mobility terminals can take most benefit of advanced interference mitigation schemes. 
         [0019]    Preferably, the concept of the present invention is based on the current draft specification of the 3G-LTE specifying orthogonal pilot signals between different sectors while different sites are not orthogonal but marked with a pseudo-random sequence (PRS) defined by the network operator. The present invention proposes to use not random but deterministic sequences denoted as virtual pilots and provide a pilot reuse scheme based on the partial correlation principle. In this way, channels of nearby base stations may be estimated at an early stage due to the pattern provided according to the present invention, and therefore be separated using a short correlation window, e.g. over two transmission time intervals (TTIs), while estimating the channels of more distant stations requires a longer correlation window and hence a reduced user mobility since the distant cells are attenuated by a higher path loss on average, i.e. these cells are less important for cooperation purpose. 
         [0020]    Moreover, it is to be noted here that the virtual pilot sequences as generated and used in accordance with the present invention are not limited to Hadamard sequences, but all kinds of orthogonal sequences may be used as e.g. DFT sequences. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0021]    The invention will now be described based on embodiments with reference to the accompanying drawings in which: 
           [0022]      FIG. 1  schematically shows a 3G-LTE framing structure including reserved orthogonal pilot symbols for intra-cell channel estimation; 
           [0023]      FIG. 2  schematically shows the development of an assignment plane for a virtual pilot pattern given for the first four steps in a triple-sectorized cellular system; 
           [0024]      FIG. 3  schematically shows a pilot reuse pattern based on orthogonal code sequence as a final result of the steps of  FIG. 2  in a triple-sectorized cellular system; 
           [0025]      FIG. 4  is a graph showing a mean normalized mean square error (MSE) over transmission time interval (TTI) for a received signal covariance estimation technique and a multi-cell channel estimation technique; 
           [0026]      FIG. 5  is a graph showing a normalized mean square error (MSE) obtained for a correlation estimator over transmission time interval (TTI) in case of a static channel for the five strongest sectors ( FIGS. 5   a, b  and  c ) and for inner sectors ( FIG. 5   d ); and 
           [0027]      FIG. 6  is a graph showing a normalized mean square error (MSE) obtained for the correlation estimator using the suggested virtual pilot pattern according to an embodiment of the present invention over transmission time interval (TTI) in case of a dynamic channel for the five strongest sectors ( FIG. 6   a ) and the loss in the normalized mean square error compared to static channel conditions ( FIG. 6   b ). 
       
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENT 
       [0028]    Before an exemplary embodiment will be described in detail, at first the background is described for better understanding of the present invention. 
         [0029]    A MIMO (multiple-input multiple-output) transmission on each subcarrier Ω in OFDMA (orthogonal frequency divisional multiple access) systems, having a number N T  of transmit antennas and a number N R  of receive antennas with N T =N R , is described by 
         [0000]        y (Ω)= H (Ω)×(Ω)+ n (Ω),  (1)
 
         [0000]    where H indicates the N R ×N T  channel matrix; x denote the N T ×1 vector of the transmitted symbols; y and n denote the N R ×1 vectors of the received signals and the additive white Gaussian noise (AWGN) samples. 
         [0030]    In the following, the frequency index Ω is eliminated, and the multi-cellular MIMO channels in the downlink are considered. The received downlink signal y m  at the mobile terminal m in the cellular environment is given by 
         [0000]    
       
         
           
             
               
                 
                   
                     y 
                     m 
                   
                   = 
                   
                     
                       
                         h 
                         
                           i 
                           , 
                           u 
                         
                         m 
                       
                        
                       
                         x 
                         
                           i 
                           , 
                           u 
                         
                       
                     
                     + 
                     
                       
                         
                           
                             ∑ 
                             
                               
                                 l 
                                 = 
                                 1 
                               
                               
                                 l 
                                 ≠ 
                                 u 
                               
                             
                             
                               N 
                               T 
                             
                           
                            
                           
                               
                           
                            
                           
                             
                               h 
                               
                                 i 
                                 , 
                                 l 
                               
                               m 
                             
                              
                             
                               x 
                               
                                 i 
                                 , 
                                 l 
                               
                             
                           
                         
                         + 
                         
                           
                             ∑ 
                             
                               
                                 
                                   ∀ 
                                   k 
                                 
                                 , 
                                 l 
                               
                               
                                 k 
                                 ≠ 
                                 i 
                               
                             
                           
                            
                           
                               
                           
                            
                           
                             
                               h 
                               
                                 k 
                                 , 
                                 l 
                               
                               m 
                             
                              
                             
                               x 
                               
                                 k 
                                 , 
                                 l 
                               
                             
                           
                         
                         + 
                         n 
                       
                       
                          
                         
                           z 
                           
                             i 
                             , 
                             u 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0031]    The desired u-th data stream transmitted from the i-th base station is disturbed by the interference given in z i,u . 
         [0032]    A practical way to perform interference reduction is directly at the mobile terminal where reliable channel knowledge is available and the interference may be detected. For interference suppression at the mobile terminal, it is required to obtain the system&#39;s covariance matrix R XX  of the signal, interference and noise, where σ x     k,l     2  and are the power of each signal x k,l  and the noise, respectively. 
         [0000]        R=   yy =Σσ x     k,l     2   h   k,l   h   k,l   H +σ n   2   I   (3)
 
         [0033]    A technique utilizing these estimates for the purpose of interference reduction is the minimum mean square error (MMSE) receiver. By employing multiple receive antennas, it is possible to use this linear receiver technique and thus enhance the desired signal while suppressing the interference. For proper application it is necessary to know the system&#39;s covariance matrix R yy =Z i +σ x     u,i     2 h u,i h u,i   H , defined as 
         [0000]    
       
         
           
             
               
                 
                   
                     R 
                     yy 
                   
                   = 
                   
                     
                       
                         σ 
                         n 
                         2 
                       
                        
                       I 
                     
                     + 
                     
                       
                         ∑ 
                         
                           
                             ∀ 
                             k 
                           
                           , 
                           l 
                         
                       
                        
                       
                         
                           σ 
                           
                             x 
                             
                               k 
                               , 
                               l 
                             
                           
                         
                          
                         
                           h 
                           
                             k 
                             , 
                             l 
                           
                         
                          
                         
                           h 
                           
                             k 
                             , 
                             l 
                           
                           H 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
             
               
                 
                   
                     w 
                     i 
                     MMSE 
                   
                   = 
                   
                     
                       σ 
                       
                         xi 
                         , 
                         u 
                       
                     
                      
                     
                       R 
                       yy 
                       
                         - 
                         1 
                       
                     
                      
                     
                       h 
                       i 
                     
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
           
         
       
     
         [0034]    Using Jensen&#39;s inequality for convex functions leads to the lower bound of the instantaneous SINR. 
         [0000]    
       
         
           
             
               
                 
                   
                     SINR 
                     i 
                   
                   ≥ 
                   
                     
                       σ 
                       
                         x 
                         
                           i 
                           , 
                           u 
                         
                       
                     
                      
                     
                       
                         
                           w 
                           i 
                           H 
                         
                          
                         
                           h 
                           i 
                         
                          
                         
                           h 
                           i 
                           H 
                         
                          
                         
                           w 
                           i 
                         
                       
                       
                         
                           w 
                           i 
                           H 
                         
                          
                         
                           z 
                           i 
                         
                          
                         
                           w 
                           i 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
         [0035]    Equation (6) is individually maximized by using the equation (5) (cf. C. A. Baird and C. L. Zahm, “Performance criteria for narrowband array processing,” in  IEEE Conference on Decision and Control , vol. 10, 1971, pp. 564-565). Hence, the achievable SINR (signal-to-noise ratio where noise includes terminal noise and interference) with full channel knowledge for all interfering base station is given by 
         [0000]    
       
         
           
             
               
                 
                   
                     SINR 
                     i 
                   
                   ≥ 
                   
                     
                       
                         σ 
                         
                           x 
                           
                             i 
                             , 
                             u 
                           
                         
                       
                        
                       
                         h 
                         i 
                         H 
                       
                        
                       
                         R 
                         yy 
                         
                           - 
                           1 
                         
                       
                        
                       
                         h 
                         i 
                       
                     
                     
                       1 
                       - 
                       
                         
                           σ 
                           
                             x 
                             
                               i 
                               , 
                               u 
                             
                           
                         
                          
                         
                           h 
                           i 
                           H 
                         
                          
                         
                           R 
                           yy 
                           
                             - 
                             1 
                           
                         
                          
                         
                           h 
                           i 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
     
         [0036]    One may think of a simple mechanism to estimate the desired matrix. It is possible to obtain this knowledge by estimating the covariance matrix R yy =E[yy H ] of the received signal vector y using several subsequently received data symbols. The Hermitean transpose and expectation operators are denoted by (•) H  and E[•], respectively. 
         [0037]    By assuming a transmission of i.i.d. data symbols x k  over channel k and averaging over s symbols the estimation error will decrease with s (cf. V. Jungnickel, T. Haustein, E. Jorswieck, V. Pohl, and C. von Helmolt, “Performance of a MIMO system with overlay pilots,” in  Global Telecommunications Conference,  2001 . GLOBECOM &#39; 01.  IEEE , vol. 1, 2001, pp. 594-598 vol. 1; M. Speth, S. Fechtel, G. Fock, and H. Meyr, “Optimum receiver design for wireless broad-band systems using OFDM. I”  Communications, IEEE Transactions  on, vol. 47, no. 11, pp. 1668-1677, November 1999). The total number of transmitted data symbols across a quasistatic channel is given by S. {tilde over (R)} yy  denotes the estimated covariance matrix as 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       R 
                       ~ 
                     
                     yy 
                   
                   = 
                   
                     
                       1 
                       S 
                     
                      
                     
                       
                         ∑ 
                         
                           ∀ 
                           s 
                         
                       
                        
                       
                           
                       
                        
                       
                         E 
                          
                         
                           [ 
                           
                             
                               ( 
                               
                                 
                                   
                                     ∑ 
                                     
                                       
                                         ∀ 
                                         k 
                                       
                                       , 
                                       l 
                                     
                                   
                                    
                                   
                                     
                                       h 
                                       
                                         k 
                                         , 
                                         l 
                                       
                                     
                                      
                                     
                                       
                                         x 
                                         
                                           k 
                                           , 
                                           l 
                                         
                                       
                                        
                                       
                                         ( 
                                         s 
                                         ) 
                                       
                                     
                                   
                                 
                                 + 
                                 n 
                               
                               ) 
                             
                              
                             
                               
                                 ( 
                                 
                                   
                                     
                                       ∑ 
                                       
                                         
                                           ∀ 
                                           k 
                                         
                                         , 
                                         l 
                                       
                                     
                                      
                                     
                                       
                                         h 
                                         
                                           k 
                                           , 
                                           l 
                                         
                                       
                                        
                                       
                                         
                                           x 
                                           
                                             k 
                                             , 
                                             l 
                                           
                                         
                                          
                                         
                                           ( 
                                           s 
                                           ) 
                                         
                                       
                                     
                                   
                                   + 
                                   n 
                                 
                                 ) 
                               
                               H 
                             
                           
                           ] 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
         [0038]    The estimation error between R yy  and the estimated covariance matrix {tilde over (R)} yy  will be considered later in detail. 
         [0039]    According to the 3G-LTE specification (cf. 3GPP TS 36.211 Release 8), pilot symbols are intended to be used for the purpose of intra-cell channel estimation, as indicated in  FIG. 1 .  FIG. 1  shows the 3G-LTE framing structure including reserved orthogonal pilot symbols for intra-cell channel estimation. Zadoff-Chu sequences of length three enable the separate estimation of all three channels belonging to the sectors of the same base station. Furthermore, pilot symbols for the different transmit antennas are defined and located on different time and frequency positions, i.e. orthogonal, in a resource block. In addition, pilots are scrambled using pseudo-random sequences (PRS) to be defined by the network operators. 
         [0040]    The idea is to use additional pilot sequences getting orthogonal over time, e.g. Hadamard or DFT sequences. We define a pattern which defines the rule to distribute these sequences to the cells, i.e. Node-base station. These sequences are modulated and superposed onto the pilot symbols defined in 3G-LTE for different antenna configurations (cf. 3GPP TS 36.300v800, E-UTRA and E-UTRAN—overall description, March 2007) along the time axis, like an additional scrambling sequence. Thus the orthogonal pilot symbols of all sectors belonging to the same Node-B are superposed by the same sequence defined by the pattern. 
         [0041]      FIG. 2  schematically shows a development of the assignment plane for a virtual pilot pattern given for four steps with the sequence length being 1, 2, 4, and 8, respectively (according to  FIGS. 2   a, b, c  and  d , respectively) in a 3-fold sectorized cellular system, i.e. with each cell consisting of three sectors, wherein decimal numbers indicate the sector index. In  FIG. 2  each grey or black colour represents an orthogonal virtual pilot sequence being available with the given sequence length. Starting with sequence length 1 ( FIG. 2   a ), all sectors have the same virtual sequence. With sequence length 2 (cf.  FIG. 2   b ), each 2 nd  row is assigned with another virtual sequence being orthogonal to the original one after 2 time slots. In the next step with sequence length 4 (cf.  FIG. 2   c ), all grey sequences are split into two orthogonal subgroups, and the black sequences are split into another two orthogonal subgroups. In the next step with sequence length 8, the diagonal elements are split into subgroups, i.e. each 4 th  diagonal row repeats. The same is intended to be used in the other diagonal direction. The final result, valid for sequence length 16, is given in  FIG. 3 . The sequence assignment is given in Table 1. 
         [0000]    
       
         
               
             
           
               
                 TABLE 1 
               
               
                   
               
               
                 Sequence assignment with Hadamard sequences spread over space 
               
               
                 (rows) and time (columns) domain. 
               
               
                   
               
             
             
               
                 
                   
                             
                     
                         
                         
                     
                   
                 
               
               
                   
               
             
          
         
       
     
         [0042]    In the exemplary embodiment, Hadamard sequences are spread over the time domain from slot to slot with a maximum sequence length of 16.  FIG. 3  visualizes the suggested pilot grid, where the number (hex-based) indicates the code c n  chosen from the sequence matrix C, i.e. the row of the Hadamard matrix of maximum length N=16. The decimal numbers indicate the sequence length over the time domain. Table 1 shows that the Hadamard sequences are spread over space (indicative by the rows in Table 1) and time (indicated by columns in Table 1) domain. It is to be noted that the suggested scheme covers different sequence lengths n={1, 2, 4, 8, 16}, since the sequence pattern repeats itself every n rows. Thus the system may benefit from a more precise channel estimation for increasing sequence length n. 
         [0043]    It is further to be noted here that according to the definition of “block-orthogonal sequence” as to be used in the present context each row of a block-orthogonal sequence matrix is orthogonal to all other rows of the same matrix with full correlation length, i.e. CC H =I. Reducing the correlation length to n yields to a matrix with block wise orthogonal properties, where each block is of size n□n. Furthermore, each nth row should be identical for a given correlation length n. 
         [0044]    The suggested scheme assigning virtual pilot sequences to the multi-cell system is translational invariant with respect to the estimation error. Its block-orthogonality is sustained even after a cyclic shift. The suggested scheme can be easily extended to the case of larger correlation length. Furthermore, each kind of block-orthogonal sequence may be applied instead of Hadamard sequences yielding the same performance. E.g. resorting the columns and rows of the DFT matrix, such that block-orthogonality is given, leads to sequences having the same properties required by the correlation-based estimator. In this way, the virtual pilots can be interpreted as discrete frequency shifts by a fraction of a subcarrier spacing and partial correlation is a filtering process with limited spectral resolution. 
         [0045]    According to the scheme of  FIG. 3 , the distance between cells using the same Hadamard sequence are maximized. After 4 cells in a row the same sequence is assigned. That applies to the horizontal and both diagonal alignments. All cells in a radius of 4 have orthogonal sequences to the cell in the middle of the scheme. The assignment of the Hadamard sequences to cells is completely defined by an arbitrary rhombus containing 16 cells each one using another pilot sequence. The rhombus is repeated to fill an infinity plane. One possible rhombus in  FIG. 3  is enclosed by the cells E, 0 , 1 , 7 . It is to be noted that each permutation of the assignment would effect the channel estimation mean square error (MSE). In the suggested scheme it is guaranteed that the mean channel estimation error of a mobile terminal is independent of the cell where it is placed. That means it is sufficient to consider e.g. cell  0  of  FIG. 3  for a simulation only. 
         [0046]    At the mobile terminal, a correlation-based estimator is used to separate the channels h k,l  for the n distinct groups. The main reason to use the correlation-based estimator is its moderate computational complexity. The correlation-based estimator is given by 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         h 
                         ~ 
                       
                       v 
                     
                     = 
                     
                       
                         1 
                         n 
                       
                        
                       
                         
                           ∑ 
                           
                             p 
                             = 
                             0 
                           
                           
                             n 
                             - 
                             1 
                           
                         
                          
                         
                             
                         
                          
                         
                           
                             
                               c 
                               v 
                               * 
                             
                              
                             
                               ( 
                               p 
                               ) 
                             
                           
                            
                           
                             
                               y 
                               m 
                             
                              
                             
                               ( 
                               p 
                               ) 
                             
                           
                         
                       
                     
                   
                   , 
                   
                     
                       with 
                        
                       
                           
                       
                        
                       v 
                     
                     = 
                     
                       
                         { 
                         
                           0 
                           , 
                           … 
                            
                           
                               
                           
                           , 
                           
                             n 
                             - 
                             1 
                           
                         
                         } 
                       
                       . 
                     
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where c n (p) and y m (p) denote the code symbol and the received signal vector at a given discrete time index p, respectively. 
         [0047]    For performance evaluation, it is considered a 3GPP SCME (spatial channel model extended) channel model generating SISO (single-input single-output) channels. As indicated in the parameter list according to Table 2, static channels are assumed for the analysis, except stated otherwise. For the sectorization, the simulation scenario is initialized cell-wise, i.e. independently for each base station. The large-scale parameters are kept fixed for all 3 sectors belonging to the same base station while the small scale parameters are randomized. A so-called scenario-mix is introduced yielding different channel states for the base stations, e.g. LOS or NLOS, which seems to be more realistic than assuming same conditions for all channels. The state is changed within the simulation following a distance-dependent stochastic process based on experimental results. 
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 2 
               
             
             
               
                   
               
               
                 Simulation assumptions. 
               
             
          
           
               
                   
                 parameter 
                 value 
               
               
                   
                   
               
               
                   
                 channel model 
                 3GPP SCME 
               
               
                   
                 type 
                 Monte Carlo, 5000 user 
               
               
                   
                   
                 drops 
               
               
                   
                 scenario 
                 urban-macro 
               
               
                   
                 additional modifications 
                 scenario-mix 
               
               
                   
                 f c   
                 2 GHz 
               
               
                   
                 intersite distance 
                 500 m 
               
               
                   
                 number of base station 
                 37 having 3 sectors each 
               
               
                   
                 base station height 
                 32 m 
               
               
                   
                 mobile terminal height 
                 2 m 
               
               
                   
                 SNR 
                 ∞ 
               
               
                   
                   
               
             
          
         
       
     
         [0048]    For comparison of the different estimation errors, the mean normalized MSE is used, where Tr{•} denotes the trace operator 
         [0000]    
       
         
           
             
               
                 
                   MSE 
                   = 
                   
                     
                       
                         ∑ 
                         
                           ∀ 
                           n 
                         
                       
                        
                       
                         Tr 
                          
                         
                           { 
                           
                             E 
                              
                             
                               [ 
                               
                                 
                                   ( 
                                   
                                     
                                       
                                         R 
                                         yy 
                                       
                                        
                                       
                                         ( 
                                         n 
                                         ) 
                                       
                                     
                                     - 
                                     
                                       
                                         
                                           R 
                                           ~ 
                                         
                                         yy 
                                       
                                        
                                       
                                         ( 
                                         n 
                                         ) 
                                       
                                     
                                   
                                   ) 
                                 
                                  
                                 
                                   
                                     ( 
                                     
                                       
                                         
                                           R 
                                           yy 
                                         
                                          
                                         
                                           ( 
                                           n 
                                           ) 
                                         
                                       
                                       - 
                                       
                                         
                                           
                                             R 
                                             ~ 
                                           
                                           yy 
                                         
                                          
                                         
                                           ( 
                                           n 
                                           ) 
                                         
                                       
                                     
                                     ) 
                                   
                                   H 
                                 
                               
                               ] 
                             
                           
                           } 
                         
                       
                     
                     
                       
                         N 
                         · 
                         Tr 
                       
                        
                       
                         { 
                         
                           E 
                            
                           
                             [ 
                             
                               
                                 
                                   R 
                                   yy 
                                 
                                  
                                 
                                   ( 
                                   n 
                                   ) 
                                 
                               
                                
                               
                                 
                                   R 
                                   yy 
                                   H 
                                 
                                  
                                 
                                   ( 
                                   n 
                                   ) 
                                 
                               
                             
                             ] 
                           
                         
                         } 
                       
                     
                   
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
     
         [0049]    Results for the covariance estimation are shown in  FIG. 4 . It compares the mean normalized MSE for the covariance and correlation-based estimators, applicable over all OFDM data symbols or using virtual pilots, respectively. The correlation-based estimator requires at least a number of 7 OFDM symbols to be transmitted, i.e. one correlation length, where as the covariance estimator is capable to start the estimation with the first transmitted data symbol. It turns out that the correlation-based estimator outperforms the covariance estimator already for correlation length of one slot. 
         [0050]      FIG. 5  shows the MSE normalized by the receive power of the associated sector. It compares the different performance in the channel estimation process using virtual pilots based on pseudo-random ( FIG. 5(   a )), randomly arranged Hadamard ( FIG. 5(   b )) and Hadamard sequences ( FIG. 5(   c )) arranged in the specific pattern shown in  FIG. 3 . In these figures, the achievable MSE is given for top-N strongest sectors showing instantaneously the five highest receive powers at the mobile terminal. It turns out that using virtual pilots based on randomly arranged orthogonal sequences, e.g. Hadamard ( FIG. 5(   b )), cannot reduce the MSE compared to the case of using pseudo-random sequences. However, the suggested sequence reuse pattern assigning Hadamard sequences to the base stations shows a superior performance compared to the random arrangement of sequences. Within that scheme, base stations being closely located to each other are assigned to orthogonal sequences requiring smaller correlation lengths to be separable. 
         [0051]      FIGS. 5(   c ) and  5 ( b ) indicate the achievable MSE for the top-N strongest sectors as well as for a fixed set of sectors. For the latter, it is to be observed that the error of the multi-cell channel estimation is less than −10 dB for sequence length larger than 4, i.e. 2 TTI (transmission timing interval), for all sectors with index={1,2,3,8,21}; as indicated in  FIG. 3 . After full correlation length, the channel estimation of adjacent base stations is almost perfect, i.e. with a SINR&gt;40 dB. However, estimating the top-N strongest channels may cause higher errors. This is due to the fact that the top-N strongest channels may not belong to the adjacent base stations. Nevertheless, by using a more orthogonal grid for larger correlation length it is possible to reduce the MSE as indicated in  FIG. 5(   c ). The reduction of the MSE for the strongest signals is significant. For correlation length of 16, i.e. 8 TTI, the MSE is below −19 dB for the top-5 strongest channels. 
         [0052]    For quasi-static channels, the suggested multi-cell channel estimation approach may be implemented easily, wherein sites must be synchronized, e.g. by using the global positioning system (GPS). 
         [0053]    In the following it is evaluated the performance degradation in the estimation process due to time varying channels, e.g. caused by a certain velocity of the mobile terminal or simply phase noise. Introducing a constant phase rotation to a static channel would result in the simplest form of a time varying channel (cf. O. Besson and P. Stoica, “On parameter estimation of MIMO flat-fading channels with frequency offsets,”  IEEE Transactions on Signal Processing , vol. 51, no. 3, pp. 602-613, March 2003) as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       y 
                       m 
                     
                      
                     
                       ( 
                       p 
                       ) 
                     
                   
                   = 
                   
                     
                       
                         h 
                         
                           i 
                           , 
                           u 
                         
                         m 
                       
                        
                       
                          
                         
                           
                             j 
                              
                             
                                 
                             
                              
                             p 
                              
                             
                                 
                             
                              
                             
                               φ 
                               
                                 i 
                                 , 
                                 u 
                               
                             
                           
                           N 
                         
                       
                        
                       
                         x 
                         
                           i 
                           , 
                           u 
                         
                       
                     
                     + 
                     
                       
                         
                           
                             ∑ 
                             
                               
                                 l 
                                 = 
                                 1 
                               
                               
                                 l 
                                 ≠ 
                                 u 
                               
                             
                             
                               N 
                               T 
                             
                           
                            
                           
                               
                           
                            
                           
                             
                               h 
                               
                                 i 
                                 , 
                                 l 
                               
                               m 
                             
                              
                             
                                
                               
                                 
                                   j 
                                    
                                   
                                       
                                   
                                    
                                   p 
                                    
                                   
                                       
                                   
                                    
                                   
                                     φ 
                                     
                                       i 
                                       , 
                                       l 
                                     
                                   
                                 
                                 N 
                               
                             
                              
                             
                               x 
                               
                                 i 
                                 , 
                                 l 
                               
                             
                           
                         
                         + 
                         
                           
                             ∑ 
                             
                               
                                 
                                   ∀ 
                                   k 
                                 
                                 , 
                                 l 
                               
                               
                                 k 
                                 ≠ 
                                 i 
                               
                             
                           
                            
                           
                               
                           
                            
                           
                             
                               h 
                               
                                 k 
                                 , 
                                 l 
                               
                               m 
                             
                              
                             
                                
                               
                                 
                                   j 
                                    
                                   
                                       
                                   
                                    
                                   p 
                                    
                                   
                                       
                                   
                                    
                                   
                                     φ 
                                     
                                       k 
                                       , 
                                       l 
                                     
                                   
                                 
                                 N 
                               
                             
                              
                             
                               x 
                               
                                 k 
                                 , 
                                 l 
                               
                             
                           
                         
                         + 
                         n 
                       
                       
                          
                         
                           z 
                           
                             i 
                             , 
                             u 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   11 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where p is the discrete time index pε(0, . . . , n−1). The random phase is defined in the range 0≦Φ≦2π/9 having i.i.d. properties for all base stations and transmit elements in the environment. 
         [0054]    With these parameters, the evaluation for the achievable MSE is conducted again resulting in the performance given below.  FIG. 6(   a ) indicates the achievable MSE in case of time variant channel conditions. It turns out that all estimation errors may converge to almost the same value, i.e. ≈20 dB, for the maximum correlation length n=16. The estimation error of the strongest signal may even increase from correlation length n=8 to n=16. In this case, the error due to the phase rotation prevails the estimator gain. The loss in the normalized MSE compared to static channel conditions is given in  FIG. 6(   b ). Again it turns out, that the estimation error basically increases for those channels with lowest MSE from the static case. 
         [0055]    For cells a, b it is assumed a         b, if each base station a 1  has a correspondent base station b 1 , whereas a mobile terminal placed in a measuring a 1  can expect the same channel estimation error like a mobile terminal placed in b measuring b 1 . The error depends on the distances and pilot sequences of all base stations. More precisely, a         b is assumed, if there exists an bijective map f ab  C×C→C×C, where C is the infinite set of cells. For arbitrary a 1 , a 2  with f ab (a 1 ,a 2 )=(b i ,b 2 ) the map must have the following properties: The distance between a, a 1  is equal to b, b 1 . The same holds for a, a 2  and b, b 2 . Also both pairs of pilot sequences assigned to a 1 , a 2  and b 1 , b 2  have the same orthogonality property (true/false) after a correlation length of 2, 4, 8 and 16. In other words, each pair a 1 , a 1  has a corespondent pair b 1 , b 2  with the same distance and sequence (orthogonality) property. Regarding to the suggested scheme the following bijective map for any a, bεC is defined: 
         [0000]        f   ab ( a ⊕( r   1   ,d   1 ), a ⊕( r   2   ,d   2 ))=( b ⊕( r   1   ,d   1 ), b ⊕( r   2   ,d   2 )),
 
         [0000]    where r 1 , d 1 , r 2 , d 2  are arbitrary integer numbers, c⊕(r,d) defines a new cell going r steps right and d steps down right along the hexagonal grid. The above mentioned distance property is thus fulfilled. 
         [0056]    After all, the suggested scheme uses a specific cell planning for the sequences by which pilots of different sites are scrambled. According to the described embodiment, the highest order of orthogonality, i.e. the shortest correlation length, is used for the adjacent cells. As a result, it is possible to estimate the channels of the interferers separately which are most likely also the strongest interfering (average) Node-Bs. Node-Bs which are more distant from the terminal are orthogonal only if a longer correlation window is used. As shown in  FIG. 3  by example, sectors  1 ,  2 ,  3  are already orthogonal in the standard, wherein it is assumed that the interior cell (marked as  0 ) has the all-ones sequence. 
         [0057]    The longer the correlation window, i.e. the time period for the channel estimation corresponding to the effective sequence length, the more distant Node-B channels may be estimated independently. The suggested pilot sequence pattern is scalable over time. 
         [0058]    The scheme can be easily extended to larger sequence and correlation lengths. The maximum sequence length should be 170 in LTE. 
         [0059]    With the suggested scheme, mobility-dependent interference suppression becomes possible. A highly mobile terminal has a channel which varies quickly over time. In this case, only the nearest interferes can be identified. At lower speed, a longer correlation window becomes possible, and more interferes can be estimated. In this way, the performance of slow terminals can be optimized, but also the fast terminals can benefit from the interference suppression. As a result of interference suppression for slow terminals, these terminals have higher spectral efficiency and thus occupy less resources, which can in turn be redistributed to high-speed terminals. 
         [0060]    The above described system may be implemented by computer software or by computer hardware or by a combination of computer software and hardware, preferably in the memory and processor of the base stations and the mobile terminal(s). 
         [0061]    Finally, it should be noted that the above described embodiment is of an example for implementing the present invention, but the scope of the present invention should not necessarily be limited by the above description. The scope of the present invention is defined by the following claims.