# Patent

## Title
Multi-user detection method

## Abstract

A multi-user detection method eliminating interference between users transmitting modulated data of symbols on a transmission channel, each transmission channel including at least one propagation path arriving at an array of reception antennas in a direction of arrival. Each user (a) estimates the signal transmitted by the user from the antenna signals, effecting estimation of the direction of arrival and characteristics of propagation of each path of the transmission channel from the signals; (b) estimates the data transmitted by the user from the estimation of the signal transmitted; (c) estimates the contribution of the user to the signals received by the different antennas from the estimated data and the estimated direction of arrival and propagation characteristics; and (d) subtracts from the antenna signals the contribution estimated at (c) to obtain cleaned antenna signals, supplied by at least a first sequence, used as antenna signals by at least a second sequence.

## Background
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention concerns in general terms a Multi-User Detection (MUD) method. More precisely, the present invention relates to an iterative method of eliminating interference between users (Multiple Access Interference or MAI). The present invention applies more particularly to mobile telephony in DS-CDMA (Direct Sequence-Code Division Multiple Access) mode, that is to say to mobile telephony using a code distribution access mode with direct sequence spectral spreading.
2. Discussion of the Background
In a DS-CDMA mobile telephony system, the separation of the different users is effected by multiplying each user symbol by a spreading sequence peculiar to it, also referred to for this reason as the user signature, the different signatures ideally being chosen so as to be orthogonal. The spreading sequence frequency (chip rate) being greater than the frequency of the symbols, the signal transmitted by each user is distributed (or spread) in the frequency space. On reception, the separation of the signal of a user is effected by means of a filtering adapted to the corresponding signature. This filtering is also referred to as “de-spreading”. The ratio between the band occupied by the spread signal and the band occupied by the information signal is referred to as the spread factor.
The signals employed must have good correlation properties, namely a very pronounced autocorrelation peak and very low intercorrelation values.
The first of these two characteristics enables the received sequence to be synchronised. It is very useful when the transmission channel of a user includes several propagation paths. This is because each path can then be isolated by virtue of a filtering adapted to the signature and to the delay of the path. Advantage can be taken of the propagation diversity within the channel to increase the signal to noise ratio on reception. For this purpose, a bank of adapted filters is used, separating the different paths, and the outputs are combined. The most widespread combination is MRC (Maximum Ratio Combining), which consists of multiplying the signal output from each adapted filter by the conjugate of the complex multiplying coefficient introduced by the channel on the path concerned. The resulting filtering operation is a filtering adapted to the equivalent filter of the channel. Because of its structure, the receiver thus formed is referred to as a rake receiver. Naturally, perfect separation of the path takes place only if the autocorrelation is a Dirac. In practice, however, the separation is not complete and leaves a multipath interference which is also referred to as self noise. FIG. 1 depicts schematically a DS-CDMA system with K users. The data of a user k are spread in frequency by the corresponding frequency in the module 100k before being transmitted over a channel 110k including P paths. On reception, for a given user k, the signals being propagated on the different paths p=1 . . . P of the channel are separated by adapted filters 120k,1 . . . 120k,P (only the battery of filters of the user k has been depicted) before being weighted by a set of complex coefficients Ck,p. The signals thus weighted are summed (140k) and the resulting sum at the output of the rake receiver is subsequently detected in order to provide an estimation of the data of the user k. In the case of a downlink (links from a base station to a mobile terminal) the channels 1 to K are identical whilst they are different in the uplink (links from mobile terminals to the base station). The first case can, from this point of view, be considered to be a particular case of the second.
The second characteristic set out above guarantees a low level of interference between two distinct users. Nevertheless, there too, in practice, the intercorrelation between two signatures is rarely zero. This is particularly the case in a so-called near-far effect situation, where a high-power signal received from a user interferes with the reception of a low-power signal coming from another user. Moreover, when the number of users is high, close to the spread factor, the sum of the interferences of the different users, low if taken in isolation, can have effects which interfere greatly with detection.
In order to combat multi-user interference, several methods have been proposed. A review of this will be found in the article by Simon Moshavi entitled “Multi-user detection for DS-CDMA communications” which appeared in IEEE Communications Magazine, October 1996, pages 124–136. Amongst existing multi-user techniques, the techniques of subtractive elimination (Subtractive Interference Cancellation) have good performance for reasonable complexity in use. The general idea of this is simple: from a first detection at the output of an adapted filter, the contributions to the interference suffered by the other users is reconstructed by respreading. This interference is next subtracted from the signal received in order to supply a cleaned signal at a subsequent detection step. According to the way in which the subtraction is effected, this is known as parallel elimination (PIC, standing for Parallel Interference Cancellation) and serial elimination (SIC, standing for Serial Interference Cancellation) of the interference.
The parallel elimination method is illustrated in FIG. 2: the signal received is filtered by a battery of adapted filters (2001, 2002, . . , 200K), each adapted filter relating to a given user. After detection (210k), the estimated symbols are respread (220k) spectrally by means of the signature of the user in question before being filtered by a filter modelling the transmission channel (230k). There is thus available at the output of (230k) an estimation of the contributory share of the signal received which can be attributed to the user k. From the signal received the sum of the contributory parts of the other users is subtracted (at (240k)) in order to obtain a cleaned signal Sk(1). This cleaned signal can directly be the subject of detection after despreading or the elimination process can be iterated. The detection being of better quality at each iteration, there is then obtained, as the successive iterations continue, signals Sk(i) which are better and better rid of the multi-user interference.
The serial elimination method is illustrated in FIG. 3: the signals received by the different users are first of all ordered in decreasing order of power, that is to say 1, . . . , K. The procedure then consists of successive eliminations of the contributory shares, commencing with the signal with the highest power. For this purpose, the SIC detector has a series of stages in cascade, each eliminating the interference due to a particular user. The first stage works on the antenna signal and each subsequent stage receives as an input the output of the previous stage. Each stage has an adapted filter (300k), a detector (310k), a module (320k) for respreading the symbols, a filter (330k) modelling the transmission channel k and a subtracter (340k) eliminating the contribution due to the user k. Each stage also supplies as an output of the detector (310k) a decision on the received symbol, Ŝk, and the interference elimination process ends at the Kth stage.
Another serial elimination method is detection by Zero-Forcing Decision-Feedback (ZF-DF). According to this method, illustrated in FIG. 4, the signal received is filtered and recombined by a battery of adapted filters (4001, . . . , 400K) before undergoing linear processing (405) consisting of a multiplication by the matrix (FT)−1 where F is the lower triangular matrix obtained by Cholesky decomposition of the correlation matrix R of the signatures of the different users (R=FT.F). The matrix processing has the effect of partially decorrelating the signals of the different users. The signals thus partially decorrelated are then subjected to a serial elimination, after having been classified in decreasing order of amplitude, that is to say A1, . . . , AK. The detector has a plurality of stages, each stage i comprising a detector (410i) whose output is multiplied by multipliers (415i,i+1), . . . ,(415i,K) in order to supply products Ai.Fk,i with i<k, where Fk,i is an element of the matrix F. At the input to each stage (k), there is subtracted (416i,k) the sum




  
    ∑
    
      i
      =
      1
    
    
      k
      -
      1
    
  
  ⁢
  
    
  
  ⁢
  
    
      A
      i
    
    ·
    
      F
      
        k
        ,
        i
      
    
    ·
    
      
        s
        ^
      
      i
    
  




where ŝi is the estimated symbol for the user i, that is to say the sum of the contributions of the previous users i<k. The decision (410k) relating to the symbol transmitted by the user k is taken from the signal thus cleaned. The estimated symbols ŝk of the different users are obtained by progressing from stage to stage.

The techniques set out above can be applied well to the simple situation where the transmission channel of a user has a single path. In this case, the filter modelling the channel can be limited to multiplication by a complex coefficient. When the channels are multi-path, the situation is on the other hand much more complex since it is necessary at the same time to eliminate multi-path interference and multi-user interference. An iterative detector with subtractive elimination of multi-user interference in the presence of multi-paths was proposed in an article by M. C. Reed et al. entitled “Iterative Multiuser detection using antenna arrays and FEC on multipath channels” published in the IEEE journal on Selected Areas in Communications, Vol. 17, No 12, December 1999, pages 2082–2089. Each iteration of the detection comprises an adapted filtering, a formation of channels and a combination of the rake type. The method proposed presupposes however that the coefficients of attenuation, the phase rotations and the directions of arrival of all the paths of all the users are determined. This determination can be effected for example by correlating the pilot symbols emitted by the different users in adapted filters. However, this determination is often imprecise, which results in an imperfect or even erroneous elimination of the multi-user interference.
SUMMARY OF THE INVENTION
One aim of the present invention is to propose a detection method and device which improve the elimination of the multi-user interference in the presence of multi-path channels. A subsidiary aim of the present invention is the simple and precise determination of the attenuation coefficients and the phase rotations relating to the paths of the transmission channels of the different users.
The invention is defined by a multi-user detection method with elimination of interference between users, each user transmitting modulated data in the form of symbols on a transmission channel, each transmission channel (k) comprising at least one propagation path (p) and each propagation path arriving at an array of reception antennae (l) in a direction of arrival θp,k, the method comprising at least one sequence of steps for each user, each sequence itself comprising:
(a) a step of estimating the signal transmitted by the user from the antennae signals, the said step effecting an estimation of the direction of arrival (θp,k) and characteristics (αp,k, νp,k) of propagation of each path (p) of the transmission channel (k) from the said signals;
(b) a step of estimating the data transmitted by the user from the said estimation of the signal transmitted;
(c) a step of estimating the contribution of the user to the signals received by the different antennae from the data estimated at step (b) and the direction of arrival as well as the propagation characteristics estimated at step (a);
(d) an interference elimination step subtracting from the antennae signals the contribution estimated at step (c) in order to obtain cleaned antennae signals; the cleaned antennae signals supplied by at least a first sequence being used as antennae signals by at least a second sequence.
According to a first embodiment, for a given user k, the interference is eliminated by subtracting from the antennae signals the contributions of all the other users.
According to a second embodiment, the users are classified by order of power received and the interference is eliminated by subtracting one after the other the contributions of the different users commencing with the users with the highest powers received.
Advantageously, for each user k, the said sequence comprises, after the step of estimating the said data, a step of deinterleaving followed by a step of channel decoding and channel coding and a step of interleaving the said data.
According to one characteristic of the invention, for each user k, the said sequence comprises, prior to the step of estimating the contribution of the user to the received signals, a step of modulation and spectral respreading by means of the signal which was used to spectrally spread the symbols of the said user.
According to one embodiment of the invention, the estimations of the transmitted signals of the users being considered to be an estimations vector with K components where K is the number of users, the said vector is subjected to a transverse matrix filtering before the decision step.
According to one variant of this embodiment, the estimated and remodulated data of the users being considered to be a vector of symbols with K components, the said symbols vector is subjected to a postcursor matrix filtering and the output of this filtering is subtracted, vector by vector, from the output of the transverse matrix filtering.
Alternatively, the symbols issuing from the modulation step being considered to be a symbols vector with K components, the said symbols vector is subjected to a postcursor matrix filtering and the output of this filtering is subtracted, vector by vector, from the output of the transverse matrix filtering.
According to an example embodiment of the invention, the estimations of the signals transmitted by the different users are subjected to a matrix multiplication by a matrix (FT)−1 before the data estimation step, where FT is the transpose of the lower triangular matrix F obtained by Cholesky decomposition of the signature correlation matrix which was used to spectrally spread the symbols of the said users, the interference being eliminated, for a given user k, in a first phase, by subtracting from the kth component of the matrix product the sum




  
    ∑
    
      i
      =
      1
    
    
      k
      -
      1
    
  
  ⁢
  
    
  
  ⁢
  
    
      A
      i
    
    ·
    
      F
      
        k
        ,
        i
      
    
    ·
    
      
        s
        ^
      
      i
    
  




where Ai is the amplitude of the signal transmitted by the user i, ŝi is the symbol obtained by remodulation of the estimated data of the user i and Fk,i the (k,i)th element of the matrix F, the estimation of the data transmitted by the user k being effected from the kth component after the said subtraction and, in a second phase, by subtracting, from the signals received by the different antennae, the sum of the contributions of all the other users.

Advantageously, for each user k, the step of estimating the signal transmitted by the user, on the transmission channel (k), comprises a formation of channels in the directions of arrival of the different propagation paths (p) of the said channel.
In addition, the channel formation for a propagation path of a transmission channel can place zeros in the directions of arrival of the other propagation paths of the same transmission channel.
The channel formation (520p,k) for a propagation path (p) of a transmission channel (k) can also place zeros in the directions of arrival of all the propagations paths of the other transmission channels.
Advantageously, for each transmission channel (k), the results of formation of channels are weighted (5401,k, . . . , 540P,k) by complex coefficients and then summed, the said coefficients being obtained from the estimated propagation characteristics ({circumflex over (α)}p,k, {circumflex over (ν)}p,k) of the different paths (p) of the transmission channel (k).
According to one characteristic of the invention, for each user k, the directions of arrival and the propagation characteristics of the different paths are estimated from the a priori knowledge of a symbol transmitted by the said user.
According to an important embodiment of the invention, the multi-user detection method comprises the iteration of a set of sequences, each sequence of a user of the second iteration and the following iterations operating on the set of antennae signals where the contributions of the other users have been eliminated at the previous iteration.
Advantageously, at the first iteration, for each user, the directions of arrival and the propagation characteristics of the different paths are estimated from the a priori knowledge of at least one pilot symbol transmitted by the said user and, at the subsequent iterations, this estimation is effected from at least one data item estimated and remodulated at a previous iteration in addition to the said pilot symbol.
In addition, if the propagation characteristics of the different paths are known a priori, the first iteration can operate with channel formation, in omni-directional mode, the channel formation being applied as from the second iteration.
The invention is also defined by a multi-user detection device comprising means adapted to implement the method disclosed above.
The characteristics of the invention mentioned above, as well as others, will emerge more clearly from a reading of the description given in relation to the accompanying Figures, amongst which:



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 depicts schematically a DS-CDMA telecommunications system;
FIG. 2 depicts schematically a multi-user detection device of the PIC type;
FIG. 3 depicts schematically a multi-user detection device of the SIC type;
FIG. 4 depicts schematically a multi-user detection device of the ZF-DF type;
FIG. 5 depicts a receiver of the rake type useful to the device according to the invention;
FIG. 6 depicts a multi-user detection device according to a first embodiment of the invention;
FIG. 7 depicts a multi-user detection device according to a second embodiment of the invention;
FIG. 8 depicts a multi-user detection device according to a third embodiment of the invention;
FIG. 9a depicts a multi-user detection device according to a fourth embodiment of the invention;
FIG. 9b depicts in an equivalent manner a multi-user detection device according to the fourth embodiment of the invention;
FIG. 10 depicts a multi-user detection device according to a fifth embodiment of the invention.



DESCRIPTION OF EXEMPLARY EMBODIMENTS
The general idea at the basis of the invention is to fit into a multi-user detection process the estimation of the complex coefficients (including attenuation and phase rotation) and the directions of arrival of the propagation paths. Thus the interference rejection process benefits from better precision of the estimation of the respective contributions of the different users in the signal received. Conversely, the process of estimating the complex coefficients benefits from the rejection of the multi-user interference by operating on cleaned signals.
The device according to the invention uses a receiver of the rake type illustrated in FIG. 5. Its particularity compared with a conventional rake receiver is to include a beam formation in the directions of arrival of the different paths. The device according to the invention has one receiver of this type per user, only one receiver (500k) being illustrated in FIG. 5. For reasons of simplicity of notation, the different elements of the receiver (500k) do not have the index k. The receiver (500k) receives the outputs of the antennae 1, . . . , L of an array of antennae, preferably linear and uniform, although other types of array can also be envisaged, notably circular arrays. The antennae signals are filtered by a filtering adapted to the signature of the user k in order to despread its contribution to the signal received. More precisely, each antenna output signal is despread in a battery of adapted filters (5101′, . . . , 510P′ where P is the number of paths and l=1 . . . L is the index of the antenna) supplying as an output the signals relating to the different paths of the transmission channel of the user k. The signals corresponding to the same path p=1 . . . P are directed to channel formation means (5201, . . . , 520P) and to channel and direction of arrival estimators (5301, . . ,530P).
An explanation will first of all be given of the function of the estimators (530p), p=1 . . . P.
If the contribution received by the antenna 1, 1=(1, . . . , L) attributable to a path p=1 . . . P of the channel k=1 . . . K is denoted Xl,p,k, it is possible to write:

Xl,p,k(t)=αp,k(t).ei,ξ,t,p,k bk(t)+nl,p,k(t)

with





  
    
      ξ
      
        l
        ,
        p
        ,
        k
      
    
    ⁡
    
      (
      t
      )
    
  
  =
  
    
      
        
          v
          
            p
            ,
            k
          
        
        ⁡
        
          (
          t
          )
        
      
      +
      
        
          (
          
            l
            -
            1
          
          )
        
        ·
        
          
            φ
            
              p
              ,
              k
            
          
          ⁡
          
            (
            t
            )
          
        
      
    
    =
    
      
        
          v
          
            p
            ,
            k
          
        
        ⁡
        
          (
          t
          )
        
      
      +
      
        2
        ⁢
        π
        ⁢
        
          d
          λ
        
        ⁢
        
          (
          
            l
            -
            1
          
          )
        
        ⁢
        
          cos
          ⁡
          
            (
            
              
                θ
                
                  p
                  ,
                  k
                
              
              ⁡
              
                (
                t
                )
              
            
            )
          
        
      
    
  




where bk(t) is the symbol transmitted by the user k, nl,p,k(t) is the assumed white additive Gaussian noise at the antenna l from the path p of the user k, including the thermal noise, the multi-path interference and the multi-user interference, d is the pitch of the array and λ is the wavelength.
The propagation along the path p of a user k is thus modelled by an attenuation coefficient αp,k(t) and a phase rotation νp,k(t). The total phase difference ξl,p,k(t) results on the one hand from the phase rotation νp,k(t) caused by the path p and on the other hand by the difference in working between the antenna l and the reference antenna 1 at the angle of arrival θp,k(t).
The function of the estimator (530p) is to estimate on the one hand the attenuation coefficient αp,k and the phase rotation νp,k and on the other hand the angle of arrival θp,k. The estimator will preferably effect a conjoint channel and direction of arrival estimation in accordance with the method disclosed in the French patent application No. 0011160, filed on Aug. 29, 2001 corresponding to U.S. patent application Ser. No. 09/919,917 filed on Aug. 2, 2001, entitled “Conjoint channel and direction of arrival estimation method” filed on the same date by the applicant. The content of this application is included here by reference. The said conjoint estimation method consists of seeking the values θp,k, αp,k and νp,k such that the quadratic distance Dp,k is at a minimum.




  
    D
    
      p
      ,
      k
    
  
  =
  
    
      ∑
      
        t
        =
        1
      
      T
    
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          l
          =
          1
        
        L
      
      ⁢
      
        
      
      ⁢
      
        
          
          
            
              
                x
                
                  l
                  ,
                  p
                  ,
                  k
                
              
              ⁡
              
                (
                t
                )
              
            
            -
            
              α
              ·
              
                e
                
                  
                    j
                    ⁢
                    
                      
                    
                    ⁢
                    ξ
                    ⁢
                    
                      
                    
                    ⁢
                    l
                  
                  ,
                  p
                  ,
                  k
                
              
              ·
              
                
                  b
                  k
                
                ⁡
                
                  (
                  t
                  )
                
              
            
          
          
        
        2
      
    
  




The estimation is effected in three steps:
Step 1: ξl,p,k is estimated by minimising the quadratic distance Dl,p,k at each antenna:




  
    D
    
      l
      ,
      p
      ,
      k
    
  
  =
  
    
      ∑
      
        t
        =
        1
      
      T
    
    ⁢
    
      
    
    ⁢
    
      
        
        
          
            
              x
              
                l
                ,
                p
                ,
                k
              
            
            ⁡
            
              (
              t
              )
            
          
          -
          
            α
            ·
            
              e
              
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  ξ
                  ⁢
                  
                    
                  
                  ⁢
                  l
                
                ,
                p
                ,
                k
              
            
            ·
            
              
                b
                k
              
              ⁡
              
                (
                t
                )
              
            
          
        
        
      
      2
    
  




Step 2: θp,k and νp,k are estimated from a linear regression on the estimated values {circumflex over (ξ)}l,p,k;
Step 3: from the estimated values {circumflex over (ν)}p,k and {circumflex over (θ)}p,k, finally αp,k is estimated by minimising the quadratic distance




  
    D
    
      p
      ,
      k
    
  
  =
  
    
      ∑
      
        l
        =
        1
      
      L
    
    ⁢
    
      
    
    ⁢
    
      
        D
        
          l
          ,
          p
          ,
          k
        
      
      .
    
  




Thus an estimated value {circumflex over (α)}p,k is obtained.

The estimation is effected in parallel for all the paths p of the users k. The estimated value {circumflex over (θ)}p,k is supplied to the channel former (520p) so that it points its reception beam in the direction of arrival of the path p. The channel formation is conventional and will therefore not be described any further. In a variant embodiment, not shown, each channel former (520p) also receives the estimated values {circumflex over (θ)}p′,k supplied by the other estimators (530p′), p′≠p, paths p′ of the same user. This enables the channel former (520p) to place zeros in the reception diagram for the directions concerned ({circumflex over (θ)}p,k, p′≠p) so as to better to separate the signals received from the different paths. In a variant which is also not shown, each channel former (520p) of a user k receives the estimated values {circumflex over (θ)}p′,k′(k′≠k) of all the directions of arrival of the other users so as also to be able to place zeros in these directions.
The estimated values {circumflex over (α)}p,k and {circumflex over (ν)}p,k are transmitted to a complex multiplier (540p) which multiplies the output signal of the channel former (530p) by the complex coefficient {circumflex over (α)}p,k,.e−j{circumflex over (ν)}p,k. The outputs of the P multipliers are then summed in an adder (550) in order to supply an output of the MRC (Maximum Ratio Combining) type. The operation performed by the receiver (500k) is then an adapted filtering. If instead of the adding, a simple maximum of the values output from the different branches is calculated, the expression “adapted filtering” is no longer appropriate (it is no longer a filtering). Nevertheless, the receiver (500k), will hereinafter be referred to as a receiver “of the rake type” whatever the type of processing output from the branches. In all cases, the output signal Sk represents an estimation of the contribution of the user k to the signal received by the array.
FIG. 6 depicts a multi-user detection device according to a first example embodiment of the invention. The multi-user interference is eliminated therein according to a parallel mode.
The outputs of the antennae 1 . . . L in the array are all connected to a battery of receivers of the rake type (6001, . . . , 600K) whose structure was described in FIG. 5. The signals obtained at the output of the receivers are then subjected to a sequence of processing steps comprising: a soft or hard decision step by means of detectors (6101, . . . , 610K) supplying in soft or hard form the data transmitted by the different users, followed by a step (6201, . . . , 620K) of deinterleaving the data thus obtained, a channel decoding/encoding step (6301, . . . , 630K) and (6401, . . . ,640K) providing a more reliable estimation of the data transmitted. Advantageously, this operation is performed by means of Soft Input Soft Output (SISO) decoding. Re-encoding is not necessary if the encoded data are recovered directly at the decoding output. For example, if an algorithm of the SOVA (Soft Output Viterbi Algorithm) type is used at (6301, . . . , 630K) the encoded data can be recovered directly along the maximum likelihood path. The data thus estimated are next once again interleaved at (650k) before being remodulated and the symbols spectrally respread at (660k) by means of the signature of the user k. Naturally, if the decoding used is of the soft value type, the remodulation will also be “soft” in the sense that it will supply symbols resulting from the weighting of symbols of the constellation, weighted by their respective a posteriori possibilities. Each respread symbol ŝk is then filtered by a filter (670k) modelling the transmission channel k and taking into account the geometry of the array of antennae. More precisely, the filter (670k) calculates the following expressions:




  
    x
    
      l
      ,
      k
    
  
  =
  
    
      
        ∑
        
          p
          =
          1
        
        P
      
      ⁢
      
        
      
      ⁢
      
        
          S
          ^
        
        ⁢
        
          k
          ·
          
            α
            
              p
              ,
              k
            
          
          ·
          
            e
            
              
                j
                ⁢
                
                  
                
                ⁢
                ξ
                ⁢
                
                  
                
                ⁢
                l
              
              ,
              p
              ,
              k
            
          
        
        ⁢
        
          
        
        ⁢
        for
        ⁢
        
          
        
        ⁢
        l
      
    
    =
    
      1
      ⁢
      
        
      
      ⁢
      ...
      ⁢
      
        
      
      ⁢
      L
    
  




where αp,k and ξl,p,k are the respective values of the coefficients of attenuation and the phase differences obtained by the conjoint estimation module of the receiver (600k).
The L-tuplet




  (
  
    
      ∑
      
        
          k
          ′
        
        ≠
        k
      
    
    ⁢
    
      
    
    ⁢
    
      
        χ
        ⁢
        
          
        
      
      
        l
        ,
        
          k
          ′
        
      
    
  
  )




is then deducted at (680k), for each user k, from the L-tuplet of signals (Xl) received by the L antennae, in order to eliminate the contribution due to the other users. Thus K L-tuplets of antennae signals with the multi-user interference partly removed are obtained. The elimination process can be reiterated by repeating the sequence (600k) . . . (670k) from these signals and deducting, at each end of iteration, from the signals (Xl) received by the antennae, the newly calculated contributions. Each sequence of a user of the second iteration and of the following iterations operates on a set (L-tuplet) of antennae signals where the contributions of the other users were eliminated at the previous iteration. The estimation of the symbols transmitted by the different users thus gains in reliability as the iterations continue.

It should be noted that the operations of deinterleaving, channel decoding/encoding, and interleaving are optional (the units (620k, 630k, 640k, 650k are then absent). The spectral respreading can be applied directly to the estimated symbol. However, the use of a channel decoding (with of course channel coding corresponding to the transmission) reduces the error rate and therefore improves the reliability of the estimation of the interference and, consequently, of the symbols transmitted.
In addition, having available decisions on the coded bits or, better still, reliabilities on the coded bits, it is possible to use these hard or soft values, after having remodulated them, as new pilot symbols for the following iteration. If there were initially available, for example, 40 pilot symbols distributed amongst 200 coded symbols, there are then available, as from the second iteration, 240 pilot symbols. The increased number of pilots improves the quality of the estimation still further.
Finally, if the characteristics of the channels are already known, that is to say if the values αp,k and ξt,p,k are known, it is possible to dispense with the use of the pilots for the estimation of the directions of arrival. This is because the first iteration can operate with an omni-directional antenna array diagram (that is to say without the formation of channels), in which calculating the {circumflex over (θ)}p,k values is not necessary. Decoding values are then available for effecting this calculation as from the second iteration and applying a channel formation from these values.
FIG. 7 illustrates a multi-user detection device according to a second example embodiment of the invention.
Unlike FIG. 6, the elimination of the interference is here effected in a series of K steps, K being the number of users. The contributions of the different users in the signals received are ordered by increasing order of power. For each user, the moduli squared of the outputs of the adapted filters of the user connected to the different antennae will for example be added and the sums obtained will be compared.
To simplify the diagram a simple stage has been depicted, each stage effecting one elimination step. Each stage has at an input a receiver of the rake type (700k) as described in FIG. 5. The receiver of the first stage receives the L antennae signals and the receiver of a subsequent stage receives the L signals output from the previous stage. At the output of the receiver, there are effected, as already described to FIG. 6, a soft or hard decision (710k), a deinterleaving (720k), a channel decoding/re-encoding (730k) and (740k), an interleaving (750k), a remodulation and a respreading (760k) of the estimated symbols and then a channel filtering (770k). The filters (770k) are identical to the filters (670k) already described. The L output signals of (770k) are next subtracted at (780k) from the L input signals of stage k in order to supply the L input signals of stage k+1. Thus the contributions of the different users are successively eliminated commencing with those which create the greatest interference. The outputs of the channel filters (770k) of the different stages 1 . . . K can be used, like those of the channel filters (670k) of FIG. 6, in order to regenerate, for each user k, its contribution to the antennae signals, in the form of an L-tuplet (Xl,k). The contributions of the different users are subtracted one by one by the adders (780k) of the different stages.
It can be envisaged causing a serial elimination phase (FIG. 7) be followed by a parallel elimination phase (FIG. 6). More generally, the channels can be grouped together by “packets” corresponding to users in the same spatial region or with adjacent powers, the interferences between packets can be dealt with first of all, and then the interferences between users of the same packet next. The interpacket processing can be of a type (serial or parallel) distinct from the intrapacket one.
FIG. 8 depicts a multi-user detection device according to a third example embodiment of the invention.
This embodiment uses the ZF-DF elimination principle disclosed in the introduction. The outputs of the antennae 1 . . . L are connected to a battery of K receivers 800l to 800k of the rake type with the structure described in FIG. 5. The output signals of the receivers are subjected to a matrix-type multiplication (805) by the matrix (FT)−1 where F is the lower triangular matrix obtained by Cholesky decomposition of the correlation matrix R of the signatures of the different users (R=FT.F). Each output line of the matrix multiplication comprises a series of modules (810k) to (870k) with the same functions as the corresponding modules (710k) to (770k). The module corresponding to 760K has been depicted here in two parts, namely (861k) for the modulation function and (862k) for the spectral respreading function. The output signal of an interleaving module is subtracted at the respective inputs of the subsequent stages k′, k′>k at (807k′,k), after multiplication at (806k′,k) by the coefficient Ak..Fk,k′. The choice of the output of (861k) rather than the output of (810k) remodulated as in the conventional ZF-DF method makes it possible to advantageously profit from the channel decoding in order to refine the elimination of interference at the following stage. An L-tuplet (χl,k) is obtained at the output of each channel filter (870k). As in the parallel elimination method, for each user k, the L-tuplet




  (
  
    
      ∑
      
        
          κ
          ′
        
        ≠
        κ
      
    
    ⁢
    
      
    
    ⁢
    
      
        χ
        ⁢
        
          
        
      
      
        l
        ,
        
          κ
          ′
        
      
    
  
  )




is deducted at (880k), from each L-tuplet of antenna output signals (p), in order to eliminate the contribution due to the users other than k. An elimination of the serial type and an elimination of the parallel type are then carried out. As in the parallel elimination method, the process described can be iterated.

FIG. 9a depicts a multi-user detection device according to a fourth embodiment of the invention.
This embodiment extends the parallel elimination mode in the sense that it now includes a “multi-equalisation” function which will be explained later. The reference numbers indicated are equivalents to those of FIG. 6 when they correspond to identical functions. The device depicted in FIG. 9a nevertheless differs from that in FIG. 6 in that it comprises a linear filter (905) upstream of the decision modules (910k). The purpose of this filtering is to take into account the outputs of the receivers of the rake type (900k) at different sampling times in the elimination of the interference. The filter (905) is a transverse linear time filter which fulfils a role equivalent to that of a conventional transverse linear equaliser when a single user is considered. Unlike the latter, however, the filter (905) is a matrix filter which operates on vectors of size K and therefore uses matrices of size K×K instead of scalar coefficients, the number of such matrices corresponding to the number of time slots of the filter. The diagonal coefficients of the different matrices allow equalisation proper whilst the coefficients outside the diagonals make it possible to take into account the time responses of the different channels in the rejection of the interference between users. Just like its single-user homologue, the transverse filter (905) can be optimised by a known technique such as that of Zero Forcing (ZF) or Minimum Mean Square Error (MMSE).
FIG. 9b depicts in an equivalent fashion the device of FIG. 9a, showing the vectorial processing character of the different modules (900) to (980), each module respectively integrating the modules (9001, . . . , 900K), . . . (9801, . . . , 980K) of FIG. 9a (for example, the module (900) is a battery of receivers of the rake type). The matrix filter (905) naturally remains unchanged.
FIG. 10 depicts a multi-user detection device according to a fifth embodiment of the invention.
This embodiment transposes the technique of equalisation by decision feedback (DF) to the multi-user context. The modules (1000), (1010), . . . (1080) are modules identical to the modules (900), (910), . . . , (980) of FIG. 9, each module operating, as stated, on a vector with K components. The module corresponding to 960 has been depicted here in two parts (1061) and (1062) in order to separate the modulation function (1061) from the spectral spreading function (1062). The device comprises a precursor transverse filter (1005) identical to the filter (905) and a postcursor filter (1007) filtering the reinterleaved and remodulated output of the module (1061). The output of the postcursor filter (1007) is subtracted (at 1006) from the output of the precursor module (1005) and the result is provided as an input to the decision module (1010). The assembly consisting of the transverse filter (1005) and feedback filter (1007) can there also be optimised according to a known technique, ZF or MMSE for example. In the first case, this embodiment can be seen as a generalisation of the ZF-DF mode disclosed in FIG. 8.
The postcursor filter (1007) must be causal so as to ensure that the contribution of time samples not yet available at the time of the subtraction from the current sample has not been deducted. This can notably impose constraints on the length of the interleaving. Alternatively, the postcursor filter (1007) will filter the output of the remodulated decision module (1010), which will make it possible to relax the causality constraint at the cost nevertheless of abandoning the benefit of channel decoding in the evaluation of the intersymbol interference by the postcursor filter.
The embodiments illustrated in FIGS. 9 and 10 both use a “multi-equalisation” derived from the single-user equalisation symbol by symbol. It is however clear to a person skilled in the art that the invention is also capable of extension to the family of techniques of equalisation with symbol sequence estimation, namely MLSE (Maximum Likelihood Sequence Estimation), DDFSE (Delayed Decision Feedback Sequence Estimation), RSSE (Reduced State Sequence Estimation) etc. All these techniques are also transposable by means of the invention to the multi-user situation.
Although the invention has been essentially illustrated, for reasons of convenience, by means of modules executing certain functions, it is clear however that all or only some of these functions can be executed by a processor programmed for this purpose.

## Claims

1. A multi-user detection method that eliminates interference between users, each user transmitting a signal of modulated data in a form of symbols on a transmission channel, each transmission channel including at least one propagation path and each propagation path arriving at an array of reception antennas in a direction of arrival, the method comprising:
executing at least one sequence for each user, each sequence comprising:
(a) estimating the signal transmitted by the user from signals received at antennas, the estimating (a) effecting an estimation of a direction of arrival and characteristics of propagation of each path of the transmission channel from the signals;
(b) estimating the data transmitted by the user from the estimation of the signal transmitted;
(c) estimating a contribution of the user to the signals received by the different antennas from the data estimated at the estimating (b) and the direction of arrival and the propagation characteristics estimated at the estimating (a); and
(d) subtracting from the signals the contribution estimated at the estimating (c) to obtain cleaned antenna signals, the cleaned antenna signals supplied by at least a first sequence being used as antenna signals by at least a second sequence.

2. A multi-user detection method according to claim 1, wherein, for a given user, the interference is eliminated by subtracting from the antenna signals the contributions of all the other users.

3. A multi-user detection method according to claim 1, wherein the users are classified by order of power received and the interference is eliminated by subtracting one after the other the contributions of the different users commencing with the users with the highest powers received.

4. A multi-user detection method according to claim 1, wherein, for each user, the sequence comprises, after the estimating (b) the data, a deinterleaving followed by a channel decoding, a channel coding, and interleaving the data.

5. A multi-user detection method according to claim 1, wherein, for each user, the sequence comprises, prior to the estimating (c) the contribution of the user to the received signals, modulation and spectral respreading by the signal that was used to spectrally spread the symbols of the user.

6. A multi-user detection method according to claim 5, wherein, the estimating (a) of the transmitted signals of the users utilizes an estimation vector with K components, in which K is a number of users, the estimation vector being subjected to a transverse matrix filtering.

7. A multi-user detection method according to claim 6, wherein the estimated data transmitted by the users comprises a vector of symbols with K components, the vector of symbols being subjected to a postcursor matrix filtering and an output of this filtering is subtracted, vector by vector, from an output of the transverse matrix filtering.

8. A multi-user detection method according to claim 6, wherein the symbols issuing from the modulation are symbols vector with K components, the symbols vector being subjected to a postcursor matrix filtering, and an output of this filtering is subtracted, vector by vector, from an output of the transverse matrix filtering.

9. A multi-user detection method according to claim 4, wherein the estimating (a) the signals transmitted by the different users is subjected to a matrix multiplication by a matrix (FT)−1 before the data estimating (b), where FT is transpose of a lower triangular matrix F obtained by Cholesky decomposition of a signature correlation matrix that was used to spectrally spread the symbols of the users, the interference being eliminated, for a given user k, in a first phase, by subtracting from the Kth component of the matrix product sum




  
    
      ∑
      
        i
        =
        1
      
      
        k
        -
        1
      
    
    ⁢
    
      
    
    ⁢
    Ai
  
  ,
  Fk
  ,
  i
  ,
  
    
      S
      ^
    
    ⁢
    i
  
  ,




in which Ai is amplitude of the signal transmitted by the user i, ŝi is the symbol obtained by remodulation of the estimated data of the user i, and Fk,i is the (k,i)th element of the matrix F, the estimating (a) the data transmitted by the user k being effected from the kth component after the subtraction and, in a second phase, by subtracting, from the signals received by the different antennas, a sum of contributions of all the other users.

10. A multi-user detection method according to claim 1, wherein, for each user k, the estimating (a) the signal transmitted by the user, on the transmission channel, comprises forming channels in the directions of arrival of the different propagation paths.

11. A multi-user detection method according to claim 10 wherein the channel formation for a propagation path of a transmission channel places zeros in the directions of arrival of other propagation paths of the same transmission channel.

12. A multi-user detection method according to claim 11, wherein the channel formation for a propagation path of a transmission channel also places zeros in the directions of arrival of all the propagations paths of the other transmission channels.

13. A multi-user detection method according to claim 10, wherein, for each transmission channel, results of formation of channels are weighted by complex coefficients and are then summed, the coefficients being obtained from the estimated propagation characteristics of the different paths of the transmission channel.

14. A multi-user detection method according to claim 1, wherein, for each user, the directions of arrival and the propagation characteristics of the different paths are estimated from a priori knowledge of a symbol transmitted by the user.

15. A multi-user detection method according to claim 14, further comprising performing iterations of said executed at least one sequence a second iteration and following iterations operating on the set of antenna signals where the contributions of the other users have been eliminated at the previous iteration.

16. A multi-user detection method according to claim 15, wherein, at the first iteration, for each user, the directions of arrival and the propagation characteristics of the different paths are estimated from a priori knowledge of at least one pilot symbol transmitted by the user and, at subsequent iterations, the estimating is effected from at least one data item estimated and remodulated at a previous iteration in addition to the pilot symbol.

17. A multi-user detection method according to claim 15, wherein, the propagation characteristics of the different paths being known a priori, the first iteration operates without channel formation, in omni-directional mode, the channel formation being applied as from the second iteration.