# Patent

## Title
Arrangement and method for iterative channel impulse response estimation

## Abstract

An arrangement (300) and method, for iterative channel impulse response estimation in a system such as a GSM/EDGE system employing a transmission channel, by: producing (310) from a received signal (y) a channel impulse response estimate signal (p); and producing (320) from the received signal (y) a noise estimate signal (w) which is iteratively fed back to improve the channel impulse response estimate signal (p). The noise estimate signal comprises a matrix (w) respresenting the inverse of noise covariance; the matrix may be calculated at each iteration or may be selected from predetermined values corresponding to statistics of expected noise. This provides the advantages of reduced complexity, independence of the equalization method used to produce the channel impulse response estimate signal, and consequent performance improvement.

## Background
FIELD OF THE INVENTION
This invention relates to systems employing transmission channels, and particularly (though not exclusively) to wireless cellular telecommunication systems.
BACKGROUND OF THE INVENTION
In the field of this invention it is known that the receiver performance in wireless cellular telecommunication systems relies on the estimate of the impulse response of the overall channel which includes the transmitter pulse, the radio channel, and the receiver selectivity filtering.
From the publication “Iterative channel estimation using soft decision feedback”, by Magnus Sandell et al., Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE, Volume: 6, 1998, pp. 3728-3733, iterative channel impulse response estimation is known using soft decision feedback. In this known technique, channel impulse response estimation is improved through an iterative process which increases the number of known symbols in a received modulated signal by iteratively feeding back successive tentative decisions from an equaliser to a channel impulse response estimator.
However, this approach has the disadvantage that a great part of the complexity of the technique depends on the complexity of the equalizer, which may dramatically increase with the number of points in the modulation constellation.
A need therefore exists for iterative channel impulse response estimation using noise estimate wherein the abovementioned disadvantage may be alleviated.
Patent specification WO 01/61950 describes a method channel impulse response estimation using whitening filters in the noise estimate. In this method, a plurality of channel impulse response and noise sample estimates are needed for each iteration and the whitening filters introduce delay and added complexity.
STATEMENT OF INVENTION
The present invention provides an arrangement and a method for iterative channel impulse response estimation as described in the accompanying claims.



BRIEF DESCRIPTION OF THE DRAWINGS
One arrangement and method for iterative channel impulse response estimation using noise estimate incorporating the present invention will now be described, by way of example only, with reference to the accompanying drawings, in which:
FIG. 1 shows a prior art arrangement for iterative channel impulse response estimation; and
FIG. 2 shows a prior art receiver arrangement for iterative channel impulse response estimation; and
FIG. 3 shows a receiver arrangement for iterative channel impulse response estimation incorporating the present invention.



DESCRIPTION OF PREFERRED EMBODIMENT
FIG. 1 shows, in outline, a GSM/EDGE (“Groupe Spéciale Mobile” or General System for Mobile communications/Enhanced Data rates for GSM Evolution) wireless cellular telephone communication system 10 in which the present invention may be used.
Generally, the system's air-interface protocol is administered from base transceiver sites that are geographically spaced apart—one base site supporting a cell (or, for example, sectors of a cell).
A plurality of subscriber units (MSs) 12-16 communicate over the selected air-interface 18-20 with a plurality of base transceiver stations (BTSs) 22-32. A limited number of MSs 12-16 and BTSs 22-32 are shown for clarity purposes only. The BTSs 22-32 may be connected to a conventional public-switched telephone network (PSTN) 34 through base station controllers (BSCs) 36-40 and mobile switching centres (MSCs) 42-44.
Each BTS 22-32 is principally designed to serve its primary cell, with each BTS 22-32 containing one or more transceiver units and communicating 56-66 with the rest of the cellular system infrastructure
Each Base Station Controller (BSC) 36-40 may control one or more BTSs 22-32, with BSCs 36-40 generally interconnected through MSCs 42-44.
Each MSC 42-44 provides a gateway to the PSTN 34, with MSCs 42-44 interconnected through an operations and management centre (OMC) 46 that administers general control of the cellular telephone communication system 10, as will be understood by those skilled in the art.
The various system elements, such as BSCs 36-38 and OMC 46, will include control logic 48, 50, 52, with the various system elements usually having an associated memory function 54 (shown only in relation to BSC 38 for the sake of clarity). The memory function 54 typically stores historically compiled operational data as well as in-call data, system information and control algorithms.
In each MS, receiver performance relies on an estimate of the impulse response of the overall channel which includes the transmitter pulse, the radio channel, and the receiver selectivity filtering.
Assuming the use of linear or quasi-linear modulations, the complex base band received signal may be represented as:




  
    y
    ⁡
    
      (
      t
      )
    
  
  =
  
    
      
        ∑
        k
      
      ⁢
      
        
          a
          k
        
        ·
        
          p
          ⁡
          
            (
            
              t
              -
              
                k
                ·
                T
              
            
            )
          
        
      
    
    +
    
      b
      ⁡
      
        (
        t
        )
      
    
  




where {ak} is the original transmitted symbol sequence, p(t) represents the complex impulse response of the overall channel and b(t) is the unwanted signal, called noise (filtered Gaussian noise, interferers such as upper adjacent interferer, lower adjacent interferer, co-channel interferer, etc.).

The Weighted Least Square algorithm provides for an estimate {circumflex over (p)}(t) of p(t) which minimizes the mean squared distance between {circumflex over (p)}(t) and p(t). Working with sampled signals, the generic equation is:

{circumflex over (p)}=(HH·W·H)−1·HH·W·y

where:

{circumflex over (p)} is the vector of Lp estimated samples of the overall channel.

y is the vector of Ly received samples corresponding to the sequence of known symbols.

H is a └Ly,Lp┘ matrix depending on known symbols

W is a └Ly,Ly┘ weighting matrix representing the inverse of the noise covariance.

There is no a priori knowledge on the statistical properties of the noise which evolves according to the position of a mobile station within a cell, according to the number of users, and according to the frequency channel in case of frequency hopping. In most of existing implementations, W is constant to the benefit of a specific noise (filtered Gaussian noise for instance) or of less complexity when W is equal to the identity matrix (white Gaussian noise).
Referring now to FIG. 2, a known arrangement 200 for deriving a channel impulse response estimate in a receiver such as MSs 12-16 uses a channel impulse response estimator 210 and an equalizer 220. A received signal is applied to both the equalizer and to the channel impulse response estimator, which is initially trained with a predetermined training sequence. The channel impulse response estimator 210 produces an estimated channel signal which is applied to the equalizer 220, where it is used to produce a tentative decision for modulated symbols in the received signal. The tentative decisions are iteratively fed back to the channel impulse response estimator 210, to modify estimated channel signal so as to improve the tentative symbol decisions.
However, this known approach has the disadvantage that a great part of the complexity of the technique depends on the complexity of the equalizer 220, which may dramatically increase with the number of points in the modulation constellation.
Referring now to FIG. 3, an arrangement 300 for improving the quality of the overall channel impulse response estimate for use in a receiver such as MSs 12-16 includes a channel impulse response estimator 310 (known per se) and a noise estimator 320 (whose function will be described in more detail below). A received signal is applied to both the channel impulse response estimator 310 and to the noise estimator 320; both the channel impulse response estimator 310 and the noise estimator 320 are initially trained with a predetermined training sequence. The channel impulse response estimator 310 produces an estimated channel signal which is applied to the noise estimator 320 and to a further stages such as an equalizer (not shown) where it is used to produce decisions for modulated symbols in the received signal. The noise estimator 320 produces parameters depending on noise in the received signal; these parameters are applied to further stages (not shown) and are also fed back to the channel impulse response estimator 310, to modify the estimated channel signal so as to improve symbol decisions.
In this technique, channel impulse response estimation is done by iterations. Each iteration provides updated knowledge about statistical properties of the noise and updated channel impulse response estimate. A first estimate of the channel is fed to the noise estimator 320 which estimates the noise parameters which are then provided to the channel impulse response estimator which estimates the channel and so on.
The sequence of operations of the method is detailed below:
Initialisation
The first estimate of the channel impulse response p(0) can be computed by using an a priori weighting matrix or by using a correlation method which is widely used for GSM training sequences
Iteration K for K>0
The vector of noise samples b(K) is given by:

b(K)=y−H·p(K−1)

Then r(K), the vector of L, noise covariance taps, is computed from the estimated noise samples:





  
    
      r
      ⁡
      
        (
        K
        )
      
    
    _
  
  =
  
    
      win
      k
    
    ·
    
      
        ∑
        
          l
          =
          k
        
        
          
            L
            y
          
          -
          1
        
      
      ⁢
      
        
          
            b
            l
          
          ⁡
          
            (
            K
            )
          
        
        ·
        
          
            
              b
              
                l
                -
                k
              
            
            ⁡
            
              (
              K
              )
            
          
          *
        
      
    
  




where wink is a windowing function with a positive Fourier transform.

Then the new channel impulse response estimate is given by:

p(K)=(HH·W(K)·H)−1·HH·W(K)·y

where W(K) is the new weighting matrix.

For the computation of equation members including W(K), two modes of computation are possible:

    
    
        mode A: on the fly.
        mode B: precomputed values which correspond to the statistics of the expected noises (e.g., Gaussian noise, upper adjacent interferer noise, lower adjacent interferer noise, or co-channel interferer noise).
    
    


In mode A, the └Ly,Ly┘ matrix W(K) is given by:




  
    W
    ⁡
    
      (
      K
      )
    
  
  =
  
    
      [
      
        
          
            
              
                r
                0
              
              ⁡
              
                (
                K
                )
              
            
          
          
            
              
                r
                1
              
              ⁡
              
                (
                K
                )
              
            
          
          
            ...
          
          
            
              
                r
                
                  
                    L
                    y
                  
                  -
                  1
                
              
              ⁡
              
                (
                K
                )
              
            
          
          
            0
          
          
            ...
          
          
            0
          
        
        
          
            
              
                
                  r
                  1
                
                ⁡
                
                  (
                  K
                  )
                
              
              *
            
          
          
            
              
                r
                0
              
              ⁡
              
                (
                K
                )
              
            
          
          
            ...
          
          
            
              
                r
                
                  
                    L
                    y
                  
                  -
                  2
                
              
              ⁡
              
                (
                K
                )
              
            
          
          
            
              
                r
                
                  
                    L
                    y
                  
                  -
                  1
                
              
              ⁡
              
                (
                K
                )
              
            
          
          
            ...
          
          
            0
          
        
        
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
        
        
          
            
              
                
                  r
                  
                    
                      L
                      y
                    
                    -
                    1
                  
                
                ⁡
                
                  (
                  K
                  )
                
              
              *
            
          
          
            
              
                
                  r
                  
                    
                      L
                      y
                    
                    -
                    2
                  
                
                ⁡
                
                  (
                  K
                  )
                
              
              *
            
          
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
        
        
          
            0
          
          
            
              
                
                  r
                  
                    
                      L
                      y
                    
                    -
                    1
                  
                
                ⁡
                
                  (
                  K
                  )
                
              
              *
            
          
          
            
              
                
                  r
                  
                    
                      L
                      y
                    
                    -
                    2
                  
                
                ⁡
                
                  (
                  K
                  )
                
              
              *
            
          
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
        
        
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
          
            
              
                r
                1
              
              ⁡
              
                (
                K
                )
              
            
          
        
        
          
            0
          
          
            0
          
          
            0
          
          
            ...
          
          
            ...
          
          
            
              
                
                  r
                  1
                
                ⁡
                
                  (
                  K
                  )
                
              
              *
            
          
          
            
              
                r
                0
              
              ⁡
              
                (
                k
                )
              
            
          
        
      
      ]
    
    
      -
      1
    
  




In mode B, the vector r(K) is compared with a set of N, expected vectors rM and the └Ly,Ly┘ matrix W(K) is given by:




  
    W
    ⁡
    
      (
      K
      )
    
  
  =
  
    
      W
      
        M
        opt
      
    
    =
    
      
        [
        
          
            
              
                r
                0
                
                  M
                  opt
                
              
            
            
              
                r
                1
                
                  M
                  opt
                
              
            
            
              ...
            
            
              
                r
                
                  
                    L
                    y
                  
                  -
                  1
                
                
                  M
                  opt
                
              
            
            
              0
            
            
              ...
            
            
              0
            
          
          
            
              
                r
                1
                
                  
                    M
                    opt
                  
                  *
                
              
            
            
              
                r
                0
                
                  M
                  opt
                
              
            
            
              ...
            
            
              
                r
                
                  
                    L
                    y
                  
                  -
                  2
                
                
                  M
                  opt
                
              
            
            
              
                r
                
                  
                    L
                    y
                  
                  -
                  1
                
                
                  M
                  opt
                
              
            
            
              ...
            
            
              0
            
          
          
            
              ...
            
            
              ...
            
            
              ...
            
            
              ...
            
            
              ...
            
            
              ...
            
            
              ...
            
          
          
            
              
                r
                
                  
                    L
                    y
                  
                  -
                  1
                
                
                  
                    M
                    opt
                  
                  *
                
              
            
            
              
                r
                
                  
                    L
                    y
                  
                  -
                  2
                
                
                  
                    M
                    opt
                  
                  *
                
              
            
            
              ...
            
            
              ...
            
            
              ...
            
            
              ...
            
            
              ...
            
          
          
            
              0
            
            
              
                r
                
                  
                    L
                    y
                  
                  -
                  1
                
                
                  
                    M
                    opt
                  
                  *
                
              
            
            
              
                r
                
                  
                    L
                    y
                  
                  -
                  2
                
                
                  
                    M
                    opt
                  
                  *
                
              
            
            
              ...
            
            
              ...
            
            
              ...
            
            
              ...
            
          
          
            
              ...
            
            
              ...
            
            
              ...
            
            
              ...
            
            
              ...
            
            
              ...
            
            
              
                r
                1
                
                  M
                  opt
                
              
            
          
          
            
              0
            
            
              0
            
            
              0
            
            
              ...
            
            
              ...
            
            
              
                r
                1
                
                  
                    M
                    opt
                  
                  *
                
              
            
            
              
                r
                0
                
                  M
                  opt
                
              
            
          
        
        ]
      
      
        -
        1
      
    
  




where Mopt is the index of the vector which minimizes the distance between r(K) and rM.

It will be understood that the technique for iterative channel impulse response estimation using noise estimate described above provides the following advantages:

    
    
        Less complexity;
        Independence of the particular equalization method; and
        Consequent performance improvement (tests have shown that use of this technique in a EDGE system can result in a performance improvement of 1.8 dB).
    
    


It will be understood that, if desired, the technique for iterative channel impulse response estimation using noise estimate described above could be with the prior art technique of FIG. 2.
It will also be understood that, although the technique for iterative channel impulse response estimation using noise estimate has been described above in relation to the receiver in a mobile station (MS), the technique could also be applied to the receiver in a base station (BTS).
It will be appreciated that the method described above for iterative channel impulse response estimation using noise estimate will typically be carried out in software running on a processor (not shown), and that the software may be provided as a computer program element carried on any suitable data carrier (also not shown) such as a magnetic or optical computer disc.
It will also be appreciated that various modifications to the embodiment described above will be apparent to a person of ordinary skill in the art.

## Claims

1. An arrangement for iterative channel impulse response estimation in a system employing a transmission channel, comprising:
a channel impulse response estimator for producing iteratively from a received signal (y) a channel impulse response estimate ({circumflex over (p)}); and
a noise estimator for producing from the received signal (y) iteratively at each iteration K an estimated vector of noise samples {circumflex over (b)}(K)=y−H·{circumflex over (p)}(K−1), where H is a matrix depending on known symbols, computing from the estimated vector of noise samples a vector of noise covariance taps





  
    
      r
      ⁡
      
        (
        K
        )
      
    
    _
  
  =
  
    
      win
      k
    
    ·
    
      
        ∑
        
          l
          =
          k
        
        
          
            L
            y
          
          -
          1
        
      
      ⁢
      
        
          
            b
            l
          
          ⁡
          
            (
            K
            )
          
        
        ·
        
          
            
              b
              
                l
                -
                k
              
            
            ⁡
            
              (
              K
              )
            
          
          *
        
      
    
  




where wink is a windowing function with a positive Fourier transform, and using the vector r(K) to produce
a new matrix W(K) representing the inverse of noise covariance, and
said channel impulse response estimator is arranged, at each iteration (K), to respond to said new matrix W(K) representing the inverse of noise covariance to produce a single improved channel impulse response estimate {circumflex over (p)}(K)=(HH·W(K)·H)−1·HH·W(K)·y.

2. The arrangement of claim 1 wherein said new matrix W(K) representing the inverse of noise covariance is calculated at each iteration.

3. The arrangement of claim 1 wherein said new matrix W(K) representing the inverse of noise covariance is selected from predetermined values corresponding to statistics of expected noise.

4. The arrangement of claim 3 wherein the predetermined values corresponding to statistics of expected noise are selected according to the noise types: Gaussian, upper adjacent interferer, lower adjacent interferer, or co-channel interferer.

5. The arrangement of claim 1 wherein the channel impulse response estimator is arranged to produce the channel impulse response estimate ({circumflex over (p)}) as a weighted least square function.

6. The arrangement of claim 1 wherein the system is a wireless communication system.

7. The arrangement of claim 6 wherein the system is a GSM system.

8. The arrangement of claim 7 wherein the system is an EDGE system.

9. A receiver for use in a system employing a transmission channel, the receiver comprising the arrangement of claim 1.

10. A method for iterative channel impulse response estimation in a system employing a transmission channel, comprising:
providing a channel impulse response estimator for producing iteratively from a received signal (y) a channel impulse response estimate ({circumflex over (p)}); and
providing a noise estimator for producing from the received signal (y) iteratively at each iteration K an estimated vector of noise samples {circumflex over (b)}(K)=y·H·{circumflex over (p)}(K−1), where H is a matrix depending on known symbols, computing from the estimated vector of noise samples a vector of noise covariance taps





  
    
      r
      ⁡
      
        (
        K
        )
      
    
    _
  
  =
  
    
      win
      k
    
    ·
    
      
        ∑
        
          l
          =
          k
        
        
          
            L
            y
          
          -
          1
        
      
      ⁢
      
        
          
            b
            l
          
          ⁡
          
            (
            K
            )
          
        
        ·
        
          
            
              b
              
                l
                -
                k
              
            
            ⁡
            
              (
              K
              )
            
          
          *
        
      
    
  




where wink is a windowing function with a positive Fourier transform, and using the vector r(K) to produce
a new matrix W(K) representing the inverse of noise covariance, and
said channel impulse response estimator, at each iteration (K), responds to said new matrix W(K) representing the inverse of noise covariance to produce a single improved channel impulse response estimate {circumflex over (p)}(K)=(HH·W(K)·H)−1·HH·W(K)·y.

11. The method of claim 10 wherein said new matrix (W(K)) representing the inverse of noise covariance is calculated at each iteration.

12. The method of claim 10 wherein said new matrix representing the inverse of noise covariance is selected from predetermined values corresponding to statistics of expected noise.

13. The arrangement of claim 12 wherein the predetermined values corresponding to statistics of expected noise are selected according to the noise types: Gaussian, upper adjacent interferer, lower adjacent interferer, or co-channel interferer.

14. The method of claim 10 wherein the channel impulse response estimator produces the channel impulse response estimate ({circumflex over (p)}) as a weighted least square function.

15. The method of claim 10 wherein the system is a wireless communication system.

16. The method of claim 15 wherein the system is a GSM system.

17. The method of claim 15 wherein the system is an EDGE system.

18. A computer readable medium embodying a computer program element, the computer program element comprising instructions for performing a method for iterative channel impulse response estimation in a system employing a transmission channel, the method comprising:
providing a channel impulse response estimator for producing iteratively from a received signal (y) a channel impulse response estimate ({circumflex over (p)}); and
providing a noise estimator for producing from the received signal (y) iteratively at each iteration K an estimated vector of noise samples {circumflex over (b)}(K)=y−H·{circumflex over (p)}(K−1), where H is a matrix depending on known symbols, computing from the estimated vector of noise samples a vector of noise covariance taps





  
    
      r
      ⁡
      
        (
        K
        )
      
    
    _
  
  =
  
    
      win
      k
    
    ·
    
      
        ∑
        
          l
          =
          k
        
        
          
            L
            y
          
          -
          1
        
      
      ⁢
      
        
          
            b
            l
          
          ⁡
          
            (
            K
            )
          
        
        ·
        
          
            
              b
              
                l
                -
                k
              
            
            ⁡
            
              (
              K
              )
            
          
          *
        
      
    
  




where wink is a windowing function with a positive Fourier transform, and using the vector r(K) to produce
a new matrix W(K) representing the inverse of noise covariance, and
said channel impulse response estimator, at each iteration (K), responds to said new matrix W(K) representing the inverse of noise covariance to produce a single improved channel impulse response estimate {circumflex over (p)}(K)=(HH·W(K)·H)−1·HH·W(K)·y.