# Patent

## Title
Adaptive equalizing apparatus and program therefor

## Abstract

In an adaptive equalizing apparatus for MIMO (Multi-Input Multi-Output) turbo reception, an interference component in a received signal is subtracted therefrom using a replica of an interference component in an interference canceling part 31n, the subtracted output is filtered by a filter 32n, to cancel the remaining interference component and to perform multi-path combining, and in a degree-of-interference-cancellation estimation part 41n the degree of interference cancellation β(i) is set such that it is 0 for the iteration number i=1, 0.8+0.05 (i−1) for 5≧i≧2 and 1 for i≧6, and at the beginning of each iteration filter coefficients are calculated using β(i) and a channel estimation value in a filter coefficient calculating part 33n and the filter coefficient thus calculated are set in the filter 32n. An average value of soft decision symbol estimation values used in the interference canceling part may be used as β.

## Background
BACKGROUND OF THE INVENTION
1. Technical Field
The present invention relates to an adaptive equalizing apparatus for use in a turbo receiver or the like which iterates equalization and decoding and, more particularly, to an adaptive equalizing apparatus which cancels interference by use of a priori information and then further suppresses interference and combines multipath components by filtering. The invention also pertains to a program for implementation of such an adaptive equalizing apparatus.
2. Prior Art
The problem to be tackled in the mobile communication business is how to accommodate a great many users (mobile stations) on a limited number of frequencies with high quality. A solution to this problem is a MIMO (Multiple-Input Multiple-Output) system such as shown in FIG. 1. In this system, letting j represent a bit index, symbols generated from information bits b1(j) to bN(j) are sent from a plurality of transmitters S1 to SN at the same point in time and at the same frequency, and these transmitted signals are received by a MIMO receiver 30 equipped with antennas #1 to #M. The MIMO receiver 30 processes the received signals to estimate the information bits b1(j) to bN(j) forming the symbols sent from the transmitters S1 to SN, and outputs the estimated information bits as b1′(j) to bN′(j) to output terminals Out1 to OutN, respectively.
A concrete configuration scheme of the MIMO receiver in the MIMO system is still under study. In the case of using the MLS (Maximum Likelihood Sequence Estimation) criterion for the configuration of the MIMO receiver configuration in the MIMO system, letting N represent the number of transmitters, P the number of constellation points and Q the number of multi-paths over which the transmit signal from each transmitter reaches each antenna of the MIMO receiver, the computational complexity of the MIMO receiver becomes enormous with an increase in the number N of transmitters and in the number Q of multi-paths since the computational complexity increases in proportion to P(Q−1)N. Further, in the case of receiving information sent as plural parallel signals from a single user, separation of each parallel signal calls for larger amounts of computations with an increase in the number of multi-paths. From this point of view, the present invention is of great utility especially when applied to a turbo receiver for multiple stream signals, but the invention is also effective in a turbo receiver for a single user (one transmitter), that is, for a single stream signal, and receivers of other systems. A description will be given first of a conventional single-user turbo receiver.
Single-User Turbo Receiver
FIG. 2 shows, by way of example, the configurations of a transmitter and a receiver in this case. In a transmitter 10 an input information bit stream b(j) is subjected to error correction encoding by a channel encoder 11 to generate a coded bit stream c(j). The stream c(j) is interleaved by an interleaver 12 into a stream c(k), which is used to modulate a carrier signal in a symbol mapping part 13 into a transmit symbol stream s(k). And the transmit symbol stream s(k) is added by multiplexing means 15 with a training symbol str(k) from a training symbol stream generator 14, thereafter being transmitted. In general, the transmit symbol stream s(k) is transmitted after being converted to the radio frequency band.
This transmit signal is sent over a transmission channel (each multi-path channel) to a receiver 20. In the receiver 20 a SISO (Soft-Input-Soft-Output) equalizer 21 equalizes delayed waves. The input signal r(k) received by the receiver 20 is usually converted in a receiving part (not shown) from the high-frequency to the base band, and base band received signal is sampled at a frequency one or more times higher than the symbol frequency of the transmit symbol stream to generate a digital signal, which is input as a digital received signal r(k) to the equalizer 21.
In the case of a single user, that is, when N=1 in FIG. 1, the received output from each receiving antenna #m (where m=1, 2, . . . , M) can be expressed as follows.




  
    
      r
      m
    
    ⁡
    
      (
      k
      )
    
  
  =
  
    
      
        ∑
        
          q
          =
          0
        
        
          Q
          -
          1
        
      
      ⁢
      
        
          
            h
            m
          
          ⁡
          
            (
            q
            )
          
        
        ·
        
          s
          ⁡
          
            (
            
              k
              -
              q
            
            )
          
        
      
    
    +
    
      
        v
        m
      
      ⁡
      
        (
        k
        )
      
    
  




where m is an antenna index, k is discrete time, h is a channel value (channel impulse response: channel characteristic), s(k) is a transmit symbol of the user (the transmitter 1), and vm(k) is an internal thermal noise of the receiver 20. And, the following equation is defined with the outputs from all the antennas #1 to #M represented as a vector r(k).





  
    
      
        
          r
          ⁡
          
            (
            k
            )
          
        
        =
        
        ⁢
        
          
            [
            
              
                
                  r
                  1
                
                ⁡
                
                  (
                  k
                  )
                
              
              ⁢
              
                
                  r
                  2
                
                ⁡
                
                  (
                  k
                  )
                
              
              ⁢
              
                
              
              ⁢
              ...
              ⁢
              
                
              
              ⁢
              
                
                  r
                  M
                
                ⁡
                
                  (
                  k
                  )
                
              
            
            ]
          
          T
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            
              ∑
              
                q
                =
                0
              
              
                Q
                -
                1
              
            
            ⁢
            
              
                H
                ⁡
                
                  (
                  q
                  )
                
              
              ·
              
                s
                ⁡
                
                  (
                  
                    k
                    -
                    q
                  
                  )
                
              
            
          
          +
          
            v
            ⁡
            
              (
              k
              )
            
          
        
      
    
  




where:

v(k)=[v1(k)v2(k) . . . vM(k)]T 

H(q)=[h1(q)h2(q) . . . hM(q)]T 

T indicates a transposed vector (or matrix). Next, the following vector and matrix are defined taking the number Q of multi-paths (channels) into consideration. In the following description, symbols added with m=1, . . . , M and n=1, . . . , N as subscripts, respectively, denote indices to elements of vectors or matrices.




  
    
      
        
          
            y
            ⁡
            
              (
              k
              )
            
          
          ≡
          
          ⁢
          
            
              [
              
                
                  
                    r
                    T
                  
                  ⁡
                  
                    (
                    
                      k
                      +
                      Q
                      -
                      1
                    
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    r
                    T
                  
                  ⁡
                  
                    (
                    
                      k
                      +
                      Q
                      -
                      2
                    
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                ...
                ⁢
                
                  
                
                ⁢
                
                  
                    r
                    T
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
              ]
            
            T
          
        
      
    
    
      
        
          ≡
          
          ⁢
          
            
              H
              ·
              
                S
                ⁡
                
                  (
                  k
                  )
                
              
            
            +
            
              n
              ⁡
              
                (
                k
                )
              
            
          
        
      
    
  




  
    
      where
      :
      
        

      
      ⁢
      H
    
    =
    
      [
      
        
          
            
              H
              ⁡
              
                (
                0
                )
              
            
          
          
            ⋯
          
          
            
              H
              ⁡
              
                (
                
                  Q
                  -
                  1
                
                )
              
            
          
          
            
              
            
          
          
            0
          
        
        
          
            
              
            
          
          
            ⋰
          
          
            
              
            
          
          
            ⋰
          
          
            
              
            
          
        
        
          
            0
          
          
            
              
            
          
          
            
              H
              ⁡
              
                (
                0
                )
              
            
          
          
            ⋯
          
          
            
              H
              ⁡
              
                (
                
                  Q
                  -
                  1
                
                )
              
            
          
        
      
      ]
    
  



S(k)=[s(k+Q−1)s(k+Q−2) . . . s(k−Q+1)]T 

n(k)=[vT(k+Q−1)vT(k+Q−2) . . . vT(k)]T 

The following description will be given on the assumption of using the BPSK modulation scheme. In multivalued modulation using many values, too, the prior art and the present invention can easily be extended by appropriate symbol mapping and demapping. The vector r(k) defined above is input to the equalizer 21. The SISO equalizer 21 is a linear equalizer, from which is derived, as its equalized output, LLR (Log-Likelihood Ratio) Λ1 between the probabilities that each coded bit s(k) is +1 and −1.





  
    
      
        
          
            Λ
            1
          
          ⁡
          
            [
            
              s
              ⁡
              
                (
                k
                )
              
            
            ]
          
        
        =
        
        ⁢
        
          log
          ⁢
          
            
              P
              ⁢
              
                
              
              ⁢
              
                r
                ⁡
                
                  [
                  
                    
                      s
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    =
                    
                      
                        +
                        1
                      
                      ❘
                      
                        y
                        ⁡
                        
                          (
                          k
                          )
                        
                      
                    
                  
                  ]
                
              
            
            
              P
              ⁢
              
                
              
              ⁢
              
                r
                ⁡
                
                  [
                  
                    
                      s
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    =
                    
                      
                        -
                        1
                      
                      ❘
                      
                        y
                        ⁡
                        
                          (
                          k
                          )
                        
                      
                    
                  
                  ]
                
              
            
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            
              λ
              1
            
            ⁡
            
              [
              
                s
                ⁡
                
                  (
                  k
                  )
                
              
              ]
            
          
          +
          
            
              λ
              2
              p
            
            ⁡
            
              [
              
                s
                ⁢
                
                  (
                  k
                  )
                
              
              ]
            
          
        
      
    
  




where λ1[s(k)] is external information that is sent to a subsequent decoder 24 and λ2p[s(k)] is a priori information that is sent to the equalizer 21. The LLR Λ1[s(k)] is fed to a subtractor 22, by which the a priori information λ2p[s(k)] is subtracted, and the subtracted output is provided to a de-interleaver 23, wherein it is subjected to de-interleaving opposite to that by the interleaver 12 to provide ), λ1[s(j)], which is fed to a SISO channel decoder 24. The decoder 24 performs SISO decoding by use of redundancy for the error correction added by the encoder 11 of the transmitter and outputs a decoded bit b′(j) as a temporary or final received signal, and calculates an LLR Λ2 for each bit by the following equation.





  
    
      
        
          
            Λ
            2
          
          ⁡
          
            [
            
              s
              ⁢
              
                (
                j
                )
              
            
            ]
          
        
        =
        
        ⁢
        
          log
          ⁢
          
            
              P
              ⁢
              
                
              
              ⁢
              
                r
                ⁢
                
                  
                
                [
                
                  
                    s
                    ⁡
                    
                      (
                      j
                      )
                    
                  
                  =
                  
                    
                      +
                      1
                    
                    ❘
                    
                      
                        λ
                        1
                      
                      ⁡
                      
                        [
                        
                          
                            s
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                          ,
                          
                            j
                            =
                            0
                          
                          ,
                          
                            
                          
                          ⁢
                          ...
                          ⁢
                          
                            
                          
                          ,
                          
                            B
                            -
                            1
                          
                        
                        ]
                      
                    
                  
                
              
            
            
              P
              ⁢
              
                
              
              ⁢
              
                r
                ⁢
                
                  
                
                [
                
                  
                    s
                    ⁡
                    
                      (
                      j
                      )
                    
                  
                  =
                  
                    
                      -
                      1
                    
                    ❘
                    
                      
                        λ
                        1
                      
                      ⁡
                      
                        [
                        
                          
                            s
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                          ,
                          
                            j
                            =
                            0
                          
                          ,
                          
                            
                          
                          ⁢
                          ...
                          ⁢
                          
                            
                          
                          ,
                          
                            B
                            -
                            1
                          
                        
                        ]
                      
                    
                  
                
              
            
          
        
      
    
  
  
    
      
        ≡
        
        ⁢
        
          
            
              λ
              2
            
            ⁡
            
              [
              
                s
                ⁡
                
                  (
                  j
                  )
                
              
              ]
            
          
          +
          
            
              λ
              1
              p
            
            ⁡
            
              [
              
                s
                ⁡
                
                  (
                  j
                  )
                
              
              ]
            
          
        
      
    
  




The output λ1[s(j)] from the deinterleaver 23 is provided as a priori information λ1p[s(j)] to a subtractor 25, by which the a priori information λ1p[s(j)] is subtracted from Λ2[s(j)]. The resulting λ2[s(j)] is provided as external information λ2p[s(k)] via an interleaver 26 to the equalizer 21 and the subtractor 22 during iteration processing. Depending on reception processing scheme, Λ1[s(k)] and Λ2[s(k)] may be replaced with λ1p[s(k)] and λ2p[s(k)], respectively. In this way, equalization and decoding are carried out iteratively to provide increased error rate.

Next, a detailed description will be given of the calculation of a linear filter that the equalizer 21 applies to a received vector y(k). The equalizer 21 uses the a priori information λ2p[s(k)] to calculate the following soft decision symbol estimated value.

s′(k)=tanh[λ2p[s(k)]/2]

Further, the equalizer 21 uses the estimated value and a channel matrix H to generate a replica of an interference component, H·S′(k), which is subtracted from the received signal. That is,





  
    
      
        
          
            Y
            ′
          
          ⁡
          
            (
            k
            )
          
        
        ≡
        
        ⁢
        
          
            y
            ⁡
            
              (
              k
              )
            
          
          -
          
            H
            ·
            
              
                S
                ′
              
              ⁡
              
                (
                k
                )
              
            
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            H
            ·
            
              (
              
                
                  S
                  ⁡
                  
                    (
                    k
                    )
                  
                
                -
                
                  
                    S
                    ′
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
              )
            
          
          +
          
            n
            ⁡
            
              (
              k
              )
            
          
        
      
    
  




where

S′(k)=[s′(k+Q−1) . . . s′(k+1)0s′(k−1) . . . s′(k−Q+1)]T 

Since the replica H·S′(k) of the interference component is not exactly accurate, the interference component cannot completely be canceled by this processing. Then, optimum linear filter coefficients wopt(k) for complete cancellation of the remaining interference component are calculated by the following MMSE (Minimum Mean Square Error) criterion.

wopt(k)=arg min∥wH(k)·y′(k)−s(k)∥2 

where H represents a conjugate transposition and ∥*∥ represent the norm, then w(k) is calculated which minimizes the above equation.

The following scheme for the derivation of w(k) is described, for example, in Daryl Reynolds and Xiaodong Wang, “Low Complexity Turbo-Equalization for Diversity Channels,” ELSEVIER, Signal Processing, 81(2001), pp. 989–995. One of the primary challenges by the scheme is a sharp reduction of computational complexity. The computational complexity of the conventional MLSE turbo is in proportion to the order of PQ−1 (where P is the number of signal points of the transmit symbol), whereas according to this scheme the complexity is kept down to the order of Q3. Incidentally, wH(k)·y′(k) is the output from the equalizer 21, from which is calculated λ1[s(k)], which is provided via the de-interleaver 23 to the decoder 24 for decoding calculation.
There is proposed a method by which approximates the absolute value of a soft decision symbol estimated value s′n(k) to 1 in second and subsequent rounds of MMSE filter coefficients calculation in single-user turbo reception (see, for example, H. Ohmori, T. Asai, T. Matsumoto, “A matched filter approximation for SC/MMSE Iterative Equalizers,” IEEE Trans. Commun. Letters, vol., no. 7, pp. 310–312, July 2001).
Next, a description will be given of the turbo reception method set forth in European Patent Publication EP1233565A2 (corresponding U.S. Patent Application Publication No. 2002-016560-A1) which is an extension of the single-user turbo reception to a multi-user turbo reception method. Since the configuration of one user (transmitter n (where n=1, . . . , N) for the multi-input multi-output turbo reception method is the same as the transmitter configuration shown in FIG. 2, reference characters denoting the signal stream corresponding to that of the user n are each attached with a subscript n and put in parentheses.
Letting Q represent the number of multi-paths over which radio waves propagate from one transmitting antenna to one receiving antenna, the signal that is received by an m-th (where m=1, . . . , M) antenna #m is a signal that has convoluted a delay profile (channel characteristic) hmn(q) in the transmit signal sn from the transmitter Sn, and the signal rm(k) received by the m-th antenna #m is a combined version of received signals from all the transmitters S1 to SN and added with noise. Accordingly, the received signal rm(k) is given by the following equation.




  
    
      
        
          
            r
            m
          
          ⁡
          
            (
            k
            )
          
        
        =
        
          
            
              ∑
              
                q
                =
                0
              
              
                Q
                -
                1
              
            
            ⁢
            
              (
              
                
                  
                    h
                    mn
                  
                  ⁡
                  
                    (
                    q
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    s
                    
                      n
                      ⁢
                      
                        
                      
                    
                  
                  ⁡
                  
                    (
                    
                      k
                      -
                      q
                    
                    )
                  
                
              
              )
            
          
          +
          
            
              n
              m
            
            ⁡
            
              (
              k
              )
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




Where nm(k) is an additive white Gaussian noise (AWGN) for the signal received by the m-th antenna #m.

In this specification, the following definition is given for convenience in writing the channel status (channel characteristic).




  
    
      
        
          
            
              
                r
                ⁡
                
                  (
                  k
                  )
                
              
              =
              
              ⁢
              
                
                  [
                  
                    
                      
                        r
                        1
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    ⁢
                    
                      
                        r
                        2
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    ...
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        r
                        M
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                  
                  ]
                
                T
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    ∑
                    
                      q
                      =
                      1
                    
                    Q
                  
                  ⁢
                  
                    
                      H
                      ⁡
                      
                        (
                        q
                        )
                      
                    
                    ⁢
                    
                      S
                      ⁡
                      
                        (
                        
                          k
                          -
                          q
                        
                        )
                      
                    
                  
                
                +
                
                  n
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    k
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




where k is discrete time, T represents a transposed matrix or vector, and H(q), S(k) and n(k) are as follows.





  
    
      
        
          H
          ⁡
          
            (
            q
            )
          
        
        =
        
          [
          
            
              
                
                  
                    h
                    11
                  
                  ⁡
                  
                    (
                    q
                    )
                  
                
              
              
                
                  
                    h
                    12
                  
                  ⁡
                  
                    (
                    q
                    )
                  
                
              
              
                ⋯
              
              
                
                  
                    h
                    
                      1
                      ⁢
                      N
                    
                  
                  ⁡
                  
                    (
                    q
                    )
                  
                
              
            
            
              
                
                  
                    h
                    21
                  
                  ⁡
                  
                    (
                    q
                    )
                  
                
              
              
                
                  
                    h
                    22
                  
                  ⁡
                  
                    (
                    q
                    )
                  
                
              
              
                ⋯
              
              
                
                  
                    h
                    
                      2
                      ⁢
                      N
                    
                  
                  ⁡
                  
                    (
                    q
                    )
                  
                
              
            
            
              
                ⋮
              
              
                ⋮
              
              
                ⋰
              
              
                ⋮
              
            
            
              
                
                  
                    h
                    M1
                  
                  ⁡
                  
                    (
                    q
                    )
                  
                
              
              
                
                  
                    h
                    M2
                  
                  ⁡
                  
                    (
                    q
                    )
                  
                
              
              
                ⋯
              
              
                
                  
                    h
                    MN
                  
                  ⁡
                  
                    (
                    q
                    )
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        3
        )
      
    
  




S(k)=[s1(k)s2(k) . . . sN(k)]T  (4)

n(k)=[n1(k)n2(k) . . . nM(k)]T  (5)

FIG. 3 shows the functional configuration of the MIMO turbo receiver. The MIMO space-time turbo receiver is formed by a MIMO equalizer 20A and decoding parts 20B1 to 20BN for respective signal streams (users), and reduces the bit error rate by iterating equalization and decoding of the same received signal. The received signals from antennas #1 to #M are input to the space-time turbo equalizer 20A as base-band digital signals r1(k) . . . , rN(k) each sampled with the symbol period, for instance. The MIMO equalizer 20A: generates a replica of the received interference signal by use of a second external information value (a second a priori information stream) which is fed back from a SISO (Soft-Input Soft-Output) decoder 24An in the preceding iteration of equalization and decoding; removes MAI (Multiple Access Interference) and ISI (Inter-Symbol Interference) from the received signal r(k) by use of the received interference signal replica; and calculates a first external information value (first a priori information stream) λ1[sn(k)] of each symbol by MMSE filtering. Incidentally, since in the first round of MIMO equalization for each frame it is impossible to utilize the second external information value λ2[sn(k)] obtainable in the previous iteration, the equalizer 20A performs only the equalization by the MMSE filter. The decoding part for the signal stream n (SISO decoding part for each user) 20Bn de-interleaves, by a de-interleaver 23, the first external information value λ1[sn(k)] calculated by the MIMO equalizer 20A and subjects the de-interleaved output to SISO decoding by a SISO decoder 24An. The second external information value λ2[sn(k)] obtained by the SISO decoding for each symbol sn(j) is interleaved by an interleaver 26 and fed back to the MIMO equalizer 20A as the second a priori information λ2p[sn(k)].
FIG. 4 illustrates the configuration of the MIMO equalizer 20A. The MIMO equalizer 20A comprises a channel estimation part 21C, equalization parts 21A1 to 21AN corresponding to respective signal streams, and a training symbol generating part 29, and each equalization part 21An is made up of an adaptive equalization part 27n and an external information generating part 28n. The channel estimation part 21C estimates the channel status (transmission channel characteristic) based on the received signal and a training symbol fed from the training symbol generating part 29.
FIG. 5 depicts the configuration of the adaptive equalization part 27n, which comprises an interference canceling part 31n, an MMSE filtering part 32n, and a filter coefficient calculating part 33n . FIG. 6 shows an example of the configuration of the interference canceling part 31n. Referring first to FIG. 6, a replica generator 34n generates a received interference signal replica of the interference (MAI, ISI) component in the received signal based on the second a priori information streams λ2[s1(k)], . . . , λ2[sN(k)] (except λ2[sn(k)]) and an estimated channel status (a channel estimated value) H, and a subtractor 35n subtracts the interference signal replica Hue,n(k) from the received signal r(k). An estimated value (soft decision symbol estimated value) s′n(k) of the transmit signal sn(k) of each user is calculated by the following equation from the second a priori information value λ2[sn(k)].

s′n(k)=tanh(λ2[sn(k)]/2)  (6)

The soft decision symbol estimated value s′n(k) is a transmit signal replica of a magnitude corresponding to its degree of reliability. The estimated value Ue,n(k) of the signal which becomes an interference component of the transmit signal sn(k) from the transmitter Sn at time k is as follows:

Ue,n(k)=[un(k+(Q−1))un(k+(Q−2)) . . . un(k+1)Ucn(k)Un(k−1). . . un(k−(Q−1))]T  (7)

un(k)=[s′1(k)s′2(k) . . . s′N(k)]  (8)

ucn(k)=[s′1(k)s′2(k) . . . s′n−1(k)0s′n+1(k) . . . s′N(k)]  (9)

By generating the received interference signal replica Hue,n(k) for the interference component ue,n(k) and canceling the replica in the received signal r(k), it is possible to obtain an estimated value r′s,n(k) of the received signal for the transmit symbol sn(k) from the transmitter Sn at time k which is the symbol to be detected. That is, the estimated value r′s,n(k) is given by the following equation.

r′s,n(k)=re(k)−Hue,n(k)  (10)

where

re(k)=[r(k+Q−1)r(k+Q−2) . . . r(k)]T  (11)





  
    
      
        H
        =
        
          [
          
            
              
                
                  H
                  ⁡
                  
                    (
                    0
                    )
                  
                
              
              
                
                  H
                  ⁡
                  
                    (
                    1
                    )
                  
                
              
              
                ⋯
              
              
                
                  H
                  ⁡
                  
                    (
                    
                      Q
                      -
                      1
                    
                    )
                  
                
              
              
                
                  
                
              
              
                
                  
                
              
              
                0
              
            
            
              
                
                  
                
              
              
                
                  H
                  ⁡
                  
                    (
                    0
                    )
                  
                
              
              
                
                  H
                  ⁡
                  
                    (
                    1
                    )
                  
                
              
              
                ⋯
              
              
                
                  H
                  ⁡
                  
                    (
                    
                      Q
                      -
                      1
                    
                    )
                  
                
              
              
                
                  
                
              
              
                
                  
                
              
            
            
              
                
                  
                
              
              
                
                  
                
              
              
                ⋰
              
              
                
                  
                
              
              
                
                  
                
              
              
                
                  
                
              
              
                
                  
                
              
            
            
              
                0
              
              
                
                  
                
              
              
                
                  
                
              
              
                
                  H
                  ⁡
                  
                    (
                    0
                    )
                  
                
              
              
                
                  H
                  ⁡
                  
                    (
                    1
                    )
                  
                
              
              
                
                  ⋯
                  ⁢
                  
                    
                  
                
              
              
                
                  H
                  ⁡
                  
                    (
                    
                      Q
                      -
                      1
                    
                    )
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        12
        )
      
    
  




In this case, however, the estimated value r′s,n(k) still contains interference components left uncanceled due to a bit decision error in the previous iteration and the usage of the soft output value.

Next, the cancellation of interference components still remaining after the cancellation of the received interference signal replica from the received signal and multi-paths combining are carried out by the MMSE filtering part 32n. Since in the early iterations many interference components remain uncancelled after the subtraction of the interference replica, the MMSE filtering part 32n functions as a filter which cancels the remaining interference components, and with an increase in the number of iterations, the MMSE filtering part 32n operates to perform maximum-ratio combining of multi-paths. Letting the output from the MMSE filtering part 32n be represented by zn(k), it is given as follows:

zn(k)=wnH(k)rs,n(k)  (13)

where H denotes a conjugate transposed matrix and wn(k) is a coefficient vector of the MMSE filtering part 32n, which is defined as follows in the filter coefficient calculating part 33n.

wn(k)=[HΛn(k)HH+σ2I]−1hn  (14)

where I is a unit matrix, hn is





  
    
      
        
          
            
              
                h
                n
              
              =
              
              ⁢
              
                [
                
                  
                    
                      h
                      
                        1
                        ⁢
                        n
                      
                    
                    ⁡
                    
                      (
                      
                        Q
                        -
                        1
                      
                      )
                    
                  
                  ⁢
                  
                    
                      h
                      
                        2
                        ⁢
                        n
                      
                    
                    ⁡
                    
                      (
                      
                        Q
                        -
                        1
                      
                      )
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      h
                      Mn
                    
                    ⁡
                    
                      (
                      
                        Q
                        -
                        1
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              
              ⁢
              
                
                  
                    h
                    
                      1
                      ⁢
                      n
                    
                  
                  ⁡
                  
                    (
                    
                      Q
                      -
                      2
                    
                    )
                  
                
                ⁢
                
                  
                    h
                    
                      2
                      ⁢
                      n
                    
                  
                  ⁡
                  
                    (
                    
                      Q
                      -
                      2
                    
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                ...
                ⁢
                
                  
                
                ⁢
                
                  
                    h
                    Mn
                  
                  ⁡
                  
                    (
                    
                      Q
                      -
                      2
                    
                    )
                  
                
              
            
          
        
        
          
            
                                                            
              ⁢
              ⋯
              ⁢
              
                
              
            
          
        
        
          
            
              
                
                ⁢
                
                  
                    
                      h
                      
                        1
                        ⁢
                        n
                      
                    
                    ⁡
                    
                      (
                      0
                      )
                    
                  
                  ⁢
                  
                    
                      h
                      
                        2
                        ⁢
                        n
                      
                    
                    ⁡
                    
                      (
                      0
                      )
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      h
                      Mn
                    
                    ⁡
                    
                      (
                      0
                      )
                    
                  
                
                ]
              
              T
            
          
        
      
    
    
      
        (
        15
        )
      
    
  




And, setting D(k) and Dc(k) to

D(k)=[1−s′12(k)1−s′22(k) . . . 1−s′N2(k)]  (16)

Dcn(k)=[1−s′12(k)1−s′22(k) . . . 1−s′n−12(k)1 1−s′n+12(k) . . . 1−s′N2(k)]  (17)

Λn(k) is expressed as follows:

Λn(k)=diag[D(k+(Q−1))D(k+(Q−2)) . . . D(k+1)Dcn(k)D(k−1) . . . D(k−(Q−1))]  (18)

where σ2 represents the internal noise power of the receiver and diag a diagonal matrix (elements other than those of the diagonal are zeros).

With the prior art described above, symbols sent simultaneously from a plurality of user transmitters at the same frequency can be received by a plurality of antennas and separated for each user.
There is proposed, for example, in Japanese Patent Application Laid-Open Gazette 2002-33685 an interference canceller for use in the CDMA (Code Division Multiple Access) mobile communication system. To cancel interference for signals from a plurality of users, the proposed interference canceller provisionally decides a signal after error correction encoding and uses the provisionally decided value to generate a replica and, at this time, prevents occurrence of many errors attributable to the generation of a wrong replica when the above-mentioned provisionally decided value is wrong. This interference canceller will be described below with reference to FIG. 7 which is arranged for 3 users and 4 stages.
In a first stage 301 interference canceling parts (ICU) 311 to 313 each perform the processing shown in FIG. 8. In the first place, a RAKE receiving part 401 performs RAKE reception of a user signal. That is, for each path the user signal is despread in a despreading part 404, and the despread signal is provided to a channel estimation part 405 and a multiplication part 406. A channel estimated value derived from the despread signal in the channel estimation part 405 and the despread signal are multiplied in the multiplication part 406. Such multiplied outputs in the respective paths are added together in an adding part 407, and the result of RAKE reception, which is the result of the addition, is provided to an FEC (Forward Error Correction) decoding part 408 and a pre-FEC-decoding hard decision part 411 in a transmission data decision part 402.
The pre-FEC-decoding hard decision part 411 makes a hard decision directly based on the result of RAKE reception, and the FEC decoding part 408 performs FEC (Forward Error Correction) decoding based on the result of RAKE reception. The EFC decoded signal is subjected to hard decision in a hard decision part 409, thereafter being applied to an FEC encoding part 410 and an error detecting part 421. The FEC encoding part 410 performs FEC encoding of the hard decision signal, and outputs the FEC-encoded hard decision value to a switch 423 and the corresponding ICU parts 321 to 323 in a second stage 302.
An error detecting part 421 performs an error detection by CRC (Cyclic Redundancy Check), and applies the detected output to a switch control part 422 and the corresponding ICU parts 321 to 323 in the second stage 302.
The switch control part 422 controls the switch 423 according to the CRC output. When the CRC result is NG (error detected), the switch control part 422 controls the switch 423 to apply therethrough the yet-to-be-FEC-decoded hard decision value from the pre-FEC-decoding hard decision part 411 to a multiplying part 414 of each path in a replica generating part 403. The multiplying part 414 of each path in the replica generating part 403 multiplies the yet-to-be-FEC-decoded hard decision value and a channel estimated value of the corresponding path which is fed from the RAKE receiving part 401, and the multiplied output is provided to a re-spreading part 415, wherein it is spread in the same manner as at the transmitting side. The spread signals of the respective paths are added together in an adding part 416, and the added output is provided as a replica from each of the ICU parts 311 to 313, thereafter being applied to a second stage 302 via each of adding parts 315 to 317 in the first stage in FIG. 7.
When the CRC result is OK (no error detected), the switch control part 422 controls the switch 423 to apply therethrough the FEC-decoded hard decision signal (hard decision value) from the FEC ending part 410 to the multiplying part 414 of each path in the replica generating part 403.
Replicas of respective received signals from the ICU parts 311, 312 and 313 are subtracted in a subtracting part 314 from the received signal fed thereto via a delay part 310, and the subtracted received signal is added with replicas from the ICU parts 311, 312 and 313 in adding parts 315, 316 and 317, respectively. Accordingly, the output from the adding part 315, for instance, is equivalent to a signal obtainable by cancelling components of other user's received signals from the received signal. Similarly, the adding part 316 and 317 output the corresponding received signals from which other interference signals have been removed, respectively.
In the ICU parts 321 to 323 in the second stage 302, the RAKE receiving part 401 and the transmission data decision part 402 perform the same processing as in the case of the first stage 301 as shown in FIG. 9 in which the parts are denoted by reference numerals similar to those of the corresponding partsin FIG. 8. To the error detecting part 421 a are input the hard decision signal from the hard decision part 409 in the current stage (the second stage 302) and the CRC result provided from the previous stage (the first stage 301). To the switch part 423a are input a yet-to-be-decoded hard decision value and an FEC-decoded hard decision value in the current stage and the hard decision value provided from the previous stage. The current-stage error detected result (CRC result) in the error detecting part 421 a and the hard decision value from the FEC encoding part 410 are output to each of the corresponding ICU parts 331 to 333 of the next stage (third stage 303). The switch control part 422a selects its output signal to the replica generating part 403 according to the following three conditions. First, when the CRC result from the previous stage is OK (no error detected), the hard decision value of the previous stage is provided to the replica generating part 403. Second, when the CRC result from the previous stage is NG (error detected) and the CRC result on the hard decision signal in the current stage is OK, the hard decision value from the FEC encoding part 410 is selected and provided to the replica generating part 403. Third, when the CRC result from the previous stage is NG and the CRC result on the hard decision signal in the current stage is also NG, the hard decision value from the pre-FEC-decoding hard decision part 411 is selected and provided to the replica generating part 403.
Accordingly, the second stage 302 outputs each received signal having cancelled therefrom other received signals (interference signals). In the third stage 303, too, the same processing as in the second stage 302 is carried out. Turning to FIG. 10, the operation of each of the ICU parts 341 to 343 in the fourth stage 304 in FIG. 7 will be described below. The processing in the RAKE receiving part 401 is the same as in the case of the first stage 301. The output from the RAKE receiving part 401 is FEC decoded in the FEC decoding part 408 in a transmit data decision part 402a, and the FEC-decoded signal is subjected to hard decision in the hard decision part 409. A switch control part 422b controls a switch 423b to output therethrough, as a demodulated signal, the hard decision value of the previous stage or the hard decision signal from the hard decision part in the current stage, depending on whether the CRC result from the previous stage is OK (no error detected) or NG (error detect).
As described above, when the CRC result from the previous stage is OK, the error-free hard decision value of the previous stage is used to generate the replica—this ensures generation of an accurate replica. Besides, in this instance, a series of processes in the current stage, i.e. FEC decoding, hard decision and FEC encoding, become unnecessary, so that the computational complexity involved can be reduced. When the CRC result from the previous stage is NG and the CRC result in the current stage is OK, the error-free hard decision value in the current stage is used to generate the replica; hence, it is possible to obtain the replica with high accuracy. Further, when the CRC result from the previous stage is NG and the CRC result in the current stage is also NG, no wrong signal is used but a signal obtained by hard decision of a yet-to-be-FEC-decoded in the current stage is used to generate the replica—this excludes the possibility of a wrong replica by use of a wrong signal and provides for increased accuracy of replica.
Incidentally, in FIGS. 8 and 9, a soft-decision result of the output from the RAKE receiving part 401 may be used instead of the output from the pre-FEC decoding hard decision part 411.
SUMMARY OF THE INVENTION
It is therefore an object of the present invention to provide an adaptive equalizing apparatus which permits reduction of the computational complexity for MMSE filter coefficients and suppresses degradation of the bit error rate, and a program therefor.
The adaptive equalizing apparatus according to the present invention comprises:
interference canceling means supplied with a received signal a channel estimation value and an a priori information stream, for canceling an interference component in said received signal;
a filter part supplied with said interference-cancelled received signal, for suppressing interference and for combining multi-path components;
an interference-cancellation-degree estimation part supplied with information based on the state of iteration processing of said received signal, for estimating the degree of interference cancellation;
update timing generating means supplied with at least an iteration start signal, for generating filter coefficients update timing signal for each period during which the filter coefficients of said filter part are held unchanged; and
filter coefficient calculating means supplied with the degree of interference cancellation, the channel estimation value and said update timing signal, for calculating the filter coefficients of said filter part upon each generation of said update timing signal.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a schematic diagram of an MIMO system;
FIG. 2 is a block diagram depicting functional configurations of a transmitter and a receiver in a conventional single user turbo system;
FIG. 3 is a block diagram depicting the functional configuration of the principal part of a conventional MIMO turbo receiver;
FIG. 4 is a block diagram depicting the functional configuration of a MIMO equalizer 20A in FIG. 3;
FIG. 5 is a block diagram depicting the functional configuration of an adaptive equalization part 27 in FIG. 4;
FIG. 6 is a block diagram depicting the functional configuration of interference canceling means 31 in FIG. 5:
FIG. 7 is a block diagram showing the functional configuration of a conventional interference canceller;
FIG. 8 is a block diagram showing the functional configuration of an ICU part of a first stage in FIG. 7:
FIG. 9 is a block diagram showing the functional configuration of an ICU part of a second stage in FIG. 7:
FIG. 10 is a block diagram showing the functional configuration of an ICU part of a fourth stage in FIG. 7:
FIG. 11 is a block diagram showing the functional configuration of a filter coefficient calculating part 33 in FIG. 5 which could be used in the case of applying MRC approximation;
FIG. 12 is a block diagram illustrating the functional configuration of the principal part of a first embodiment of the present invention;
FIG. 13 is a graph showing, by way of example, the relationship between the number of iterations and the degree of interference cancellation;
FIG. 14 is a block diagram illustrating the functional configuration of the principal part of the second embodiment of the present invention;
FIG. 15 is a block diagram illustrating the functional configuration of the principal part of a third embodiment of the present invention;
FIG. 16 is a block diagram illustrating the functional configuration of the principal part of a fourth embodiment of the present invention;
FIG. 17 is a block diagram showing the functional configuration of part of a MIMO equalizer 21 in FIG. 16
FIG. 18 is a flowchart showing an embodiment of this invention method;
FIG. 19 is a flowchart showing a concrete example of an interference-cancellation-degree estimation step S4 in FIG. 18;
FIG. 20 is a flowchart showing another concrete example of step S4 in FIG. 18;
FIG. 21 is a flowchart showing another example of a decoding step S7 in FIG. 18;
FIG. 22 is a flowchart showing a modified form of step S2 in FIGS. 19 and 20; and
FIG. 23 is a graph showing results of computer simulations, indicating the effect of the present invention.



DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
A description will be given first of how the present invention was made.
In the first iteration processing of the received signal the updating of MMSE filter coefficients in the filter coefficient calculating part 33n in FIG. 5 needs only to be performed once at the beginning of the frame since no second external information value λ2[sn(k)] is available in the first iteration, but in the second and subsequent iterations the filter coefficients need to be updated for each symbol because the second external information value λ2[sn(k)] usually differs from symbol to symbol.
Incidentally, the first external information value λ1[s1(k)] for the symbol s1(k) is calculated by the following equation in the broken-lined external information value generating part 281 in FIG. 4

λ1[s1(k)]=4R{zn(k)}/(1−μn(k))  (19)

where R{zn(k)} represents a real part of zn(k) and un(k) is

μn(k)=hnH[HΛn(k)HH+σ2I]−1hn  (20)

Since the MMSE filter coefficients are calculated by Eqs. (14) to (18), the computational complexity involved is high. Then, consider the application of the approximation scheme set forth in the afore-mentioned H. Ohmori, et. al. document to the conventional adaptive equalizer described previously with reference to FIGS. 3 to 6. FIG. 11 shows the configuration of the filter coefficient calculating part 333 (FIG. 5) considered to be usable for implementation of the approximation scheme. In the first iteration, the MMSE filter coefficients are calculated in a first filter calculating part 37n as described previously. In the first iteration, however, since there is no feedback of the second a priori information λ2[s(k)] from the signal stream-n decoding part 20Bn (FIG. 3), soft decision symbol estimated value (hereinafter referred to as a soft decision value) s′n(k)=0 in all k's; therefore, the MMSE filter coefficients need not be calculated for each symbol, and they can be made common in each frame. In the second and subsequent equalizations, since s′n(k)=1 is set by the approximation, it follows that Λn(k)=1. Hence, the filter coefficient vector wn(k) is the product of a constant Const. and a channel estimation value hn (Eq. 15).

wn(k)=Const. hn  (21)

This is calculated in a second filter coefficient calculating part 38n (FIG. 11). That is, in the case of this approximation, the multi-path components are maximum-ratio combined and weighted by a scalar value. This approximation extremely simplifies the filter coefficient calculation. This approximation will hereinafter be referred to as an MRC approximation.

In the case of using the MMSE filter in the equalization process of the MIMO system, since transmit signal replicas of ISI and MAI symbols differ for each symbol, the MMSE filter coefficients need to be calculated for each symbol, which requires an enormous amount of calculations. To avoid this, if the above-mentioned MRC approximation which sets s′n(k)=1 is applied to the second and subsequent MMSE filter coefficient calculations, the computational complexity can be dramatically reduced since the MMSE filter coefficients need only to be calculated once for each frame, but the interference canceling effect diminishes as compared with that in the case of calculating the MMSE filter coefficients for each symbol, resulting in BER (Bit Error Rate) becoming badly degraded.
In the view of the above, according to the present invention, the degree of interference cancellation is obtained from information based on the iteration processing state for the received signal, and the degree of interference cancellation is used in place of the soft decision value s′n(k) to calculate the MMSE filter coefficients, which are set in the MMSE filter. The higher the degree of interference cancellation is, the closer to 1 its value is set. Accordingly, computational complexity can be reduced by maintaining filter coefficients unchanged in one iteration process, and further, since the degree of interference cancellation approaches 1 as the iteration proceeds to cancel the interference, it is possible to suppress the BER (Bit Error Rate) degradation.
The above configuration heightens the interference canceling effect as compared with that by the application of the conventional MRC approximation. This seems to be due to the fact that although when the MRC approximation is not used, s′n(k)=1 means very high reliability of the result of SISO decoding, s′n(k) contains errors in practice; for instance, the result of second or third SISO decoding also contains relatively many errors.
Embodiment 1
In FIG. 12 the adaptive equalizer according to the present invention is shown in correspondence to the adaptive equalization part 27n in FIG. 5. The adaptive equalizer according to the present invention is provided with a degree-of-interference-cancellation estimation part 41n and an update timing generating part 42 in addition to the interference canceling means 31n, the filter part 32n and the filter coefficient calculating part 33n in FIG. 5. In the present invention, the degree of interference cancellation β is calculated in the degree-of-interference-cancellation calculating part 41n, and is used to calculate the filter coefficients in the filter coefficient calculating part 33n. More specifically, the filter coefficients are calculated by setting s′n(k) (where n=1, . . . , N) in Eqs. (16) and (17) to β. From the viewpoint of reducing the computational complexity, β may preferably be constant in the frame. At this time, Eqs. (16) and (17) become as follows:

D(k)=[1−β2 1−β2 . . . 1−β2]  (22)

Dcn(k)=[1−β2 . . . 1−β21 1−β. . . 1−β2]  (≦)

In this instance, the degree of interference cancellation β is 0 for i=1 because of the property of the soft decision value s′n(k), and increases with an increase in the number of iteration processes for the received signal (referred to also as the iteration number), and it is desirable that β goes to 1 until the final iteration at the latest if the iteration number is sufficient. The degree of interference cancellation β that meets such conditions are considered infinite, but it can be set as a function of the iteration number i, for instance. FIG. 13 shows examples of a degree-of-interference-cancellation function β(i). In FIG. 13 the curves 45a, 45b and 45c indicate β(i) in the form of linear, 1/m-degree and m-degree expressions of i, respectively.

In practice, it is desirable to set β(i) to a value close to the 1/m-degree expression of i such that β is 0 for i=1, then, for i=2, abruptly increases to a value close to 1, for example, 0.8 or so, thereafter gradually approaching 1, for example, increasing about 0.05 for each iteration, for instance. Further, it is set that β=1 prior to the last iteration and β=1 in the subsequent iterations. To this end, the degree-of-interference-cancellation function β(i) can be set as follows, for instance:

β(i)=0 for i=1

β(i)=0.8+0.05×(i−1) for 5≧i≧2

β(i)=1 for i≧6  (24)

Preferable values of the constant 0.8 and the coefficient 0.05 in the linear expression using the i as a variable change with the scheme used. For example, in OFDM (Orthogonal Frequency Division Multiplex), the constant may preferably be around 0.9.

The iteration number i is input to the degree-of-interference-cancellation estimation part 41n to obtain the degree of interference cancellation β(i), and each time an update timing signal is applied to the filter coefficient calculating part 33n from the update timing generating part 42, the degree of interference cancellation β(i) at that time is used to calculate the filter coefficients by Eqs. (14), (15), (18), (22) and (23), and the filter coefficients of the filter part 32n are updated with the calculated filter coefficients. The degree-of-interference-cancellation estimation part 41n is provided in common to the filter coefficient calculating parts 33n corresponding to respective users.
As will be understood from the description given of the next second embodiment, according to this embodiment, at the beginning of the period during which filter coefficients are held unchanged, in this case, prior to the processing of the data symbol in each iteration, the update timing signal is generated in the update timing generating part 42, then the degree of interference cancellation β(i) is calculated and is used to calculate the filter coefficients, which are set in the filter part 32n, then when β(i) becomes 1, the filter coefficients at that time are held unchanged until the last iteration IE.
Embodiment 2
FIG. 14 illustrates in block form the principal part of the second embodiment of the invention. In the first embodiment the degree of interference cancellation β is set as a function of the iteration number i alone, but in the second embodiment the degree of interference cancellation β is set as a function of a second a priori information value λ2[s(k)]. For example, the mean value of the soft decision value s′n(k)=tanhλ2[sn(k)/2] in the period during which the filter coefficients are kept unchanged is used as the degree of interference cancellation as follows:




  
    
      
        β
        =
        
          
            (
            
              1
              /
              N
            
            )
          
          ⁢
          
            (
            
              1
              /
              
                N
                sy
              
            
            )
          
          ⁢
          
            
              ∑
              
                n
                =
                1
              
              N
            
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                Nsy
              
              ⁢
              
                
                  s
                  n
                  ′
                
                ⁡
                
                  (
                  k
                  )
                
              
            
          
        
      
    
    
      
        (
        25
        )
      
    
  




where N is the number of users and Nsy is the number of symbols contained in the period during which the filter coefficients remain unchanged. Here, the period during which the filter coefficients are kept unchanged can be judged from the filter coefficient update timing signal as well. That is, the one-frame (burst) period of the received signal usually consists of a training symbol period and a data symbol period succeeding it. In case where a channel estimation is made in the training data period, and the estimated value is used to perform the equalization process in the data symbol period, that is, to cancel interference by use of the interference replica in the interference canceling part 31n and filtering in the filter part 32n, the coefficients are maintained unchanged during the entire data symbol period in that one process; accordingly, the soft decision value s′n(k) for every data symbol, the data symbol number Nsy and the number of users in the immediately preceding iteration are used to calculate Eq. (25), then the degree of interference cancellation β thus obtained is used to calculate the filter coefficients by Eqs. (22) and (23) in the filter coefficient calculating part 33n, and the filter coefficients are set in the filter part 32n in the current iteration. Hence, it is necessary only to output the filter coefficient update timing signal at the start of each iteration and calculate the filter coefficients once for each iteration. In short, at each filter coefficient update timing soft decision values obtained from the preceding filter coefficient update timing to the current one are averaged.

In the case where the channel estimation is performed by use of previously decoded data symbol even in the current data symbol processing, or where a training symbol is contained in the data symbol, a change in the channel state in excess of a certain value in one frame period is detected and the filter coefficient update timing signal is output. For example, as shown in FIG. 14, the channel estimation value H is input to the update timing generating part 42 at each symbol timing, and in a difference detecting part 42b the difference is detected between corresponding elements of the current channel estimation value H and that obtained immediately after the previous filter coefficient calculation and stored in a storage part 42a, and the square sum of the detected difference is calculated in a square sum calculating part 42b. The square sum is compared in a comparison part 42e with a threshold value set in a threshold value setting part 32d. When the square sum is larger than the threshold value, it is construed as indicating a change in the channel state, and the update timing signal is output and the stored content of the storage part 42a is updated with the channel estimation value input at that time. In response to the update timing signal the filter coefficient calculating part 33n calculates the filter coefficients by use of the new channel estimation value H and updates the filter coefficients of the filter part 32n.
As described above, in the case of updating the filter coefficient in one frame period, too, Eq. (25) is calculated to estimate the degree of interference cancellation β by use of all the soft decision values s′n(k) obtained in the time interval between adjacent filter coefficient update timing signals (during the period wherein the filter coefficients are held unchanged) in the previous processing and the number Nsy of the soft decision values, or by use of soft decision values s′n(k) obtained from the immediately preceding filter coefficient update timing to the current timing and the number Nsy of them, and the estimated degree of interference cancellation β is used to calculate the filter coefficients, which are used to perform the filtering process in the filter part 32n for the interference-cancelled signal in the period during which the filter coefficients remain unchanged). In this way, the filter coefficients are calculated only for each filter coefficient update timing signal, and the filter coefficients are held unchanged for tens of to hundreds of data symbols; hence, the computational complexity for the filter coefficients can be reduced accordingly. In this case, too, the degree of interference cancellation P may be a function using as its variable the value obtained by Eq. (25).
In the case of using these soft decision values s′n(k) to calculate Eq. (25), it is also possible to input the iteration number i to the degree-of-interference-cancellation estimating part 41n, as indicated by the broken line in FIG. 14, to multiply Eq. (25) by, for example, a function α(i) of i to provide the degree of interference cancellation β(i). The function α(i) may also preferably be one that α(i)=0 for i=1, then abruptly increases to a value close to 1 and gradually approaches 1, thereafter becoming saturated at 1.
Further, the calculation result of Eq. (25) need not always be used, but instead it may be used as a function of the degree of interference cancellation β. While the degree of interference cancellation by Eq. (25) is used in common to all user (transmit) signals, a different degree of interference cancellation may be used for each of the user signals (transmit signals from all of the transmitters) to be decoded. In this instance, the following equation is used.




  
    
      
        
          β
          n
        
        =
        
          
            (
            
              1
              /
              
                N
                sy
              
            
            )
          
          ⁢
          
            
              ∑
              
                k
                =
                1
              
              Nsy
            
            ⁢
            
              
                s
                n
                ′
              
              ⁡
              
                (
                k
                )
              
            
          
        
      
    
    
      
        (
        
          25
          ′
        
        )
      
    
  




D(k)=[1−β12 1−β22 . . . 1−βN2]  (22′)

Dcn(k)=[1−β12 1−β22 . . . 1−βn−121 1−βn+12 . . . 1−βN2]  (23′)

Accordingly, the degree-of interference-cancellation estimation part 41n is provided for each user signal (signal stream n) to be decoded, and the degrees of interference cancellation β1 to βN for all the signal streams 1 to N are input to the respective filter coefficient calculating parts 33n.

The degree of interference cancellation may also be a function which directly uses the second a priori information λ2[sn(k)] in place of the soft decision value s′n(k). Moreover, the degree of interference cancellation may be β or βn, or a function using either one of them as a variable; in short, it needs only to be function using the second a priori information λ2[sn(k)].
The same applies to the embodiments of the invention described later on.
As will be seen from the above, the update timing generating part 42 is one that is supplied with the iteration start signal and the channel estimation value and generates the update timing signal upon each application thereto of the iteration start signal or upon each change of the channel estimation state in excess of a predetermined value, that is at the beginning of the period during which the filter coefficients are maintained unchanged.
Embodiment 3
The equalization scheme of the first embodiment does not reflect the result of error correction encoding for the signal to be detected, but a scheme which reflects the error correction encoding result on the signal to be detected is set forth in European Patent Publication Gazette EP1233565A2. In view of this, this embodiment adds, as shown in FIG. 15, a function calculating part 43a, a detected signal replica generating part 43b and an adding part 43c to the adaptive equalizing apparatus of the FIG. 12 embodiment so that part of the received signal replica of the signal to be detected is added to the received signal. That is, by setting that element “0” in Eq. (9) corresponding to the signal to be detected to −f(s′n(k)), the equation is changed as follows:

ucn(k)=[s′1(k+q)s′2(k) . . . s′n−1(k)−f(s′n(k))s′n+1(k) . . . s′N(k)]  (26)

where f(s′n(k)) is a function using s′n(k) as a variable.

As depicted in FIG. 15, the function calculating part 43a, the detected signal replica generating part 43b and the adding part 43b constitute a detected signal emphasizing part, and the detected signal emphasizing part 43 and the interference canceling part 31n constitute interference canceling means 31′n. In interference canceling means 31′n the interference component replica Hue,n(k) is calculated by Eqs. (26) and (8) based on Eq. (7), and the interference component replica is cancelled from the received signal, and the resulting signal is applied to the filter part 32n. Since this process is intended to emphasize the signal to be detected, the detected signal emphasizing part 43 calculates f(s′n(k)) is calculated in the function calculating part 43a of the detected signal emphasizing part 43 based on the second a priori information streams λ2[s1(k)] to λ2(sN(k)) input thereto, and this calculated value f(s′n(k)) and the channel estimation value H are used to generate a detected signal replica in the detected signal replica generating part 43b. That is, the detected signal replica generating part 43b obtains ue,n of Eq. (7) by setting all elements of un(k) of Eq. (8) to 0s, the element 0 in ue,n of Eq. (9) to f(s′n(k)) and the other elements to all 0s, and convolutes ue,n(k) of Eq. (7) and H to obtain the detected signal replica. The detected signal replica thus obtained is added to the received signal in the adding part 43c. While in FIG. 15 the detected signal replica is shown to be added to the output from the interference canceling part 31n, it may also be added to the input received signal to the interference canceling part 31n. Incidentally, as is evident from the following Eq. (27), the calculation result f(s′n(k)) of the function calculating part 43a is also input to the filter coefficient calculating part 33n.
For emphasizing the signal to be detected, Dcn(k) is defined by the following equation in place of Eq. (23) for calculating the MMSE filter coefficients.

Dcn(k)=[1−β21−β2 . . . 1−β21+2f(s′n(k))s′n(k)+|f(s′n(k))|21−β2 . . . 1−β2]  (27)

The degree of interference cancellation β may be that used in the first or second embodiment.
F(s′n(k)) needs to satisfy the following condition since the sign of s′n(k) is related to the symbol hard decision result and since the larger the absolute value of s′n(k), the higher the reliability of the corresponding hard decision symbol.
When s′n(k)=0, that is, when the reliability of the corresponding hard decision symbol is 0, the value of the function f is 0; namely

f(0)=0  (28)

When the value of s′n(k) is large, the value of the function f becomes large. Accordingly,

d{f(s′n(k))}/d{s′n(k)}≧0  (29)

Such a function may be defined, for example, by

f(s′n(k))=γ×s′n(k)  (30)

In this instance, setting s′n(k)=1, Eq. (27) for calculating the MMSE filter coefficients becomes as follows:

Dcn(k)=[1−β2 . . . 1−β2 1+2γ+γ21−β2 . . . 1−β2]  (27′)

By using a constant for γ, the above equation can easily be implemented. Setting γ to a large value, BER (Bit Error Ratio) becomes rather degraded; it is preferable that 0<γ<0.6. The value of γ may be increased in accordance with the iteration number.

Embodiment 4

In this embodiment, when no error is detected in the decoded bit stream in the signal stream-n equalizing part 21An for the user n (where n=1, . . . N), it is regarded that MAI (Multiple Access Interference and ISI (Inter-Symbol Interference) have also been sufficiently cancelled, and the degree of interference cancellation βn is set to a predetermined constant. This provides for increased accuracy in the estimation of the degree of interference cancellation β (or βn).
FIG. 16 illustrates in block form an example of the functional configuration of the signal stream-i decoding part 20B1 in FIG. 3. The channel decoder 24 contains a SISO decoder 24A1 and a hard decision part 24B. In the hard decision part 24B the LLR (Log-Likelihood Ratio) Λ2[s(j)] is subjected to hard decision, and the decision result is output as the decision bit stream b1(j) of the signal stream 1. The decision bit stream b1(j) is input to an error detecting part 47, which performs error detecting processing using the CRC code and outputs error detection information SED1 indicating whether an error was detected or not.
Similarly, the signal stream-n decoding part 20Bn outputs error detection information SEdn, which is input to the degree-of-interference-cancellation estimation part 41n of the adaptive equalizing part 27n for the signal stream n as shown in FIG. 17 in correspondence to FIG. 12. The equalizing part 27n equalizes only an error-detected signal stream and does not equalize an error-free signal stream. The degree-of-interference-cancellation estimation part 41n has a variable part 41a and a constant part 41b, and based on the error detection information SEdn, select means 41c is controlled to output the output from either one of the variable part 41 and the constant part 41b as the degree of interference cancellation βn.
The variable part 41a outputs a value which varies according to the iteration processing state, such as the function value by Eq. (24) which uses the iteration number I as a variable as described previously with respect to the first embodiment, or the function value by Eq. (25) or (25′) which uses the soft decision value s′n(k) as a variable as described previously with respect to the second embodiment. The constant part 41b outputs a constant which indicates satisfactory interference cancellation, that is, the maximum value 1 of the degree of interference cancellation, or a value close thereto, for instance, 0.98. When the error indication information SEdn indicates the presence of an error, a control part supplied with the error detection information SEdn controls a switch 41e to connect the output side of the variable part 41a to the filter coefficient calculating part 33n. Accordingly, the filter coefficient calculating part 33n is supplied with the degrees of interference cancellation β1 to βN for all of the signal streams, and calculates the filter coefficients wn(k) based on Eqs. (22), (23), or (22′), (23′), or (27). The subsequent operations are the same as in the first to fourth embodiments.
When the error detection information SEdn indicates the absence of an error, the switch 41e is controlled by the control part 41d to connect the output side of the constant part 41b to the filter coefficient calculating part 33n. Accordingly, for that one of the degrees of interference cancellation β1 to βN input to the filter coefficient calculating part 33n which corresponds to indicated error-free by the error detection information SEdn, the constant β is set to β=1, for instance, that is, the interference with the corresponding signal stream n is regarded as having completely been cancelled, and the filter coefficients ww(k) are calculated to cancel interference for that one of the other signal streams indicated error-detected by the error detection information. For the signal stream detected error-free, the corresponding degree-of-interference-cancellation estimation part 41n keeps on outputting the constant in the subsequent iterations, too. Incidentally, in this example the control part 41d and the switch 41e constitute the select means 41c. 
Further, in the signal stream-n decoding part 20Bn the output SED1 from the error detecting part 47 is input to a control part 48a as shown in FIG. 16. The control part 48a which control a switch 48b to connect the output side of a subtracting part 25 to the interleaver 26 or connect the output side of an encoding part 52 to the interleaver 26, depending on whether the error detection information SED1 indicates the presence or absence of an error. Accordingly, if an error is detected, the first a priori information λ1[s1(j)] output from the de-interleaver 23 is subtracted in the subtracting part 25 from the LLR Λ2[s1(j)] provided in the SISO decoder 24A1, and the resulting second a priori information λ2[s1(j)] is provided to the interleaver 26. If no error is detected, the output bit stream b1(j) from the hard decision part 24B is subjected again to error correcting encoding in the encoding part 52, and the symbol stream is provided to the interleaver 26. As indicated by the broken lines, the LLR Λ2[s(j)] may be provided as the second a priori information to the interleaver 26 in place of the output from the subtracting part 25. This applied to other embodiments, and the LLR may be used as the second a priori information to calculate the degree of interference cancellation in the second embodiment, for instance. Further, the output from the interleaver 25 is provided as the second a priori information to the MIMO equalizer 20A, and it is also stored in a storage part 54 having stored therein the second a priori information generated in the precious iteration, and consequently, the stored information is incessantly updated. From the MIMO equalizer 20A the error detection information SED1 on the corresponding signal stream in the previous iteration is input to a control part 55a. The control part 55a controls a switch 55b to provide the second a priori information from the interleaver 26 to the MIMO equalizer 20A or the second a priori information generated in the previous iteration and stored in the storage part 54 to the MIMO equalizer 20A, depending on whether the error detection information SED1 indicates the presence or absence of an error. For the signal stream in which no error was detected, no decoding process is performed in the current and subsequent iterations. If no error is detected, the output form the hard decision part 24B or the encoding part 52, generated in the current iteration, may be stored for use in the subsequent iterations.
In the case where the constant to be stored in the constant part 41b (FIG. 17) is set to 1 and the soft decision value s′n(k) is used as the information on the iteration processing state as described previously in respect of the second embodiment, s′n(k)=1 and the degree of interference cancellation βn also becomes 1 when no error is detected; hence, when no error is detected in the signal stream n, the filter coefficient calculation is simple even if the constant part 41b is not provided. If, however, provision is made to switch between the variable part 41a and the constant part 41b by use of the error detection information SED1 as referred to previously, the computational complexity in the degree-of interference-cancellation estimation part 41n for the corresponding signal stream can be reduced when no error is detected.
If the constant to be stored in the constant part 41b is set not only to 1 but also to a value smaller than 1 but close thereto, for example, 0.98, when an interference cancellation error remain due to a channel estimation error, it is possible to calculate the filter coefficients wn(k) taking the residual interference into consideration. That is, when no error is detected for the signal stream n, the equalization therefor need no longer be improved, but when βn=1 in the equalization for other signal streams, the interference by the signal stream n is neglected as seen from Eqs. (22′) and (23′); hence, as mentioned previously, there is the possibility that interference due to a channel estimation error remains in the output from the interference canceling part 31n for other users (signal streams), and this residual interference cannot be cancelled. But, when an error is detected in the signal stream n, setting the degree of interference cancellation βn for the signal stream to 1 or a value close thereto permits calculation of filter coefficients taking into account the interference due to a channel estimation error, making it possible to suppress residual interference for other signal streams than that n.
The constant to be stored in the constant part 41b need not always be a fixed value. For example, as described previously with reference to FIGS. 4 to 6 based on the afore-mentioned European Patent Publication EP1233565A2, if the channel estimation is made using a reliable hard decision value in the data symbol obtained by the previous iteration, an accurate channel estimation value can be obtained for each iteration. In this case, the degree of interference cancellation βn of the signal steam with no error detected may be set to slight increase such that it is, for example, 0.97 when an error was no longer detected for the first time and 0.98 in the next iteration. Further, as described previously in respect of the second embodiment, when the channel condition in one frame differs between the first and second half periods, the degree of interference cancellation βn is calculated for each of them, but when an error is no longer detected in such a state, the constant may be changed in one frame in accordance with the degree of interference cancellation βn obtained so far; for example, 0.97 for the lower βn and 0.98 for the higher βn. In the case of changing the constant as mentioned above, another constant part 41b′ is provided as indicated by the broken line, and the constant parts 41b and 41b′ are selectively used. The constant to be set in the constant part 41 b may be re-set.
Procedure
A brief description will be given of the procedure of each of the above embodiments according to the present invention. As depicted in FIG. 18, the channel value H (Eq. (3) between each transmitter Sn (where n=1, . . . , N) and each of the antennas #1 to #M is estimated in the channel estimation part 21 C (see FIG. 4) (step S1), then the channel value H and the soft decision values λ2[s1(k)] to λ2[sN(k)] are used to a received signal replica of an interference signal (interference replica) Hue,n(k) in the replica generating part 34n (step S2), and the interference replica is subtracted from the received signal r(k) in the subtracting part 35n to cancel interference as expressed by Eq. (10) (step S3). In the present invention the information based on the iteration processing state is used to estimate, in the degree-of-interference-cancellation estimation part 41n (FIGS. 12, 14, 15 and 17), the degree of interference cancellation β or βn indicating the degree of residual interference in the output in step S3 (step S4).
Next, the degree of interference cancellation β or β1 to βN and the channel estimation value H are used to calculate the filter coefficients wn(k) in the filter coefficient calculating part 33n (FIGS. 12, 14, 15 and 17) (step S5). The thus calculated filter coefficients wn(k) are used to update the filter coefficients of the filter part 32n, wherein the output from the subtracting part 35n (see FIG. 6) of the interference canceling part 31n is subjected to filtering to suppress the residual interference components (step S6). The filtered signal is decoded (step S7). Thereafter, a check is made to see whether the iteration number has reached a predetermined value (step S8), and if not, the second a priori information is calculated for the decoded signal stream, followed by the return to step S2 (step 9). When it is found in step 8 that the iteration number has reached the predetermined value, the hard decision bit string in step S7 at that time is output and the procedure ends. That is, this embodiment differs from the afore-mentioned document EP1233565A2 in that the degree-of interference-cancellation estimation step is added to the procedure described in reference to the document so that the estimated degree of interference cancellation is used as a substitute for the soft decision value to calculate the filter coefficients wn(k).
Turning next to FIG. 19, a description will be given of an example of the procedure for calculating the filter coefficients wn(k) by the filter coefficient calculating part 33n (FIG. 12) in the first embodiment. The procedure start with initializing the iteration number i to 1 in step S1. In step S2 the function value using the number i as a variable is calculated, for example, by Eq. (24) to obtain the degree of interference cancellation β. In this state the procedure awaits the generation of an update timing signal in step S3, and upon generation of the update timing signal, the procedure goes to step S3, in which the degree of interference cancellation β obtained in step S2 and the channel value H are used to calculate the filter coefficients wn(k). Next, upon completion of the iteration, the iteration number i is incremented by one in step S5, and in step S6 a check is made to see if the number i has exceeded the last iteration number IE, and if not so, the procedure returns to step S2. If it is found in step S6 that i has exceeded IE, then the procedure ends, and if the degree of interference cancellation β is 1 in step S7, the procedure returns to step S3. Incidentally, if i is not larger than IE in step S6, the procedure may return to step 2, omitting step S7.
Referring next to FIG. 20, a description will be given of an example of the procedure for calculating filter coefficients in the second embodiment. In the first place, the iteration number i is initialized to 1 in step S1, then in step S2 the soft decision value is used to calculate the degree of interference cancellation β or βn by Eq. (25) or (25′), then in step S3 the procedure awaits the generation of the update timing signal, and on generation of the update timing signal, the procedure goes not step S4, in which the degree of interference cancellation calculated in step S2 and the channel estimation value H are used to calculate the filter coefficients wn(k). In step S5 a check is made to see if the update timing signal generated instep S3 is based on the update of the iteration, and if not, the procedure returns to step S2, and if the timing signal is based on the updating of the iteration, the iteration number i is incremented by one in step S6. Then in step S7 a check is made to see if the iteration number I is in excess of the last iteration number IE, and if not, the procedure returns to step S2, whereas when i is excess of IE, the procedure ends.
Next, a description will be given, with reference to FIG. 21, of an example of the procedure of the signal stream-n decoding part in the fourth embodiment. In the first place, a check is made (by the control part 55a) in step S1 to see if the error detection information SEDn input from the MIMO equalizer 20A (FIG. 16) indicates the presence of an error, and if so, the decoding (by the decoder 24) is carried out in step S2, and in step S3 the hard decision bit string is subjected to error detection processing (by the error detecting part 47). In step S4 a check is made to see if an error was detected, and if an error was detected, the procedure goes to step S5, in which the second a priori information is generated from the information obtained by the decoding in step S2, that is, the same processing of step S9 in FIG. 18 is performed.
If it is found in step S4 that no error was detected, the previously-obtained hard decision bit string is subjected to error correction encoding and, if necessary, to symbol mapping in step S6, and in step S7 its encoded string or symbol string is output as the second a priori information and, at the same time, it is stored in the storage part 54. If it is found in step S1 that the error detection information SEdn indicates the absence of an error, then the second a priori information in the storage part 54 is read out therefrom in step S8.
The degree-of-interference-cancellation estimation in the fourth embodiment may be made by conducting, as shown in FIG. 22, the degree-of-interference-cancellation calculation in step S2 in FIG. 19 or 20. That is, in step S2-1 it is checked whether the input error detection information SEdn indicates the presence or absence of an error, and if it indicates the presence of an error, then a functional calculation is conducted to obtain the degree of interference cancellation β in step S2-2, and the calculated result is set to βn. When it is found in step S2-1 that no error was detected, a constant 1 or close thereto is set as the degree of interference cancellation βn.
In the above embodiments the signal streams 1 to N are processed in parallel as shown in FIGS. 3 and 3, but the present invention may be applied as well to such a serial processing scheme as described, for example, in Sirikiat Lek Ariyavisitakul, “Turbo Space-Time Procession to Improve Wireless Channel Capacity,” IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 48, AUGUST 2000. In such an instance, the signal steams 1 to N are processed in a predetermined order, for example, in the order 1, 2, . . . , N, and the result of processing of other signal streams performed until then to be used in the processing of each signal stream n (1, . . . , N) is: the result obtained by the current iteration for the signal streams 1, . . . , n−1; and the result obtained in the previous iteration for the signal steams n, . . . , N. And in the case of receiving and equalizing a symbol stream transmitted by OFDM (Orthogonal Frequency Division Multiplex) for each signal stream n, adaptive equalization is performed for each identical subcarrier of he signal streams 1 to N; the present invention is applicable in this case, too.
In the above, the degree of interference cancellation β is estimated in accordance with the iteration number and the value of the current a priori information, but it may also be estimated by combining them with one or more of the information energy (received signal power) per bit, the numbers of transmit and receive antennas, the encoding rate and the number of multi-paths. In this instance, once the system to be used is determined, the optimum or quasi-optimum degree of interference cancellation β is obtained in advance by computer simulations, and the degree of interference cancellation β is used based on the iteration processing state. At any rate, it can be said that 0 is estimated based on the iteration processing state. That is, in the first embodiment the iteration number i is information about the iteration processing state, and in the second embodiment the a priori information λ2[sn(k)] is the information about the iteration processing state.
In s system which requests retransmission when an error is detected, processing for the error-detected received signal is the first iteration and processing for the retransmitted received signal is the second iteration. The present invention is applicable not only to the MIMO system but also to a single user turbo system and a system in which on detecting an error, the receiver side requests the transmitter side for retransmission in the case where it is possible in these systems to obtain information corresponding to the a priori information λ2[sn(k)] by some means. In the system which requests retransmission upon detection of an error, the processing for the error-detected received signal is the first iteration and the processing for the retransmitted received signal is the second iteration. In the cell diversity system, when a mobile station is capable of communicating with base stations of two adjoining cells as in the case of handover in the mobile communications, processing for the received signal from the one base station is the first iteration and processing for the received signal from the other base station is the second iteration. In the case of turbo reception in the cell diversity system, processing for the received signal from the one base station is iterated three times, after which processing for the received signal from the other base station is the fourth iteration.
The adaptive equalizing apparatus of the present invention can also be implemented under computer control. In such an instance, computer programs for performing the respective steps of the procedures of FIGS. 18 to 20 and, if necessary, the procedures of FIGS. 21 and 22, are downloaded from a CD-ROM, magnetic disk, or similar recording medium, or via a communication channel to the computer for executing the programs.
Experimental Example
To demonstrate the effect of the present invention, a characteristic evaluation was made by computer simulations. The parameters used in the simulations are as follows:













Number of Buses
Q = 3


Number of Simultaneously Transmitting Users
N = 3


Number of receive antennas
M = 2


Number of Iterations of Equalization and Decoding
5


Modulation System
BPSK


Channel
Equal-Level 3 Path



Rayleigh


Channel Estimation
Perfect


Decoding Algorithm
Max-Log-MAP


Encoding Rate
2


Constraint Length
3









FIG. 23 shows average BER (Bit Error Rate) characteristics in the cases of using the conventional MRC approximation scheme and schemes of the first and third embodiments of the present invention. Further, β(i) and f(s′n) in the first and third embodiments were set as follows:

β(i)=0 for i=1

β(i)=0.8+0.05×(i−1) for 5≧i≧2

β(i)=1 for i≧6  (31)

f(s′n(k))=0.15×s′n(k)  (32)

It can be seen from FIG. 23 that the scheme of the first embodiment sharply improves the BER characteristic as compared with that in the case of using the MRC approximation scheme. This is considered to be due to the fact that in the case of using the MRC approximation, MRC in the second and subsequent iterations lessens the interference suppressing effect, causing SINR (Signal to Interference Noise Ratio) to fall. In contrast thereto, in the first embodiment of the present invention β(i) is held unchanged in the frame, but as the iteration number increases, β(i) is increased to thereby heightens the interference suppression effect to increase SINR when the iteration number is small.
Further, it can be understood that the scheme of the third embodiment permits further reduction of the BER characteristic. The reason for this is considered to be due to the fact that the resistance to error by interference or noise is further improved by using in the equalization process the a priori information value corresponding to the symbol to be detected as well as the a priori information values corresponding to MAI and ISI.
EFFECT OF THE INVENTION
As described above, according to the present invention, the filter coefficients need not be calculated for each symbol period, but instead they need only to be calculated at the beginning of the period during they are held unchanged. Besides, the degree of interference cancellation is estimated in accordance with information based on the iteration processing state, and the estimated value is used to calculate filter coefficients; hence it is possible to implement an excellent reception characteristic with low computational complexity.

## Claims

1. An adaptive equalizing apparatus comprising:
interference canceling means supplied with a received signal, a channel estimation value and an a priori information stream, for canceling an interference component in said received signal;
a filter part supplied with said interference-cancelled received signal, for suppressing interference and for combining multi-path components;
an interference-cancellation-degree estimation part supplied with information based on the state of iteration processing of said received signal, for estimating the degree of interference cancellation;
update timing generating means supplied with at least an iteration start signal, for generating a filter coefficient update timing signal for each period during which the filter coefficients of said filter part are held unchanged; and
filter coefficient calculating means supplied with the degree of interference cancellation, the channel estimation value and said update timing signal, for calculating the filter coefficients of said filter part upon each generation of said update timing signal.

2. The apparatus of claim 1, which further comprises means for calculating a function value which uses, as a variable, that one of received signals obtained by the previous iteration which is to be detected, and wherein:
said interference canceling means is means which is also supplied with said function value and increases the component of said signal to be detected in said received signals; and
said filter coefficient calculating means is means which is also supplied with said function value and calculates calculating filter coefficients.

3. The apparatus of claim 1 or 2, wherein said degree-of-interference-cancellation estimation part is means which is supplied with the iteration number as said information based on the state of iteration processing and generates the degree of interference cancellation which becomes higher as said iteration number increases.

4. The apparatus of claim 1 or 2, wherein said degree-of-interference-cancellation estimation part is means which is supplied with the iteration number as said information based on the state of iteration processing and, upon each generation of said update timing signal, outputs, as the degree of interference cancellation, a function value which uses, as a variable, a priori information from the previous update timing signal to the current update timing signal.

5. The apparatus of claim 4, wherein said degree-of-interference-cancellation estimation part is means which is supplied with the iteration number as said information based on the state of iteration processing and, upon each generation of said update timing signal, generates the degree of interference cancellation based on the function value of said a priori information and said iteration number, said degree of interference cancellation becoming higher as the function value of said a priori information increases and as said iteration number increases.

6. The apparatus of claim 2, wherein said degree-of-interference-cancellation estimation part is supplied with a receiving energy per information bit, receiving power, a number of transmit and receive antennas, a number of multi-paths, or encoding ratio, or a combination of them, and uses an input also being used for estimation of the degree of interference cancellation.

7. The apparatus of claim 1 or 2, wherein said update timing generating means is means which is also supplied with said channel estimation value and outputs said update timing signal each time the difference between the channel estimation value immediately after the previous filter coefficient calculation and the current channel estimation value exceeds a square sum.

8. The apparatus of claim 1 or 2, which receives signals from N transmitters and performs turbo equalization for each of signal streams from said N transmitters, said N being an integer equal to or greater than 1;
said apparatus comprising:
n external information value generating parts each of which is supplied with the output from said filter part of each signal stream and calculates an external information value; and
N soft-input soft-output decoders each of which is supplied with said external information value from one of said N external information value generating parts, performs soft-input soft-output decoding by use of redundancy concerning error correction added in an encoder of one of said N transmitters and outputs a decoded bit as a temporary or final received signal, and outputs an external information value or log-likelihood ratio of said bit as said a priori information stream; and
wherein equalization and decoding processes are iterated while updating said a priori information value with new values one after another.

9. The apparatus of claim 8, wherein:
said degree-of-interference-cancellation estimation part is means provided for each of said signal streams and supplied with error detection result information from the corresponding one of said soft-input soft-output decoders, said degree-of-interference-cancellation estimation part outputting the degree of interference cancellation estimated from information based on said iteration processing state when said error detection result information indicates the presence of an error and outputting a constant as the degree of interference cancellation when said error detection result information indicates the absence of an error.

10. A program for controlling a computer having a memory storage to function as an adaptive equalizing apparatus which comprises:
interference canceling means supplied with a received signal, a channel estimation value and an a priori information stream, for canceling an interference component in said received signal;
a filter part supplied with said interference-cancelled received signal, for suppressing interference and for combining multi-path components;
an interference-cancellation-degree estimation part supplied with information based on the state of iteration processing of said received signal, for estimating the degree of interference cancellation;
update timing generating means supplied with at least an iteration start signal, for generating a filter coefficient update timing signal for each period during which the filter coefficients of said filter part are held unchanged; and
filter coefficient calculating means supplied with the degree of interference cancellation, the channel estimation value and said update timing signal, for calculating the filter coefficients of said filter part upon each generation of said update timing signal.