# Patent

## Title
Method and apparatus for channel predicting

## Abstract

The present invention discloses a channel predicting method and apparatus in a communication network comprising a time-varying wireless channel. The channel predicting method comprising: determining a prediction strategy; selecting a certain number of channel samples from candidate channel samples each corresponding to one symbol in time domain in accordance with the prediction strategy; determining prediction weights in accordance with the prediction strategy and statistical properties of the time-varying wireless channel; and weighting the selected channel samples with the determined prediction weights to obtain a predicting channel sample as a prediction result.

## Background
TECHNICAL FIELD
The present invention relates to communication technology, and more particularly, to a method and apparatus for channel predicting in a communication network.
BACKGROUND
Currently, channel prediction that utilizes previous channel samples to obtain up-to-date channel in the presence of time variation is attracting enormous research effort and has become one of the key features in wireless communication system design.
SUMMARY
The present invention proposes a method and apparatus for channel predicting in a communication network.
In an aspect of the invention, there is provided a channel predicting method in a communication network comprising a time-varying wireless channel, the method comprising: determining a prediction strategy; selecting a certain number of channel samples from candidate channel samples each corresponding to one symbol in time domain in accordance with the prediction strategy; determining prediction weights in accordance with the prediction strategy and statistical properties of the time-varying wireless channel; and weighting the selected channel samples with the determined prediction weights to obtain a predicting channel sample as a prediction result.
In another aspect of the invention, there is proposed a channel predicting apparatus in a communication network comprising a time-varying wireless channel, the apparatus comprising: a prediction strategy determination unit configured to determine a prediction strategy; a first selection unit configured to select a certain number of channel samples from candidate channel samples each corresponding to one symbol in time domain in accordance with the prediction strategy; a prediction weights determination unit configured to determine prediction weights in accordance with the prediction strategy and statistical properties of the time-varying wireless channel; and a weighting unit configured to weight the selected channel samples with the determined prediction weights to obtain a predicting channel sample as a prediction result.



BRIEF DESCRIPTION OF THE DRAWINGS
The above and other objects, features and advantages of the present invention will be clearer from the following detailed description about the non-limited embodiments of the present invention taken in conjunction with the accompanied drawings, in which:
FIG. 1 is a block diagram of the general structure for the conventional adaptive channel predictor;
FIG. 2 is a block diagram of the general structure for the conventional empirical channel predictor;
FIG. 3 is a block diagram of a channel predicting apparatus according to an embodiment of the present application;
FIG. 4 is a diagram illustrating the prediction strategy;
FIG. 5 is a block diagram of a typical AR channel predictor in an OFDM communication system;
FIG. 6 is a diagram illustrating a symbol-by-symbol prediction scheme according to an embodiment of the present application;
FIG. 7 is a diagram illustrating an of the symbol-by-symbol prediction scheme implemented in a block based transmission;
FIG. 8 is a trellis diagram for the symbol-by-symbol prediction scheme according to the embodiment of the present application;
FIG. 9 is a diagram illustrating an example of the prediction data scheme for the proposed channel predictor in TDD;
FIG. 10 is a diagram illustrating an example of the prediction data scheme for the proposed channel predictor in FDD;
FIG. 11 is a diagram illustrating the modified Viterbi algorithm according to an embodiment of the present application;
FIG. 12 is a diagram illustrating the LPE algorithm according to an embodiment of the present application;
FIG. 13 is a flowchart illustrating a channel predicting method according to an embodiment of the present invention;
FIG. 14 is a diagram illustrating process of a symbol-by-symbol trellis AR channel predictor according to an embodiment of the present application;
FIGS. 15-32 show simulation results in TDD/FDD LTE under Various Scenarios and Velocities.



DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
In the following detailed description, reference is made to the accompanying drawings, which form a part thereof. In the following description, some embodiments are used for the purpose of description only, which shall not be understood as any limitation to the present application but the examples thereof. While it may blur the understanding of the present invention, the conventional structure or construction will be omitted.
Various mathematical models have been introduced in channel prediction in order to fit the variation in the time-varying wireless channel. In the sense of linearity, these mathematical models can be divided into 2 types: linear model and nonlinear model. The most commonly used model in linear channel prediction is auto-regression (AR) model, within which previous channel samples are used as input samples and endowed with different weights according to their respective relevance to the predicting one. Prediction weights can be adjusted adaptively, using Normalized Least Mean Square (NLMS) algorithm, Recursive Least Square (RLS) algorithm, or their variations (References [1]-[4]). In stream based transmission, the adjustment is performed continuously based on consecutive channel samples always known in the date stream. In block base transmission, the adjustment is performed pseudo-continuously based on consecutive channel samples only known in the training period so that the resulted model could fit the channel variation and thus be used to predict the following channels. A conventional adaptive channel predicting method is portrayed in FIG. 1.
As an alternative, prediction weights can also be obtained from channel correlations. The most straightforward approach is to analyze channel correlations empirically (References [5]-[6]). In another word, the correlations are summarized and calculated through the time-average of large amount of channel samples. In consequence, the prediction model that could fit the channel variation is obtained. A general structure for a typical empirical channel predictor is illustrated in FIG. 2.
On the other hand, nonlinear channel prediction adopts models like Projection Approximation Subspace Tracking (PAST) (Reference [7]), Neural Networks (NNs) (Reference [8]), Support Vector Machine (SVM) (Reference [9]) and so on.
The nonlinear channel prediction methods mentioned above contain very complicated operations and processes, and thus cause great challenge to practical feasibility. On the other hand, the AR model is rather easy to implement, while possessing excellent fitting effect as well as long fitting range. These obvious advantages over the nonlinear models lead to the fact that most existing solutions to channel prediction select the AR model as their prediction models. For this reason, embodiments of the present application will mainly be concentrated on the channel prediction related to the AR model.
In most communication systems, data signals or data streams are divided into data blocks for the sake of convenient storing, processing and transmitting. Different data symbols within any data block possess different positions, named the positional diversity, which causes that their respective relevance to the already known channel samples may be different. The existing channel predictors, however, fail to make use of this positional diversity of the block based data structures. This often leads to some problems such as the failure to achieve the anticipated prediction performance, or the occurrence of significant prediction performance degradation on certain data symbols, and thus weaken the corresponding prediction effect in practical communication systems.
As for the existing adaptive channel predictor, several notable disadvantages that greatly constraint its usage are illustrated as follows:

    1. As can be seen in FIG. 1, the training stage is mandatory for the acquisition of model weights that could fit the channel variation. The training stage in the existing system increases both system complexity and processing latency;
    2. Prediction weights need very long adjustment to achieve convergence. Otherwise, they are easily outdated and cannot catch up with the time variation. Apparently, the long adjustment needs large amount of consecutive channel samples, which can be readily satisfied in the block based transmissions with abundant acquisition of consecutive data blocks, while it is almost impossible where only a few consecutive data blocks can be obtained. Example for the former is the frequency division duplex (FDD) communication system, and the example for the latter is the time division duplex (TDD) communication system;
    3. The adaptive channel predictor is merely a short range adaptation to the time variation and may not be applicable in a long range statistical sense. Consequently, provided that the prediction weights are not given sustained adjustments, the prediction error may increase notably as the prediction continues, even if the weights are obtained from an adequate training stage.


As for the existing empirical channel predictor, several notable disadvantages that greatly constraint its usage are illustrated as follows:

    1. Very large amount of channel samples need to be stored in memory in order to analyze the channel correlations, which lead to great memory occupation, large processing load and latency;
    2. Channel correlations are obtained using time-average and need to be updated periodically in order to catch up with the channel variation. Considerable increase in processing load and decrease in effective prediction duration then come about;
    3. The prediction performance is not so attractive compared to other linear channel predictors.


In order to overcome at least one of the mentioned weaknesses of the existing solutions, an embodiment of the present application proposes a channel predicting apparatus in a communication network.
FIG. 3 is a block diagram of the channel predicting apparatus 300 according to an embodiment of the present invention. The apparatus 300 operates in a communication network comprising a time-varying wireless channel. In this context, the apparatus 300 can be any node in the network which is capable of channel predicting, such as but not limited to a base station or a mobile station.
As shown, the apparatus 300 comprises a prediction strategy determination unit 310, a first selection unit 320, a prediction weights determination unit 330, and a weighting unit 340. It can be appreciated by those skilled in the art that the apparatus 300 may further comprise other units/components necessary for the operation of the apparatus, whose description is omitted here so as not to obscure the concept of the present invention. Also, each of the units 310 to 340 can be implemented in hardware, firmware or software, i.e., by a dedicated circuit component or by an appropriately programmed processor.
The prediction strategy determination unit 310 is configured to determine a prediction strategy.
The first selection unit 320 is configured to select a certain number of channel samples from candidate channel samples each corresponding to one symbol in time domain in accordance with the prediction strategy.
The prediction weights determination unit 330 is configured to determine prediction weights in accordance with the prediction strategy and statistical properties of the time-varying wireless channel.
The weighting unit 340 is configured to weight the selected channel samples with the determined prediction weights to obtain a predicting channel sample as a prediction result.
According to the embodiment of the present application, the prediction accuracy and range may be improved with compared to the existing solutions.
In the present application, “symbol” denotes one symbol in time domain, to which each channel sample corresponds. Channel sample on each symbol can be a vector, with the dimension being the number of different frequencies. Under this circumstance, both time and frequency correlation can be utilized. Alternatively, channel sample on each symbol can also be a scalar. Under this circumstance, only the time correlation will be utilized.
Furthermore, as illustrated in FIG. 4, channel samples may be divided into two categories:

    1. The predicting channel samples, which are to be predicted by channel prediction and can be also called as unknown channel samples; and
    2. The candidate channel samples, which denote a pool of channel samples, from which the selected channel samples (also called as the obtained channel samples) come, and which can also be called as known channel samples.


By way of a non-limiting example, the candidate channel samples may comprise previously predicted channel samples.
With FIG. 3 in mind, and by way of non-limiting examples, the operations and functions of the respective units in the apparatus 300 will be further detailed.
First of all, in order to facilitate understanding following description of the present disclosure the principle of a typical AR channel predictor will by described with reference to FIG. 5.
As shown in FIG. 5, the AR channel predictor obtains the predicting channel samples from the sum of the selected channel samples which are weighted according to their respective relevance to the predicting one:




  
    
      
        
          
            
              H
              ^
            
            n
          
          =
          
            
              ∑
              m
            
            ⁢
            
              
                W
                m
              
              ⁢
              
                
                  H
                  ~
                
                
                  n
                  -
                  m
                
              
            
          
        
        ,
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          1
          )
        
      
    
  




where input channel samples {tilde over (H)}n−m, are the previously estimated channel vector samples, each of which consists of the estimated channel frequency responses {tilde over (H)}k,n−m,k=1, 2, . . . , K on K separate sub-carriers:

{tilde over (H)}k,n−m=Hk,n−m+Ñk,n−m  Eq. (2).

Here, Ñk,n−m denotes the estimation noise on the kth subcarrier of the (n−m)th OFDM symbol. It is a wide-sense random variable and satisfies Ñk,n−m ̃N(0,σe2).
Three other parameters are introduced into the above AR model, in order to facilitate the later illustration of the symbol-by-symbol and the consequent trellis prediction scheme.
M denotes the number of the selected channel samples, I denotes the distance between two contiguously selected channel samples in the candidate channel samples, and P denotes the distance between the predicting channel sample and the selected channel sample that is closest to the predicting channel sample, as shown in FIG. 4.
The modified AR channel predictor with prediction strategy (M,I,P) can be then obtained as:




  
    
      
        
          
            H
            ^
          
          
            n
            +
            
              P
              ⁢
              
                
              
              ⁢
              I
            
          
        
        =
        
          
            ∑
            
              m
              =
              0
            
            
              M
              -
              1
            
          
          ⁢
          
            
              W
              
                m
                ⁢
                
                  
                
                ⁢
                I
              
            
            ⁢
            
              
                
                  H
                  ~
                
                
                  n
                  -
                  
                    m
                    ⁢
                    
                      
                    
                    ⁢
                    I
                  
                
              
              .
            
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          3
          )
        
      
    
  




Under MMSE criterion, the target of the prediction is to minimize the prediction error defined as follows:

εn+PIE{∥Hn+PI−Ĥn+PI∥22}  Eq. (4).

The optimal model weights




  
    
      (
      
        
          W
          0
        
        ,
        
          W
          I
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          W
          
            
              (
              
                M
                -
                1
              
              )
            
            ⁢
            I
          
        
      
      )
    
    opt
  
  =
  
    
      argmin
      
        (
        
          
            W
            0
          
          ,
          
            W
            I
          
          ,
          ...
          ⁢
          
            
          
          ,
          
            W
            
              
                (
                
                  M
                  -
                  1
                
                )
              
              ⁢
              I
            
          
        
        )
      
    
    ⁢
    
      ɛ
      
        n
        +
        
          P
          ⁢
          
            
          
          ⁢
          I
        
      
    
  




that represent the relevance between the selected channel samples and the predicting ones, can be derived using orthogonal principle (Reference [10]) for m=0, 1, . . . m−1:

E{(Hn+PI−Ĥn+PI){tilde over (H)}n−mI}=0  Eq. (5),

and thus yields the Wiener-Hopf equation:





  
    
      
        
          E
          ⁢
          
            {
            
              
                H
                
                  n
                  +
                  
                    P
                    ⁢
                    
                      
                    
                    ⁢
                    I
                  
                
              
              ⁢
              
                H
                
                  n
                  -
                  
                    m
                    ⁢
                    
                      
                    
                    ⁢
                    I
                  
                
                H
              
            
            }
          
        
        =
        
          
            ∑
            
              
                m
                ′
              
              =
              0
            
            
              M
              -
              1
            
          
          ⁢
          
            
              
                W
                
                  
                    m
                    ′
                  
                  ⁢
                  I
                
              
              ⁡
              
                (
                
                  
                    E
                    ⁢
                    
                      {
                      
                        
                          H
                          
                            n
                            -
                            
                              
                                m
                                ′
                              
                              ⁢
                              I
                            
                          
                        
                        ⁢
                        
                          H
                          
                            n
                            -
                            
                              m
                              ⁢
                              
                                
                              
                              ⁢
                              I
                            
                          
                          H
                        
                      
                      }
                    
                  
                  +
                  
                    E
                    ⁢
                    
                      {
                      
                        
                          
                            N
                            ~
                          
                          
                            n
                            -
                            
                              
                                m
                                ′
                              
                              ⁢
                              I
                            
                          
                        
                        ⁢
                        
                          
                            N
                            ~
                          
                          
                            n
                            -
                            
                              m
                              ⁢
                              
                                
                              
                              ⁢
                              I
                            
                          
                          H
                        
                      
                      }
                    
                  
                
                )
              
            
            .
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          6
          )
        
      
    
  




The corresponding matrix form of the above equation can be derived as:




  
    
      
        
          
            (
            
              
                W
                0
              
              ,
              
                W
                I
              
              ,
              ...
              ⁢
              
                
              
              ,
              
                W
                
                  
                    (
                    
                      M
                      -
                      1
                    
                    )
                  
                  ⁢
                  I
                
              
            
            )
          
          =
          
            
              (
              
                
                  R
                  
                    P
                    ⁢
                    
                      
                    
                    ⁢
                    I
                  
                
                ,
                
                  R
                  
                    
                      (
                      
                        P
                        +
                        1
                      
                      )
                    
                    ⁢
                    I
                  
                
                ,
                ...
                ⁢
                
                  
                
                ,
                
                  R
                  
                    
                      (
                      
                        P
                        +
                        M
                        -
                        1
                      
                      )
                    
                    ⁢
                    I
                  
                
              
              )
            
            ⁢
            
              (
              
                
                  
                    
                      
                        R
                        0
                      
                      +
                      
                        σ
                        e
                        2
                      
                    
                  
                  
                    
                      R
                      I
                    
                  
                  
                    ...
                  
                  
                    
                      R
                      
                        
                          (
                          
                            M
                            -
                            1
                          
                          )
                        
                        ⁢
                        I
                      
                    
                  
                
                
                  
                    
                      R
                      I
                    
                  
                  
                    
                      
                        R
                        0
                      
                      +
                      
                        σ
                        e
                        2
                      
                    
                  
                  
                    ...
                  
                  
                    
                      R
                      
                        
                          (
                          
                            M
                            -
                            2
                          
                          )
                        
                        ⁢
                        I
                      
                    
                  
                
                
                  
                    ⋮
                  
                  
                    ⋮
                  
                  
                    ⋱
                  
                  
                    ⋮
                  
                
                
                  
                    
                      R
                      
                        
                          (
                          
                            M
                            -
                            1
                          
                          )
                        
                        ⁢
                        I
                      
                    
                  
                  
                    
                      R
                      
                        
                          (
                          
                            M
                            -
                            2
                          
                          )
                        
                        ⁢
                        I
                      
                    
                  
                  
                    ...
                  
                  
                    
                      
                        R
                        0
                      
                      +
                      
                        σ
                        e
                        2
                      
                    
                  
                
              
              )
            
          
        
        ,
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          7
          )
        
      
    
  




and a more compact form can thus be achieved as:

W=Π(R+σe2I)−1  Eq. (8)

by introducing the identity matrix IεCKM×KM, the Toeplitz correlation matrix RmlE{HnHn−mlH}εCK×K, the model weights matrix W(W0, W1, . . . , W(M−1)I)εCK×KM, the correlation matrix Π(RPI, R(P+1)I, . . . , R(P+M−1)I)εCK×KM, and the block Toeplitz correlation matrix RεCKM×KM with first block row (R0, R1, . . . , R(M−1)I).

The model weights matrix w obtained from Eq. (8) depends solely on the correlation matrices RmI for m=0, 1, . . . M−1 and the estimation noise energy σe2.
[Operations and Functions of the Prediction Weights Determination Unit 330]
In this embodiment, the prediction weights determination unit 330 determines prediction weights in accordance with the prediction strategy determined by the prediction strategy determination unit 310 and statistical properties of the time-varying wireless channel.
By way of a non-limiting example, the prediction weights determination unit 330 may comprise: a first calculation unit (not shown) configured to calculate prediction weights corresponding to all possible prediction strategies based on the statistical properties in advance; and a second selection unit (not shown) configured to select a prediction weight corresponding to the determined prediction strategy.
By way of another non-limiting example, the prediction weights determination unit 330 may comprise a second calculation unit (not shown) configured to calculate the prediction weights based on the statistical properties in accordance with the determined prediction strategy.
By way of a non-limiting example, the statistical properties of the time-varying wireless channel mainly include spaced-frequency spaced-time correlations (Reference [11]). By way of a non-limiting example, the spaced-frequency spaced-time correlations are mainly based on a delay power spectrum and a spaced-time correlation function of the time-varying wireless channel.
In understanding calculation of the prediction weights according to the embodiment of the present application in more detail, it is helpful to present derivation of the weights based on the spaced-frequency spaced-time correlations.
Most practical wireless channels can be modeled as a random Rayleigh fading channel satisfying the wide-sense stationary uncorrelated scattering (WSSUS) assumption (Reference [12]). The following derivation will be under such an assumption, but not limited to this.
Under the WSSUS assumption, the autocorrelation function of the time-varying impulse response of this channel satisfies:

E{h(τ1,t1)h*(τ2,t2)}=√{square root over (rh(τ1)rh(τ2))}{square root over (rh(τ1)rh(τ2))}rh(t1,t2)δ(τ1−τ2)  Eq. (9)

where h(τ,t) is the impulse response of the channel on delay τ at time t, rh(τ) is the delay power spectrum of the channel defined as:

rh(τ)rh(τ;0)=E{h(τ,t)h*(τ,t)}  Eq. (10),

and rh(t1,t2) is the spaced-time correlation function defined as:

rh(t1,t2)rh(0;t1,t2)=E{h(τ,t1)h*(τ,t2)}  Eq. (11).

The spaced-frequency spaced-time correlations function (Reference [11]) of the channel can be subsequently derived as:




  
    
      
        
          E
          ⁢
          
            {
            
              
                H
                ⁡
                
                  (
                  
                    
                      f
                      1
                    
                    ,
                    
                      t
                      1
                    
                  
                  )
                
              
              ⁢
              
                
                  H
                  *
                
                ⁡
                
                  (
                  
                    
                      f
                      2
                    
                    ,
                    
                      t
                      2
                    
                  
                  )
                
              
            
            }
          
        
        =
        
          
            E
            ⁢
            
              {
              
                
                  ∫
                  0
                  
                    τ
                    
                      1
                      ,
                      max
                    
                  
                
                ⁢
                
                  
                    h
                    ⁡
                    
                      (
                      
                        
                          τ
                          1
                        
                        ,
                        
                          t
                          1
                        
                      
                      )
                    
                  
                  ⁢
                  
                    e
                    
                      
                        -
                        j2π
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        f
                        1
                      
                      ⁢
                      
                        τ
                        1
                      
                    
                  
                  ⁢
                  
                    d
                    
                      
                        
                          τ
                          1
                        
                        ⁡
                        
                          (
                          
                            
                              ∫
                              0
                              
                                τ
                                
                                  2
                                  ,
                                  max
                                
                              
                            
                            ⁢
                            
                              
                                h
                                ⁡
                                
                                  (
                                  
                                    
                                      τ
                                      2
                                    
                                    ,
                                    
                                      t
                                      2
                                    
                                  
                                  )
                                
                              
                              ⁢
                              
                                e
                                
                                  
                                    -
                                    j2π
                                  
                                  ⁢
                                  
                                    
                                  
                                  ⁢
                                  
                                    f
                                    2
                                  
                                  ⁢
                                  
                                    τ
                                    2
                                  
                                
                              
                              ⁢
                              
                                d
                                
                                  τ
                                  2
                                
                              
                            
                          
                          )
                        
                      
                      *
                    
                  
                
              
              }
            
          
          =
          
            
              
                r
                h
              
              ⁡
              
                (
                
                  
                    t
                    1
                  
                  ,
                  
                    t
                    2
                  
                
                )
              
            
            ⁢
            
              
                ∫
                0
                
                  τ
                  max
                
              
              ⁢
              
                
                  
                    r
                    h
                  
                  ⁡
                  
                    (
                    τ
                    )
                  
                
                ⁢
                
                  e
                  
                    
                      -
                      
                        j2π
                        ⁡
                        
                          (
                          
                            
                              f
                              1
                            
                            -
                            
                              f
                              2
                            
                          
                          )
                        
                      
                    
                    ⁢
                    τ
                  
                
                ⁢
                
                  
                    d
                    τ
                  
                  .
                
              
            
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          12
          )
        
      
    
  




Here, H(f,t) is the frequency response of the channel on frequency f at time t, and τmax denotes the maximal channel delay. With T representing the duration of one OFDM symbol and Δf representing the interval between two adjacent subcarriers, the discrete-time equivalence of the above continuous-time spaced-frequency spaced-time correlations function can be achieved as:




  
    
      
        
          E
          ⁢
          
            {
            
              
                H
                ⁡
                
                  [
                  
                    
                      k
                      1
                    
                    ,
                    
                      n
                      1
                    
                  
                  ]
                
              
              ⁢
              
                
                  H
                  *
                
                ⁡
                
                  [
                  
                    
                      k
                      2
                    
                    ,
                    
                      n
                      2
                    
                  
                  ]
                
              
            
            }
          
        
        =
        
          
            
              E
              ⁢
              
                {
                
                  
                    H
                    ⁡
                    
                      (
                      
                        
                          f
                          1
                        
                        ,
                        
                          t
                          1
                        
                      
                      )
                    
                  
                  ⁢
                  
                    
                      H
                      *
                    
                    ⁡
                    
                      (
                      
                        
                          f
                          2
                        
                        ,
                        
                          t
                          2
                        
                      
                      )
                    
                  
                
                }
              
            
            ⁢
            
              |
              
                
                  
                    f
                    1
                  
                  =
                  
                    
                      k
                      1
                    
                    ⁢
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    f
                  
                
                ,
                
                  
                    f
                    2
                  
                  =
                  
                    
                      k
                      2
                    
                    ⁢
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    f
                  
                
                ,
                
                  
                    t
                    1
                  
                  =
                  
                    
                      n
                      1
                    
                    ⁢
                    T
                  
                
                ,
                
                  
                    t
                    2
                  
                  =
                  
                    
                      n
                      2
                    
                    ⁢
                    T
                  
                
              
            
          
          =
          
            
              
                r
                h
              
              ⁡
              
                (
                
                  
                    
                      n
                      1
                    
                    ⁢
                    T
                  
                  ,
                  
                    
                      n
                      2
                    
                    ⁢
                    T
                  
                
                )
              
            
            ⁢
            
              
                ∫
                0
                
                  τ
                  max
                
              
              ⁢
              
                
                  
                    r
                    h
                  
                  ⁡
                  
                    (
                    τ
                    )
                  
                
                ⁢
                
                  e
                  
                    
                      -
                      
                        j2π
                        ⁡
                        
                          (
                          
                            
                              k
                              1
                            
                            -
                            
                              k
                              2
                            
                          
                          )
                        
                      
                    
                    ⁢
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    f
                    ⁢
                    
                      
                    
                    ⁢
                    τ
                  
                
                ⁢
                
                  
                    d
                    τ
                  
                  .
                
              
            
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          13
          )
        
      
    
  




As can be seen in Eq. (13), both the delay power spectrum rh(τ) and the spaced-time correlation function rh(t1,t2) have important effects on the channel statistic, while they vary in different communication scenarios. Generally speaking, the delay power spectrum obeys the exponential distribution in most radio transmission media (Reference [13]):




  
    
      
        
          
            
              r
              h
            
            ⁡
            
              (
              τ
              )
            
          
          =
          
            
              e
              
                -
                
                  (
                  
                    τ
                    /
                    
                      τ
                      rms
                    
                  
                  )
                
              
            
            
              
                τ
                rms
              
              ⁡
              
                (
                
                  1
                  -
                  
                    e
                    
                      -
                      
                        (
                        
                          
                            τ
                            max
                          
                          /
                          
                            τ
                            rms
                          
                        
                        )
                      
                    
                  
                
                )
              
            
          
        
        ,
        
          0
          ≤
          τ
          ≤
          
            τ
            max
          
        
        ,
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          14
          )
        
      
    
  




with τrms denoting the mean delay spread of the channel in the specified scenario, and the spaced-time correlation function can be appropriately described using the zero-order Bessel function of the first kind (Reference [14]):

rh(t1,t2)=J0(2πfD|t1−t2|)  Eq. (15),

where fD denotes the maximal Doppler frequency, which may be expressed as:





  
    
      
        
          
            f
            D
          
          =
          
            
              v
              ⁢
              
                
              
              ⁢
              
                f
                c
              
            
            c
          
        
        ,
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          16
          )
        
      
    
  




with v as the velocity of the MS, fc as the carrier frequency and c as the velocity of the light.

As a result, the spaced-frequency spaced-time correlations function can be further derived as:




  
    
      
        
          E
          ⁢
          
            {
            
              
                H
                ⁡
                
                  [
                  
                    
                      k
                      1
                    
                    ,
                    
                      n
                      1
                    
                  
                  ]
                
              
              ⁢
              
                
                  H
                  *
                
                ⁡
                
                  [
                  
                    
                      k
                      2
                    
                    ,
                    
                      n
                      2
                    
                  
                  ]
                
              
            
            }
          
        
        =
        
          
            
              J
              0
            
            ⁡
            
              (
              
                2
                ⁢
                π
                ⁢
                
                  
                
                ⁢
                
                  f
                  D
                
                ⁢
                
                  
                  
                    
                      n
                      1
                    
                    -
                    
                      n
                      2
                    
                  
                  
                
                ⁢
                T
              
              )
            
          
          ⁢
          
            
              
                1
                -
                
                  e
                  
                    
                      -
                      
                        [
                        
                          1
                          +
                          
                            
                              j2π
                              ⁡
                              
                                (
                                
                                  
                                    k
                                    1
                                  
                                  -
                                  
                                    k
                                    2
                                  
                                
                                )
                              
                            
                            ⁢
                            Δ
                            ⁢
                            
                              
                            
                            ⁢
                            f
                            ⁢
                            
                              
                            
                            ⁢
                            
                              τ
                              rms
                            
                          
                        
                        ]
                      
                    
                    ⁢
                    
                      (
                      
                        
                          τ
                          max
                        
                        /
                        
                          τ
                          rms
                        
                      
                      )
                    
                  
                
              
              
                
                  (
                  
                    1
                    -
                    
                      e
                      
                        
                          -
                          
                            τ
                            max
                          
                        
                        /
                        
                          τ
                          rms
                        
                      
                    
                  
                  )
                
                ⁡
                
                  [
                  
                    1
                    +
                    
                      
                        j2π
                        ⁡
                        
                          (
                          
                            
                              k
                              1
                            
                            -
                            
                              k
                              2
                            
                          
                          )
                        
                      
                      ⁢
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      f
                      ⁢
                      
                        
                      
                      ⁢
                      
                        τ
                        rms
                      
                    
                  
                  ]
                
              
            
            .
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          17
          )
        
      
    
  




Consequently, the Toeplitz spaced-frequency spaced-time correlations matrix RmI, can be computed as




  
    
      
        
          
            R
            
              m
              ⁢
              
                
              
              ⁢
              I
            
          
          =
          
            
              E
              ⁢
              
                {
                
                  
                    H
                    n
                  
                  ⁢
                  
                    H
                    
                      n
                      -
                      
                        m
                        ⁢
                        
                          
                        
                        ⁢
                        I
                      
                    
                    H
                  
                
                }
              
            
            =
            
              (
              
                
                  
                    
                      E
                      ⁢
                      
                        {
                        
                          
                            H
                            ⁡
                            
                              [
                              
                                1
                                ,
                                n
                              
                              ]
                            
                          
                          ⁢
                          
                            
                              H
                              *
                            
                            ⁡
                            
                              [
                              
                                1
                                ,
                                
                                  n
                                  -
                                  
                                    m
                                    ⁢
                                    
                                      
                                    
                                    ⁢
                                    I
                                  
                                
                              
                              ]
                            
                          
                        
                        }
                      
                    
                  
                  
                    ...
                  
                  
                    
                      E
                      ⁢
                      
                        {
                        
                          
                            H
                            ⁡
                            
                              [
                              
                                1
                                ,
                                n
                              
                              ]
                            
                          
                          ⁢
                          
                            
                              H
                              *
                            
                            ⁡
                            
                              [
                              
                                K
                                ,
                                
                                  n
                                  -
                                  
                                    m
                                    ⁢
                                    
                                      
                                    
                                    ⁢
                                    I
                                  
                                
                              
                              ]
                            
                          
                        
                        }
                      
                    
                  
                
                
                  
                    ⋮
                  
                  
                    ⋱
                  
                  
                    ⋮
                  
                
                
                  
                    
                      E
                      ⁢
                      
                        {
                        
                          
                            H
                            ⁡
                            
                              [
                              
                                K
                                ,
                                n
                              
                              ]
                            
                          
                          ⁢
                          
                            
                              H
                              *
                            
                            ⁡
                            
                              [
                              
                                1
                                ,
                                
                                  n
                                  -
                                  
                                    m
                                    ⁢
                                    
                                      
                                    
                                    ⁢
                                    I
                                  
                                
                              
                              ]
                            
                          
                        
                        }
                      
                    
                  
                  
                    ...
                  
                  
                    
                      E
                      ⁢
                      
                        {
                        
                          
                            H
                            ⁡
                            
                              [
                              
                                K
                                ,
                                n
                              
                              ]
                            
                          
                          ⁢
                          
                            
                              H
                              *
                            
                            ⁡
                            
                              [
                              
                                K
                                ,
                                
                                  n
                                  -
                                  
                                    m
                                    ⁢
                                    
                                      
                                    
                                    ⁢
                                    I
                                  
                                
                              
                              ]
                            
                          
                        
                        }
                      
                    
                  
                
              
              )
            
          
        
        ,
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          18
          )
        
      
    
  




and finally, the model weights matrix W is analytically obtained using Eq. (8).

Thus, with the above derivation, one sees that the prediction weights may be calculated based on Eq. (18). By way of a non-limiting example, the prediction weights may be calculated by steps of: obtaining the maximal Doppler frequency by Eq. (16); obtaining the maximal channel delay from synchronization; obtaining the estimation noise energy from the conventional channel estimation process; obtaining the Toeplitz spaced-frequency spaced-time correlations matrix by using Eq. (18); and obtaining the weights matrix for the specified scenario by using Eq. (8).
[Operations and Functions of the Prediction Strategy Determination Unit 310]
By way of non-limiting, the channel prediction according to the present application may be performed symbol by symbol. Specifically, a symbol-by-symbol prediction scheme may be used in this embodiment. The general idea of the symbol-by-symbol prediction scheme is that the predictions of the predicting channel samples on different symbols within any data block are processed individually one by one. In details, a predicting channel sample on any symbol is given a prediction model with customized strategy according to its particular positional condition. For different symbols, the customized strategy may be different or same, depending on practical need. A predicted channel sample is thus produced and stored, which becomes a candidate channel sample for the predicting channel samples on the following symbols. The inclusion of this previously predicted channel sample as the candidate ones helps to shorten the distance between the predicting channel samples and the candidate ones, and may thus help to enhance prediction accuracy on the following symbols. An illustration of the symbol-by-symbol prediction scheme is shown in FIG. 6.
The predicting channel sample Ĥn is predicted with strategy (M1,I1,P1) and the corresponding channel samples selected from the candidate channel samples ( . . . , {tilde over (H)}n−3, {tilde over (H)}n−2, {tilde over (H)}n−1). Then, Ĥn is stored as a candidate channel sample for the following predicting channel samples such as Ĥn+1 and Ĥn+2. The next predicting channel sample {tilde over (H)}n+1 repeats the above process but with different strategy (M2,I2,P2) and corresponding channel samples selected from the updated candidate channel samples ( . . . , {tilde over (H)}n−3, {tilde over (H)}n−2, {tilde over (H)}n−1, Ĥn). This prediction process goes recursively for all the following predicting channel samples. Without confusion, the obtained channel samples {tilde over (H)} in the prediction model as presented in Eq. (3) may also contain the already predicted channel samples Ĥ. Thus, the prediction model in Eq. (3) can still apply without change.
The symbol-by-symbol prediction scheme is very easy to be implemented on the data structures of any practical block based transmission. A very simple example is depicted in FIG. 7.
In the example above, one strategy (M1,I1,P1) may be used in predicting ĤNsym+1, where Nsym previously predicted channel samples (Ĥ1, Ĥ2, . . . , ĤNsym) are utilized as the selected channel samples. On the other hand, a distinct strategy (M2, I2, P2) may be adopted in predicting ĤNsym+2, which takes three estimated channel samples ({tilde over (H)}1, {tilde over (H)}Nsym, {tilde over (H)}2Nsym−1) as the selected channel samples. Obviously, the respective model weights for the above two predicting channel samples could be totally different.
By way of a non-limiting example, the prediction strategy on each symbol may be different. That is, a different set of the selected channel samples may be used in each prediction.
The following is about how to determine prediction strategy for each predicting channel sample.
By way of a non-limiting example, the prediction strategy determination unit 310 may comprises a training unit (not shown), which is configured to train some previous channel samples of the candidate channel samples in terms of respective prediction errors to determine the prediction strategy. Alternatively, the prediction strategy determination unit 310 may have no training unit.
By way of a non-limiting example, a trellis searching scheme may be used in the training unit for determining the optimal strategy for each symbol.
During the trellis searching scheme, the prediction solution for current symbol is denoted as the prediction strategies set determined till the current symbol. Then the prediction solution for the next symbol depends merely on the prediction solution for the current one, which means that the process of the prediction solution determination can be modeled as a Markov Chain. Candidate strategies (Mi,Ii,Pi) for the nth symbol can be defined as a state Si,n, and apparently, the number of states Nn for each symbol is bounded. The change from state on current symbol to state on next symbol is through state transition, and the accumulative state transitions until the ith state of the nth symbol can be defined as path pi,n. As a result, the process of the prediction strategies determination for symbol-by-symbol prediction scheme can be described by a state trellis diagram shown in FIG. 8.
In FIG. 8, prediction with certain strategy on one symbol is represented by a state transition between two contiguous symbols. This transition yields a predicted channel sample on this symbol and thus a corresponding prediction error, which is called in another word a branch error since any transition is a branch of one path. The branch error for any branches on the nth symbol is defined as

brcErrn=∥Ĥn−Hn∥  Eq. (19).

A path is made up of transitions on all previous symbols, and thus owns an accumulative path error. The path error for any paths on the nth symbol is defined as




  
    
      
        
          pthErr
          n
        
        =
        
          
            ∑
            
              
                n
                ′
              
              =
              1
            
            n
          
          ⁢
          
            brc
            ⁢
            
              
            
            ⁢
            
              
                Err
                
                  n
                  ′
                
              
              .
            
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          20
          )
        
      
    
  




The target of the prediction is to find the path p={(M1,I1,P1), . . . , (MNprd,INprd,PNprd)} that has the minimal accumulative path error pthErrNprd along all Nprd symbols. This path searching is accomplished within the training stage, where predictions are performed on the candidate channel samples so that the average prediction error can be acquired and used as the branch error. Each state (M,I,P) contained in the selected path is then used as the prediction strategy for each symbol respectively in the following predicting stage.
It shall be noted that the trellis prediction scheme as noted above is not limited to the prediction strategy (M, I, P), but may be applied to various other prediction strategies.
Obviously, the solution proposed in the above may enhance the prediction accuracy, alleviate the inherent error propagation of the AR based predictor and hence acquire the optimal prediction strategy.
By way of a non-limiting example, under the circumstance of multiple data blocks, the branch error defined in Eq. (19) may be the average prediction error on all the nth symbols within different data blocks. In order to clarify this point, the detailed description will be provided with reference to FIG. 9.
FIG. 9 shows an example illustrating the prediction data scheme for the proposed channel predictor in a TDD LTE communication system, whose frame structure is “DSUUUDSUUU”. Here, a “D” box denotes a DL subframe, a “U” box denotes a UL subframe and an “S” box denotes a special subframe. The boxes with solid borders denote the subframes containing the estimated channel samples, while the boxes with dashed borders denote the subframes containing the predicting channel samples. In this example, the term “subframe” is equivalent to the term “data block” mentioned earlier, and each subframe contains several OFDM symbols.
By way of a non-limiting example, with the prediction data scheme as shown in FIG. 9, in the training stage in the training unit of the prediction strategy determination unit 310, the channel vector samples on the “pretending” predicting OFDM symbols, which are in fact the candidate channel samples, are predicted as if they are unknown. Their predicted values are then compared with their true values to obtain their respective prediction error. The prediction error for the predicted channel sample on the “pretending” predicting OFDM symbol with the absolute symbol index n (i.e., the symbol index in the scope of all subframes) is measured using Frobenius Norm as a non-limiting example.




  
    
      
        
          
            
              
                err
                
                  k
                  ,
                  n
                
              
              =
              
              ⁢
              
                
                  
                  
                    
                      
                        H
                        ^
                      
                      
                        k
                        ,
                        n
                      
                    
                    -
                    
                      H
                      
                        k
                        ,
                        n
                      
                    
                  
                  
                
                F
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                  
                    (
                    
                      
                        
                          
                            
                              
                                H
                                ^
                              
                              
                                11
                                ,
                                k
                                ,
                                n
                              
                            
                            -
                            
                              H
                              
                                11
                                ,
                                k
                                ,
                                n
                              
                            
                          
                        
                        
                          
                            
                              
                                H
                                ^
                              
                              
                                12
                                ,
                                k
                                ,
                                n
                              
                            
                            -
                            
                              H
                              
                                12
                                ,
                                k
                                ,
                                n
                              
                            
                          
                        
                      
                      
                        
                          
                            
                              
                                H
                                ^
                              
                              
                                21
                                ,
                                k
                                ,
                                n
                              
                            
                            -
                            
                              H
                              
                                21
                                ,
                                k
                                ,
                                n
                              
                            
                          
                        
                        
                          
                            
                              
                                H
                                ^
                              
                              
                                22
                                ,
                                k
                                ,
                                n
                              
                            
                            -
                            
                              H
                              
                                22
                                ,
                                k
                                ,
                                n
                              
                            
                          
                        
                      
                    
                    )
                  
                  
                
                F
              
            
          
        
        
          
            
              
                =
                
                ⁢
                
                  
                    
                      ∑
                      
                        r
                        =
                        1
                      
                      2
                    
                    ⁢
                    
                      
                        ∑
                        
                          t
                          =
                          1
                        
                        2
                      
                      ⁢
                      
                        
                          
                          
                            
                              
                                H
                                ^
                              
                              
                                rt
                                ,
                                k
                                ,
                                n
                              
                            
                            -
                            
                              H
                              
                                rt
                                ,
                                k
                                ,
                                n
                              
                            
                          
                          
                        
                        2
                      
                    
                  
                
              
              ,
              
                n
                =
                1
              
              ,
              2
              ,
              ...
              ⁢
              
                
              
              ,
            
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          21
          )
        
      
    
  




where k=1, 2, . . . , K denotes the index of each subcarrier, and Hrt,k,n denotes the corresponding channel sample on the single-input single-output (SISO) channel from the tth transmitting antenna to the rth receiving antenna. Here, the multi-antenna mode is assumed to be 2×2 MIMO. It will be appreciated by those skilled in the art that any other multi-antenna modes may be applied in the present application.

All channel vector samples on all “pretending” predicting OFDM symbols with the same relative symbol index within each subframe (i.e., the symbol index in the scope of each subframe) are predicted using the same prediction strategy because of their positional similarity. The average prediction error for the predicted channel vector samples on all “pretending” predicting OFDM symbols with the same relative symbol index s within each subframe can be defined as




  
    
      
        
          
            avr_err
            s
          
          =
          
            
              1
              
                
                  N
                  trn_sf
                
                ⁢
                K
              
            
            ⁢
            
              
                ∑
                
                  sf
                  =
                  1
                
                
                  N
                  trn_sf
                
              
              ⁢
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  K
                
                ⁢
                
                  err
                  
                    k
                    ,
                    
                      s
                      +
                      
                        
                          (
                          
                            sf
                            -
                            1
                          
                          )
                        
                        ⁢
                        
                          N
                          sym
                        
                      
                    
                  
                
              
            
          
        
        ,
        
          

        
        ⁢
        
          s
          =
          1
        
        ,
        2
        ,
        ...
        ⁢
        
          
        
        ,
        
          
            N
            sym
          
          .
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          22
          )
        
      
    
  




Here, Ntrn—sf denotes the total number of training subframes and equates to 2Ntrn—f in the above example, where Ntrn—f denotes the total number of training frames. Nsym denotes the number of OFDM symbols in one subframe. The average prediction error defined in Eq. (22) will be used in trellis searching scheme to obtain the optimal or sub-optimal prediction strategies set, which contains the prediction strategies for the prediction of channel vector sample on each OFDM symbol within every subframe.
In the weighting process (also called as predicting stage) of the weighting unit 340, channel vector samples on predicting OFDM symbols are predicted using the obtained prediction strategies according to their relative symbol index within each subframe. In the above example, the training stage contains Ntrn—f frames and the predicting stage contains Nprd—f frames.
FIG. 10 shows an example illustrating the prediction data scheme for the proposed channel predictor in a FDD LTE communication system. Here, a “S” box denotes a subframe. The similar handling as the above may be applied to the prediction data scheme as shown in FIG. 10.
As noted above, the proposed channel prediction may require fewer candidate channel samples for training than the existing ones, and achieve a better adaptation to the data structures and a broader versatility to the duplex mode (both TDD and FDD).
The following three specific ways may be used in the trellis searching (also called as trellis training) scheme.
1. Modified Viterbi Algorithm
Obviously, Viterbi algorithm can be modified to find the path that has the minimal accumulative prediction error, and hence to find the optimal prediction strategies set for all symbols. As can be seen in FIG. 8, at the nth symbol, Nn−1 paths pj,n−1, j=1, 2, . . . , Nn−1 with different previously predicted symbols but the same current prediction strategy (Mi,Ii,Pi) merge at state Si,n. Therefore, for each state at the nth symbol, Nn−1 branch error brcErrn can be obtained by using the AR channel predictor as described in the above. Nn−1 path error pthErrn, which is the sum of the current branch error brcErrn and the corresponding previous path error pthErrn−1, can be calculated. Then, the one path with the minimal path error is selected as the survival path for this state. The predicting, adding, comparing and selecting repeat for each state of this symbol so that Nn survival paths could be obtained for this symbol. The process goes recursively for each of the following symbols. Finally, among all NNprd survival paths pi,Nprd, i=1, 2, . . . , NNprd at the last symbol, the one with the minimal error is preserved and its path Popl={(M1,I1,P1), . . . , (MNprd,INprd,PNprd)} is selected as the optimal prediction strategies set for the symbol-by-symbol prediction scheme. The diagram for the modified Viterbi algorithm is depicted in FIG. 11. In FIG. 11, the symbol index denotes a relative symbol index within each data block or subframe.
2. Least Path Error Algorithm
Alternatively, a simplified version of the modified Viterbi algorithm, called the Least Path Error (LPE) algorithm, is developed to find the suboptimal prediction strategy for each symbol. The main difference from the modified Viterbi approach is that instead of preserving one survival path for every state at each symbol, the LPE approach preserves only one survival path at each symbol. At the nth symbol, each state has only one incoming path, and all of these incoming paths are from the same last survival path pn−1. Thus for each state, only one branch error brcErrn is obtained and only one path error pthErrn is then calculated. The one path with the minimal path error is selected as the survival path for this symbol. The process goes recursively for each of the following symbols. Finally, the only survival path psubopt={(M1,I1,P1), . . . , (MNprd,INprd,PNprd)} at the last symbol is selected as the suboptimal prediction strategies set for the symbol-by-symbol prediction scheme. The diagram for the LPE algorithm is depicted in FIG. 12. In FIG. 12, the symbol index denotes a relative symbol index within each data block or subframe.
This approach may not yield the optimal prediction strategies so it is suitable for applications whose requirements for prediction accuracy are not so demanding. In some scenarios of which the conditions are not severe, the prediction strategies selected by this suboptimal approach may come very close to or even surpass the ones selected by the above optimal modified Viterbi approach.
Obviously, the processing load of both the optimal and suboptimal approaches depends heavily on the number of states for each symbol, which indicates all the possible or the permitted candidate prediction strategies for that symbol. Thus, it is very flexible to adjust between the prediction performance and the processing load by restricting the candidate prediction strategies in different degrees.
3. Memory Increment Algorithm
In some circumstances, especially the low velocity and short memory cases, the prediction strategies could be pre-determined. Use of all candidate channel samples while keeping I=1 and P=1 is able to yield a satisfactory prediction performance that to some degree comes close to the suboptimal one. By way of a non-limiting example, I and P are fixed, and M is incremented symbol by symbol. In return, the training stage is not needed and thus the processing complexity is considerably reduced. Therefore, this approach is particularly suitable for system that is very sensitive to processing load but is not very strict with the prediction accuracy.
[Operations and Functions of the First Selection Unit 320]
For example, as illustrated in FIG. 4, with the prediction strategy determined by the prediction strategy determination unit 310, the first selection unit 320 may selects M channel samples from the candidate channel samples.
[Operations and Functions of the Weighting Unit 340]
By way of non-limiting examples, the weighting unit 340 may weight the M channel samples selected by the first selection unit 320 with the prediction weights determined by the prediction weights determination unit 330, and then the predicting channel sample will be finally obtained.
Reference is now made to FIG. 13, which is a flowchart illustrating a channel predicting method according to an embodiment of the present invention. The method 1300 can be carried out by any node in a network which is capable of channel predicting, such as but not limited to a base station or a mobile station.
The method starts from step S1310, where a prediction strategy is determined. After that, the method proceeds to step S1320, where a certain number of channel samples are selected from candidate channel samples each corresponding to one symbol in time domain in accordance with the prediction strategy. At step S1330, prediction weights are determined in accordance with the prediction strategy and statistical properties of the time-varying wireless channel. Finally, at step S1340, the selected channel samples are weighted with the determined prediction weights to obtain a predicting channel sample as a prediction result.
With FIG. 13 in mind, and by way of non-limiting examples, respective steps of the method 1300 will be further detailed with reference to FIG. 14, which illustrates an exemplary channel predicting process of the present application.
By way of a non-limiting example, FIG. 14 specifically shows a symbol-by-symbol trellis AR channel predictor with MMSE criterion according to the present application. The symbol-by-symbol trellis AR channel predictor with MMSE criterion is arranged to perform the following actions.
Action 1: Acquire Channel Samples {tilde over (H)}=({tilde over (H)}1, {tilde over (H)}2, . . . , {tilde over (H)}NImp) as Candidate Channel Samples.
In TDD communication system, use estimated receiving channel samples as the initial candidate channel samples to predict the following transmitting channel samples, based on the channel reciprocity of TDD communication systems.
In FDD communication systems, use estimated receiving channel samples as the initial candidate channel samples to predict the following receiving channel samples.
Action 2: Determine the Prediction Strategies Set popt in the Training Stage.
Use small portion of the consecutive candidate channel samples to determine the optimal prediction strategy for predicting channel sample on each symbol.
A. Modified Viterbi Algorithm


    1. For the first symbol, calculate prediction error for each state Si,1=(Mi,Ii,Pi) from the candidate channel samples;
    2. For each following symbol:
    
        1) Use Eq. (3) to calculate the corresponding predicting channel samples for each branch that merges at the state;
        2) Calculate the prediction errors for these branches and then obtain the corresponding path errors;
        3) Select the one with the minimal path error as the survival path for this state;
        4) Repeat the above three operations on each of the states at this symbol.
    
    
    3. For the last symbol, determine the minimal path error among all survival path errors and preserve the corresponding survival path popt.

B. Least Path Error Algorithm

    1. For the first symbol, calculate prediction error for each state Si,1=(Mi,Ii,Pi) from the estimated channel samples, and then select the one with the minimal prediction error as the survival path;
    2. For each following symbol:
    
        1) Use Eq. (3) to calculate the corresponding predicting channel sample for the only branch arrives at each state;
        2) Calculate the prediction errors for these branches and then obtain the corresponding path errors;
        3) Select the one with the minimal path error as the survival path for this symbol.
    
    
    3. For the last symbol, preserve the only survival path psubopt.

C. Memory Increment Algorithm



The searching stage is not needed any more, and the prediction strategy for the nth symbol is fixed to (Mn=Nsmp+n−1,In=1,Pn=1).
Action 3: Determine the Prediction Weights in Accordance with the Determined Prediction Strategy
By way of a non-limiting example, the action of determining the prediction weights may comprise: calculating prediction weights corresponding to all possible prediction strategies based on the statistical properties in advance; and selecting a prediction weight corresponding to the determined prediction strategy.
In understanding the calculation of model weights for all possible prediction strategies according to the embodiment of the present application in more detail, it is helpful to present the procedures of calculating model weights W=(W0, W1, . . . , W(M−1)I) for all possible (M,I,P) combinations in certain scenario.
Use the spaced-frequency spaced-time correlations of the wireless channel in any specified scenario to calculate the corresponding model weights.

    1. Obtain the maximal Doppler frequency fD using Eq. (16);
    2. Obtain the maximal channel delay τmax from synchronization;
    3. Obtain the estimation noise energy σe2 from channel estimation;
    4. Obtain the Toeplitz spaced-frequency spaced-time correlations matrix Rml using Eq. (18);
    5. Obtain the model weights matrix W for the specified scenario using Eq. (8).


By way of another non-limiting example, the action of determining the prediction weights may comprise calculating the prediction weights based on the statistical properties in accordance with the prediction strategy determined in Action 2. Here, the calculation of the prediction weights may also use Eq. (18).
Action 4: Continue Channel Prediction in the Predicting Stage Use Eq. (3) and the determined prediction strategies set to calculate predicting channels.
As follows are examples of the simulation results for prediction performance as achieved by the proposed channel predictor implemented on a base station in LTE. In order to conform to the specification, the term data block is replaced by subframe, and symbol denotes an OFDM symbol.
In the subsequent simulations, the adaptive channel predictor is used as a comparison and the delay channel predictor, which directly takes the estimated channel sample on the last symbol in the nearest obtained subframe as the prediction for all the predicting channel samples in the following subframes, is used as an indication of the channel variation.
The common system configuration is listed in Table 1.







TABLE 1





Common system configuration



















Channel Model
3GPP SCM
Central
2350
mHz



(TR
Modulation



25.996)
Carrier




Frequency


Antennae Mode
Tx: 2, Rx: 2
Subcarrier
15
kHz




Interval










FFT Length
2048
Cyclic Prefix
144











Subframe
14 symbols
Subframe Interval
1
ms


Structure









The configuration for the proposed channel predictor is listed in Table 2.







TABLE 2





Configuration for the proposed channel predictor


















Delay Power
Exponential
Mean Delay
0.1 μs in SMa,


Spectrum

Spread
0.98 μs in UMi,


Mode


2.53 μs in UMa


Searching
5% of total
Known Channel
28


Ratio
subframes
Samples


Sample
0.5 subframe
Prediction
0.5 subframe


Interval Bound

Horizon Bound









The configuration for the adaptive channel predictor is listed in Table 3.







TABLE 3







Configuration for the adaptive channel predictor











Algorithm
NLMS
RLS















Step Size
0.5
0.9



Memory
28
28



Length



Training
14 symbols each
14 symbols each



Period
subframe
subframe










FIG. 9 shows a prediction data scheme for the proposed channel predictor in TDD. In TDD LTE, the estimated channel samples in the uplink (UL) subframes are used as the candidate channel samples to predict channel samples in the following downlink (DL) subframes, based on the channel reciprocity. The frame structure for TDD is “DSUUUDSUUU”. As shown in FIG. 9, a “D” box denotes a DL subframe, a “U” box denotes a UL subframe and an “S” box denotes a special subframe.
FIG. 10 shows a prediction data scheme for the proposed channel predictor in FDD. In FDD LTE, the estimated channel samples in the received subframes are used as the candidate channels samples to predict channel samples in the following subframes. The prediction data scheme for the proposed channel predictor is illustrated in FIG. 10. Here, an “S” box denotes a subframe.
FIGS. 15 ̃32 illustrates performance evaluation of various proposed channel predictors (prediction)/various adaptive channel predictors and the delay channel predictor in TDD/FDD LTE under various scenarios and velocities.
In conclusion, with the above simulation results, one sees that compared to the existing solutions, the main advantages of the proposed invention are summarized as below:

    1. Some embodiments of the proposed channel predictor provide better prediction performance than the existing ones.
    
        1) The proposed channel predictor yields much better prediction accuracy than the existing ones;
        2) The proposed channel predictor provides much more resistance to the error propagation than the existing ones;
        3) The performance degradation over symbols is obviously alleviated compared to the existing ones;
        4) The proposed channel predictor represents a statistical adaptation and thus achieves much longer prediction range than the existing ones;
    
    
    2. Some embodiments of the proposed channel predictor need fewer candidate channel samples for training purpose than the existing ones.
    
        1) The proposed channel predictor needs only a few or even none of the candidate channel samples in training appropriate prediction strategies. Prediction model with the obtained strategies can maintain the adaptation to the channel variation for a long range;
        2) In contrast, the adaptive channel predictors demand sustained training, without which prediction performance degrades significantly;
        3) In contrast, the empirical channel predictors also need very large amount of channel samples in constructing model weights;
        4) Considerable memory occupation and processing latency are circumvented in the proposed channel predictor;
    
    
    3. Some embodiments of the proposed channel predictor are more versatile than the existing ones.
    
        1) The proposed channel predictor is able to yield superb prediction performance in both FDD and TDD communication systems;
        2) In contrast, the adaptive channel predictors demand large number of consecutive channel samples which are very hard or almost impossible to be acquired in TDD communication systems. Consequently, their usages in TDD communication systems are greatly constrained;
    
    
    4. Due to its intrinsic fitness for TDD communication systems, the proposed channel predictor can be implemented on the transmitter side by exploiting the channel reciprocity. Therefore, some very serious and well known problems introduced by the feedback link that transmits the predicted channel samples can be circumvented and the system robustness is then enhanced;
    5. Some embodiments of the proposed channel predictor are very flexible in implementation under various circumstances.
    
        1) The prediction mode, i.e., the configuration of the number of the estimated channel samples and the range of the prediction, can be adjusted according to the data structure employed by any specified communication system (e.g., the uplink-downlink configurations in TDD LTE);
        2) The requirement for processing load and performance can be readily adjusted and satisfied by restricting the candidate prediction strategies in different degrees or by adopting different trellis searching schemes.
    
    


It is to be understood that the embodiments of the invention can be embodied strictly as a software program, or as firmware, or as hardware and/or circuitry alone, or as configurations in other computing systems, or as any form of combination of them, such as within a base station, a mobile station or other node in the network.
The foregoing description gives only the preferred embodiments of the present invention and is not intended to limit the present invention in any way. Thus, any modification, substitution, improvement or like made within the spirit and principle of the present invention should be encompassed by the scope of the present invention.
Abbreviations


    AR—Auto-Regression
    BER—Bit Error Rate
    BS—Base Station
    CoMP—Coordinated Multipoint
    CSI—Channel State Information
    DL—Downlink
    FDD—Frequency Division Duplex
    FFT—Fast Fourier Transform
    LPE—Least Path Error
    LTE—Long Term Evolution
    MIMO—Multiple-Input Multiple-Output
    MMSE—Minimum Mean-Square Error
    MS—Mobile Station
    NLMS—Normalized Least Mean Square
    NNs—Neural Networks
    OFDM—Orthogonal Frequency Division Multiplexing
    PAST—Projection Approximation Subspace Tracking
    RLS—Recursive Least Square
    SISO—Single-Input Single-Output
    SMa—Suburban Macro
    SVM—Support Vector Machine
    SVD—Singular Value Decomposition
    TDD—Time Division Duplex
    UL—Uplink
    UMa—Urban Macro
    UMi—Urban Micro
    WSSUS—Wide-Sense Stationary Uncorrelated Scattering

Reference List

    [1] Gokhan Mergen, et al., “Method and apparatus for filtering noisy estimates to reduce estimation errors”, U.S. Pat. No. 7,746,970, 2010.
    [2] Chang kee Min, et al., “MIMO-OFDM Downlink Channel Prediction for IEEE802.16e Systems Using Kalman Filter”, IEEE WCNC, pages 942-946, 11-15 Mar. 2007.
    [3] Mehdi Seyfi, et al., “An LMS Like Predictive Estimation for Fading MIMO Channels”, PIMRC 2007.
    [4] Abdorreza HEIDARI, Amir K. KHANDANI, Derek MCAVOY, “Adaptive channel prediction system and method”, U.S. Patent 2008/0240260, 2008.
    [5] Hee-Soo Lee, et al., “Apparatus and method for generating channel information and apparatus and method for adaptive transmission employing the same”, U.S. Pat. No. 7,848,296, 2010.
    [6] Chan-soo Hwang, Yongin, “Signal receiving apparatus and method adapted for use with a time-variant channel”, U.S. Pat. No. 7,221,716, 2007.
    [7] Sharon Gannott, Amir Leshemt, Ofer Shayevitz, “Tracking a MIMO Channel Singular Value Decomposition via Projection Approximation”, IEEE 24th Convention of Electrical and Electronics Engineers in Israel, pages 91-94, November 2006.
    [8] G. Wolfle and F. M. Landstorfer, “Field Strength Prediction in Indoor Environments with Neural Networks”, 47th IEEE International Conference on Vehicular Technology (VTC), pages 82-86, May 1997.
    [9] Jiancheng Sun, “Nonlinear prediction of mobile-radio fading channel using recurrent least squares support vector machines and embedding phase space”, 2004 International Conference on Communications, Circuits and Systems, pages 282. 27-29, June 2004.
    [10] S. M. Kay, Fundamentals of Statistical Signal Processing: Estimation Theory, Englewood Cliffs, N.J.: Prentice-Hall, 1993.
    [11] J. G. Proakis, Digital Communications, 4th ed., New York: McGraw-Hill, 2000.
    [12] P. A. Bello, “Characterization of Randomly Time-Variant Linear Channels”, IEEE Trans. Commun., vol. CS-II, pages 360-393, December 1963.
    [13] COST 207, “Digital land mobile radio communications”, Office for Official Publications of the European Communities, Final Report, Luxembourg, 1989.
    [14] W. C. Jakes, Jr., Microwave Mobile Communications. New York: Wiley, 1974.

## Claims

1. A channel predicting method in a communication network comprising a time-varying wireless channel, the method comprising:
determining a prediction strategy;
selecting a certain number of channel samples from candidate channel samples in accordance with the prediction strategy, the channel samples each corresponding to one symbol in a time domain;
determining prediction weights in accordance with the prediction strategy and statistical properties of the time-varying wireless channel;
weighting the selected channel samples with the determined prediction weights to obtain a predicting channel sample as a prediction result.

2. The method of claim 1, wherein the candidate channel samples comprise previously predicted channel samples.

3. The method of claim 1, wherein the prediction strategy includes a triplet of three parameters (M, I, P), in which M denotes the number of the selected channel samples, I denotes a distance between two contiguously selected channel samples in the candidate channel samples, and P denotes a distance between the predicting channel sample and the selected channel sample that is closest to the predicting channel sample.

4. The method of claim 3, wherein I and P are fixed, and M is incremented symbol by symbol.

5. The method of claim 1, wherein the statistical properties of the time-varying wireless channel include spaced-frequency spaced-time correlations.

6. The method of claim 5, wherein the spaced-frequency spaced-time correlations are based on a delay power spectrum and a spaced-time correlation function of the time-varying wireless channel.

7. The method of claim 1, wherein the determining prediction weights comprises:
calculating prediction weights corresponding to all possible prediction strategies based on the statistical properties in advance;
selecting a prediction weight corresponding to the determined prediction strategy.

8. The method of claim 1, wherein the determining prediction weights comprises calculating the prediction weights based on the statistical properties in accordance with the determined prediction strategy.

9. The method of claim 1, wherein the determining a prediction strategy comprises training some previous channel samples of the candidate channel samples in terms of respective prediction errors to determine the prediction strategy.

10. The method of claim 9, wherein a Viterbi Algorithm is used in the training.

11. The method of claim 1, wherein the channel predicting method is performed symbol by symbol.

12. The method of claim 11, wherein the prediction strategy is different on each symbol.

13. An apparatus for channel predicting in a communication network comprising a time-varying wireless channel, the apparatus comprising:
a prediction strategy determination circuit configured to determine a prediction strategy;
a first selection circuit configured to select a certain number of channel samples from candidate channel samples in accordance with the prediction strategy, each channel sample corresponding to one symbol in a time domain;
a prediction weights determination circuit configured to determine prediction weights in accordance with the prediction strategy and statistical properties of the time-varying wireless channel;
a weighting circuit configured to weight the selected channel samples with the determined prediction weights to obtain a predicting channel sample as a prediction result.

14. The apparatus of claim 13, wherein the candidate channel samples comprise previously predicted channel samples.

15. The apparatus of claim 13, wherein the prediction strategy includes a triplet of three parameters (M, I, P), in which M denotes the number of the selected channel samples, I denotes a distance between two contiguously selected channel samples in the candidate channel samples, and P denotes a distance between the predicting channel sample and the selected channel sample that is closest to the predicting channel sample.

16. The apparatus of claim 15, wherein I and P are fixed, and M is incremented symbol by symbol.

17. The apparatus of claim 13, wherein the statistical properties of the time-varying wireless channel include spaced-frequency spaced-time correlations.

18. The apparatus of claim 17, wherein the spaced-frequency spaced-time correlations are based on a delay power spectrum and a spaced-time correlation function of the time-varying wireless channel.

19. The apparatus of claim 13, wherein the prediction weights determination circuit comprises:
a first calculation circuit configured to calculate prediction weights corresponding to all possible prediction strategies based on the statistical properties in advance;
a second selection circuit configured to select a prediction weight corresponding to the determined prediction strategy.

20. The apparatus of claim 13, wherein the prediction weights determination circuit comprises a second calculation circuit configured to calculate the prediction weights based on the statistical properties in accordance with the determined prediction strategy.

21. The apparatus of claim 13, wherein the prediction strategy determination circuit comprises a training circuit configured to train some previous channel samples of the candidate channel samples in terms of respective prediction errors to determine the prediction strategy.

22. The apparatus of claim 21, wherein a Viterbi Algorithm is used in the training.

23. The apparatus of claim 13, wherein the apparatus performs channel predicting symbol by symbol.

24. The apparatus of claim 23, wherein the prediction strategy is different on each symbol.