# Patent

## Title
Sampling method for a spread spectrum communication system

## Abstract

Method for decoding a signal sent over a bandwidth-expanding communication system, where both channel estimation and signal detection are carried out on a set of samples generated by sampling the received signal at a sub-Nyquist rate, thus allowing for a significant reduction of the complexity of the sampling device of receivers using said method, as well as a significant reduction of their computational requirements.

## Background
The present invention relates to a method for decoding signals sent over a bandwidth-expanding communication system, said method allowing to perform both channel estimation and signal detection. The present invention also relates to a receiver using said method as well as to a communication system including said receiver.
A communication system is defined to be bandwidth-expanding if the transmitted signal occupies a bandwidth much larger than the minimum bandwidth required for sending the information contained in said transmitted signal. Bandwidth-expanding communication systems, such as Code Division Multiple Access (CDMA) communication systems or Ultra-Wide Band (UWB) communication systems for example, possess many intrinsic advantages over conventional communication systems, among which are selective addressing capability, high-resolution ranging, low-density power spectra for signal hiding, interference rejection, etc.
In a CDMA communication system, for example, bandwidth expansion is accomplished by means of a spreading code, often called a coding sequence, which is independent of the information data to be sent. Each symbol (information bit) of a signal sent over a CDMA communication system is coded with a coding sequence. The number of chips Nc in the coding sequence is referred to as the spreading factor or the processing gain of the communication system. The chip rate of the transmitted signal is thus Nc times higher than its symbol rate. Coding an information signal by the coding sequence therefore expands the signal's bandwidth by the value of the spreading factor Nc.
The spreading factor of a bandwidth-expanding communication system is typically a large number so as to provide said system with the above mentioned advantages over conventional communication systems.
In a CDMA communication system for example, the spreading factor Nc, or processing gain, determines the maximum number of users of the system. Namely, each user of the communication system is assigned a unique coding sequence which must have a low cross correlation with the other users' coding sequences, in order to minimize interference between users. In the ideal case, the user's codes are chosen from a set of orthogonal sequences. Therefore, the more users in the communication system, the longer these sequences must be, thus increasing the spreading factor Nc.
As shown in FIG. 1, the signals xk(t) sent by the users k over the bandwidth-expanding communication system are first encoded with a user specific coding sequence sk(t) by encoders 50 and then transmitted over a transmission channel c comprising emitters 60 and at least one receiver 61. The emitters 60 and the at least one receiver 61 can be for instance radio emitters and receivers working with amplitude or frequency modulation of a carrier signal. The received wideband signal y(t), which is a superposition of all signals 10 transmitted by the active users k over the transmission channel c must be decoded at the receiver's side in order to retrieve the signal xk(t) sent by each user k of the system. For example, a conventional analog CDMA receiver 70 comprises a bank of analog matched filters fk, each matched to a specific user's coding sequence sk(t). The received wideband signal y(t) is filtered in parallel by each filter fk. The information bits of the signal xk(t) sent by each user k can then be retrieved from the output signal of the corresponding filter fk. This works well if there are few users with almost orthogonal coding sequences and if all transmitted signals have equal power levels. However, in the case when these power levels are not equal, the standard detector becomes almost useless. This is known as the near-far problem, and is currently usually alleviated by using for example complex power-control schemes, multiuser detection schemes, RAKE receivers, adaptive antenna arrays or 2-D RAKE receivers.
Current trend in design of communication systems is to implement as many parts of receivers as possible in digital hardware. The main reason is the fact that digital circuits are cheaper, faster and smaller. These receivers however imply that the received continuous-time signal must be first converted into a discrete-time signal by sampling. Defining the bandwidth of the received signal to be between the first two zeros in the signal's frequency spectrum, then according to the Shannon's sampling theorem, the sampling frequency must be at least twice the maximum frequency of the signal. The required minimal sampling frequency defined by this theorem, commonly referred to as the Nyquist frequency, increases with the bandwidth of the signal to be sampled.
For example, in a CDMA communication system, this means that the sampling frequency must be greater or equal to twice the chip rate of the received signal. In practice, however, in order to perform good signal detection even in noisy or fading multipath environments, the sampling frequency used by most current receivers is at least four times higher than the chip rate, thus requiring said receivers to include very fast and therefore complex and expensive analog sampling devices. Faster sampling devices have furthermore high power consumption and can hardly be integrated in mobile battery powered receivers.
In the case of a CDMA communication system, as already mentioned, the near-far problem can be alleviated by using for example multiuser detection schemes, RAKE receivers, adaptive antenna arrays or 2-D RAKE receivers, thus improving the system's performances. These methods can be implemented in digital receivers as well. However, they include sophisticated signal processing techniques that require exact knowledge of one or several parameters of the transmission channel, such as relative delays of different users' signals with respect to a reference in the receiver, amplitude attenuations of these signals along the different propagation paths, their direction-of-arrival at the receiver, etc.
Estimation of these parameters, referred to as channel estimation, is crucial in all bandwidth-expanding, or spread-spectrum communication systems, but at the same time is the hardest part of system design. In radio communication systems, for example, channel estimation, which can be performed during a dedicated training phase, represents the major problem, particularly in the case when a mobile system is subject to multipath fading, that is, when the transmitted signal follows different propagation paths from the emitters to the receiver, each path having different attenuation characteristics, delays and directions-of-arrival. The existing solutions typically require sampling the received signal at a high sampling frequency at the receiver's side, the sampling frequency being usually a multiple of the signal's chip rate, thus generating an excessive set of samples during the training phase. The propagation parameters are then estimated from this set of samples, by solving an optimization problem that involves large dimension matrices and complicated temporal and/or spatial operations, thus making this approach computationally intensive and sometimes unaffordable in real-time equipment. Once the propagation parameters have been estimated for the signals transmitted by all users over the transmission channel, the digital receiver can proceed with signal detection, that is, retrieving the information sent by each user.
An aim of the present invention is to provide a method for decoding a signal sent over a bandwidth-expanding communication system, that is, a method for performing both channel estimation and signal detection, said method allowing the design of digital receivers comprising a sampling device with reduced complexity and cost compared to the complexity and cost of the sampling devices of current digital receivers, while retaining equivalent decoding performances.
Another aim of the present invention is to provide a decoding method for signals sent over a bandwidth-expanding communication system, allowing the design of digital receivers with reduced computational requirements compared to the computational requirements of current digital receivers, while retaining equivalent decoding performances.
These aims are achieved by a decoding method and a related receiver comprising the features of the corresponding independent claims, features of preferred embodiments being described in the dependant claims.
In particular, the method according to the invention allows the decoding, that is, both channel estimation and signal detection, of a signal sent over a bandwidth-expanding communication system from a set of sampled values generated by sampling the received wideband signal with a sampling frequency lower than the sampling frequency given by the Shannon's sampling theorem, but greater than the rate of innovation p of said sent signal, thus allowing a receiver using this method to sample the received signal at a sub-Nyquist rate and still allowing an exact reconstruction of the sent signal.
With the method according to the invention, all the necessary computational steps for channel estimation and/or for signal detection are performed on the basis of a significantly reduced set of sampled values compared to the set of sampled values needed by current digital receivers, thus allowing a significant reduction of the computational requirements of the digital receiver using the method according to the invention compared to the computational requirements of current receivers having equivalent performances.
In particular, during the training phase, the method according to the invention allows estimation of the propagation parameters, that is, relative delays of different users' signals with respect to a reference in the receiver, propagation coefficients along the different propagation paths in the case when the communication system is subject to multipath fading and direction-of-arrival of the different signals, from a significantly reduced set of sampled values compared to the set of sampled values needed by current digital receivers.
The minimal sampling frequency required by the method according to the invention is determined by the rate of innovation p of the received signal. The rate of innovation p of a signal is defined as the number of degrees of freedom of the signal per unit of time. For example, in the case of a periodic stream of Z weighted pulses (Diracs) per period T, the signal is fully specified by the Z amplitudes and the Z locations of the Diracs of one period T. That is, the number of degree of freedom of this signal is 2Z per period T, and its rate of innovation is therefore ρ=2Z/T. In the case of a signal sent by a user k over a bandwidth-expanding communication channel, given a known spreading function, the wideband signal transmitted by said user k is entirely determined by the sent information or sent symbols. In the single-user case, the number of degrees of freedom of the received wideband signal is therefore equal to the number of degrees of freedom of the sent signal, that is the number of symbols sent, and the rate of innovation ρ of the received signal is equal to the number of symbols sent by the user k per unit of time. The rate of innovation ρ of the received signal y(t) is therefore equal to its symbol rate 1/Tb, which, as explained before, is lower than its chip rate 1/Tc by the spreading factor. In the multi-user case, the rate of innovation of the received signal is equivalent to the addition of the rates of innovation of the K signals sent by the K users k. The rate of innovation ρ of the received signal y(t) is then equal to the number K of symbols sent by the K users k per unit of time, the rate of innovation ρ of the received signal y(t) is therefore equal to its information rate K/Tb. The number K of users k being typically significantly smaller than the spreading factor Nc, the rate of innovation p of the received signal is still significantly lower than its chip rate 1/Tc.



The invention will be better understood with the help of the FIGS. 1 to 5.
FIG. 1 which has been previously described illustrates a CDMA system including a known analog receiver.
FIG. 2 diagrammatically represents a bandwidth-expanding communication channel, for example a CDMA system.
FIG. 3 illustrates the concept of multipath propagation from the emitter to the receiver within a transmission channel.
FIG. 4 represents the steps performed by the processing device w of a digital receiver r using the method according to the invention.
FIG. 5 illustrates the principle of an array of antennas.



In the following of the specification and claims, the terms communication system and communication channel are equally used, unless otherwise specified.
In its preferred embodiment, the decoding method according to the invention is applied to the decoding of a signal sent over a CDMA communication channel, said channel including a receiver using the method according to the invention.
FIG. 2 diagrammatically represents a CDMA system with a number K of users k operating over a transmission channel c. The signal x(t) sent by each user k is encoded with the user specific coding sequence sk(t) by an encoder 50, thus generating a wideband signal 10. This wideband signal 10 is transmitted to the receiver r, for example using frequency or amplitude modulation of a carrier signal. At the receiver r, the received signal y(t) after demodulation is composed of the superposition of all wideband signals 10 transmitted by the K users k. The signal is filtered with a lowpass filter f, that is, it is convolved with a filtering signal φ(t), for instance a bandlimited sinc signal. The filtered signal 12 is then sampled at a regular sampling frequency fs=1/Ts, resulting in the time-continuous sampled signal ys(t). The sampled values y[nTs] are extracted from this time-continuous sampled signal ys(t) by a continuous-to-discrete converter d and the spectral values Y[m] of the time-continuous signal ys(t) are computed from these sampled values y[nTs], for instance by using the Fast Fourier Transform (FFT) method. The spectral values Y[m] are then used by the processing device w either to estimate the values of the propagation parameters of the transmission channel c during the training phase, or to retrieve the information sent by each user k in the detection phase, as explained below.
FIG. 3 diagrammatically represents the functioning of the processing device w, first during the training phase 30 and then during the subsequent detection phase 40.
During the training phase 30, the processing device w solves a one-dimensional estimation problem including a set of spectral values Y[m] of the sampled signal ys(t), the known spectral values Sk[m] of each user's coding sequence sk(t) and the known values of the symbols bk(h) of the training sequences bkt sent by each user k, in order to determine the propagation parameters of the transmission channel c. In the preferred embodiment of the method, the estimated propagation parameters are the delays τk(l) and the amplitude attenuations ak(l) induced by the transmission channel c on the signals sent by the users k, which in this phase are the coded training sequences bkt, and transmitted along the different propagation paths l. The spectral values Sk[m] of each user's coding sequence sk(t) can be computed by sampling said coding sequence sk(t) at the same sampling frequency fs as the one used for sampling the received signal y(t), and applying, for instance, the FFT method to the generated set of sampled values sk[nTs]. These spectral values sk[nTs] can be stored for instance in a memory in the receiver r.
During the detection phase 40, the processing device w solves a second estimation problem including a second set of spectral values Y[m] of the sampled signal ys(t), the previously calculated values of the propagation parameters ak(l) and τk(l) and the known spectral values Sk[m] of each user's coding sequence sk(t), in order to determine the information sent by the users k, that is the value of the sent symbols bK.
The concept of multipath fading transmission channel is illustrated by FIG. 4 which shows how a signal transmitted by a user k can follow different propagation paths l with different attenuation properties and propagation delays. Each copy of the transmitted signal 10 reaching the receiver r through a different propagation path l has therefore a possibly different complex amplitude attenuation ak(l) and a possibly different relative delay τk(l) with respect to a reference in the receiver r. The estimated maximal number of paths l that each transmitted signal 10 can follow within a transmission channel is at most equal to L. The transmission channel is assumed to vary slowly, which means that its propagation parameters ak(l) and τk(l) are considered constant during the whole training phase.
In the following, the preferred embodiment of the method according to the invention will be described in more detail and it will be demonstrated how the method according to the invention allows the decoding of a signal sent over a bandwidth-expanding communication system, by taking samples of the received signal y(t) with a sampling frequency fs lower than the sampling frequency given by Shannon's sampling theorem, but greater than the rate of innovation ρ of said signal.
With the signature sequences sk(t) (s1(t), s2(t), . . . , sK(t)) assigned to each of the K users k and with b1, b2, . . . , bK the symbols bk sent by the K users k during the duration Tb of a symbol bk, and assuming that there are at most L propagation paths l for each signal transmitted by a user k, the received signal y(t) during this period of time, after demodulation, can be expressed as:




  
    y
    ⁡
    
      (
      t
      )
    
  
  =
  
    
      
        b
        
          
            
          
          ⁢
          1
        
      
      ⁡
      
        [
        
          
            
              a
              
                
                  
                
                ⁢
                1
              
              
                (
                1
                )
              
            
            ⁢
            
              s
              
                
                  
                
                ⁢
                1
              
            
            ⁢
            
              (
              
                t
                -
                
                  τ
                  
                    
                      
                    
                    ⁢
                    1
                  
                  
                    (
                    1
                    )
                  
                
              
              )
            
          
          +
          
            
              a
              
                
                  
                
                ⁢
                1
              
              
                (
                2
                )
              
            
            ⁢
            
              s
              
                
                  
                
                ⁢
                1
              
            
            ⁢
            
              (
              
                t
                -
                
                  τ
                  
                    
                      
                    
                    ⁢
                    1
                  
                  
                    (
                    2
                    )
                  
                
              
              )
            
          
          +
          ...
          +
          
            
              a
              
                
                  
                
                ⁢
                1
              
              
                (
                L
                )
              
            
            ⁢
            
              s
              
                
                  
                
                ⁢
                1
              
            
            ⁢
            
              (
              
                t
                -
                
                  τ
                  
                    
                      
                    
                    ⁢
                    1
                  
                  
                    (
                    L
                    )
                  
                
              
              )
            
          
        
        ]
      
    
    +
    
      
        b
        
          
            
          
          ⁢
          2
        
      
      ⁡
      
        [
        
          
            
              a
              
                
                  
                
                ⁢
                2
              
              
                (
                1
                )
              
            
            ⁢
            
              s
              
                
                  
                
                ⁢
                2
              
            
            ⁢
            
              (
              
                t
                -
                
                  τ
                  
                    
                      
                    
                    ⁢
                    2
                  
                  
                    (
                    1
                    )
                  
                
              
              )
            
          
          +
          
            
              a
              
                
                  
                
                ⁢
                2
              
              
                (
                2
                )
              
            
            ⁢
            
              s
              
                
                  
                
                ⁢
                2
              
            
            ⁢
            
              (
              
                t
                -
                
                  τ
                  
                    
                      
                    
                    ⁢
                    2
                  
                  
                    (
                    2
                    )
                  
                
              
              )
            
          
          +
          ...
          +
          
            
              a
              
                
                  
                
                ⁢
                2
              
              
                (
                L
                )
              
            
            ⁢
            
              s
              
                
                  
                
                ⁢
                2
              
            
            ⁢
            
              (
              
                t
                -
                
                  τ
                  
                    
                      
                    
                    ⁢
                    2
                  
                  
                    (
                    L
                    )
                  
                
              
              )
            
          
        
        ]
      
    
    +
    ...
    +
    
      
        b
        K
      
      ⁡
      
        [
        
          
            
              a
              K
              
                (
                1
                )
              
            
            ⁢
            
              
                s
                K
              
              ⁡
              
                (
                
                  t
                  -
                  
                    τ
                    K
                    
                      (
                      1
                      )
                    
                  
                
                )
              
            
          
          +
          
            
              a
              K
              
                (
                2
                )
              
            
            ⁢
            
              
                s
                K
              
              ⁡
              
                (
                
                  t
                  -
                  
                    τ
                    K
                    
                      (
                      2
                      )
                    
                  
                
                )
              
            
          
          +
          ...
          +
          
            
              a
              K
              
                (
                L
                )
              
            
            ⁢
            
              
                s
                K
              
              ⁡
              
                (
                
                  t
                  -
                  
                    τ
                    K
                    
                      (
                      L
                      )
                    
                  
                
                )
              
            
          
        
        ]
      
    
  




that is, the received signal y(t) is a superposition of multiple copies of the signals transmitted by the K users k over the transmission channel c, each copy having a possibly different amplitude attenuation ak(l) and a possibly different relative delay τk(l) with respect to a reference at the receiver r. The received signal y(t) can be written more compactly as




  
    y
    ⁡
    
      (
      t
      )
    
  
  =
  
    
      ∑
      
        k
        =
        1
      
      K
    
    ⁢
    
      
    
    ⁢
    
      
        b
        k
      
      ⁢
      
        
          ∑
          
            l
            =
            1
          
          L
        
        ⁢
        
          
        
        ⁢
        
          
            a
            k
            
              (
              l
              )
            
          
          ⁢
          
            
              s
              k
            
            ⁡
            
              (
              
                t
                -
                
                  τ
                  k
                  
                    (
                    l
                    )
                  
                
              
              )
            
          
        
      
    
  




where τk(l) denotes the delay with respect to a reference at the receiver r of the signal transmitted by user k along the propagation path l, and ak(l) denotes a complex amplitude attenuation induced by the propagation path l that includes contributions from the attenuation of the transmission channel c and phase offset.
At the receiver r, the received signal y(t) is filtered with a lowpass filter f. In the preferred embodiment of the method of the invention, the received signal y(t) is filtered with the filter f having the impulse response φ(t), where φ(t) is for instance a sinc signal of bandwidth |−Mω0, Mω0|, where ω0=2π/Tb.
The sampling period Ts is chosen such that Tb/Ts≧2M+1. A set of at least 2M+1 samples y[nTs] is thus generated during each symbol period Tb. From the set of samples, 2M+1 spectral values Y[m], where mε[−M,M], can be computed, for instance with the use of the Fast Fourier Transform (FFT) method.




  
    Y
    ⁡
    
      [
      m
      ]
    
  
  =
  
    
      ∑
      
        k
        =
        1
      
      K
    
    ⁢
    
      
    
    ⁢
    
      
        b
        k
      
      ⁢
      
        
          ∑
          
            l
            =
            1
          
          L
        
        ⁢
        
          
        
        ⁢
        
          
            a
            k
            
              (
              l
              )
            
          
          ⁢
          
            
              S
              k
            
            ⁡
            
              [
              m
              ]
            
          
          ⁢
          
            e
            
              
                -
                j
              
              ⁢
              
                
              
              ⁢
              m
              ⁢
              
                
              
              ⁢
              
                ω
                0
              
              ⁢
              
                τ
                k
                
                  (
                  l
                  )
                
              
            
          
        
      
    
  




The delays τk(l) of the transmitted signals along the different propagation paths l appear in the spectral coefficients Y[m] as phase delays, while the complex amplitude attenuations ak(l) appear as the weighting coefficients.
The above equation can be written more compactly as




  
    Y
    ⁡
    
      [
      m
      ]
    
  
  =
  
    
      ∑
      
        k
        =
        1
      
      K
    
    ⁢
    
      
    
    ⁢
    
      
        b
        k
      
      ⁢
      
        c
        mk
      
    
  




where cmk are given by




  
    c
    mk
  
  =
  
    
      
        S
        k
      
      ⁡
      
        [
        m
        ]
      
    
    ⁢
    
      
        ∑
        
          l
          =
          1
        
        L
      
      ⁢
      
        
      
      ⁢
      
        (
        
          
            a
            k
            
              (
              l
              )
            
          
          ⁢
          
            e
            
              
                -
                j
              
              ⁢
              
                
              
              ⁢
              m
              ⁢
              
                
              
              ⁢
              
                ω
                0
              
              ⁢
              
                τ
                k
                
                  (
                  l
                  )
                
              
            
          
        
        )
      
    
  




or in a matrix form




  
    
      (
      
        
          
            
              c
              11
            
          
          
            
              c
              12
            
          
          
            ...
          
          
            
              c
              
                1
                ⁢
                K
              
            
          
        
        
          
            
              c
              21
            
          
          
            
              c
              22
            
          
          
            ...
          
          
            
              c
              
                2
                ⁢
                K
              
            
          
        
        
          
            ⋮
          
          
            
              
            
          
          
            
              
            
          
          
            
              
            
          
        
        
          
            
              c
              
                M
                ⁢
                
                  
                
                ⁢
                1
              
            
          
          
            
              c
              
                M
                ⁢
                
                  
                
                ⁢
                2
              
            
          
          
            ...
          
          
            
              c
              MK
            
          
        
      
      )
    
    ⁢
    
      (
      
        
          
            
              b
              1
            
          
        
        
          
            
              b
              2
            
          
        
        
          
            ⋮
          
        
        
          
            
              b
              K
            
          
        
      
      )
    
  
  =
  
    
      
        (
        
          
            
              
                Y
                ⁡
                
                  [
                  1
                  ]
                
              
            
          
          
            
              
                Y
                ⁡
                
                  [
                  2
                  ]
                
              
            
          
          
            
              ⋮
            
          
          
            
              
                Y
                ⁡
                
                  [
                  M
                  ]
                
              
            
          
        
        )
      
      ≡
      
        C
        ·
        b
      
    
    =
    Y
  




During the training phase 30, the values of the symbols bk sent by the users k are known and the linear system above has to be solved for the elements of the matrix C, in order to estimate the delays τk(l) and amplitude attenuations ak(l) of the transmitted signals 10.
However, the linear system above alone, generated from the sampled values y[nTs] of the received signal y(t) taken during one symbol duration Tb, is not sufficient to solve for all the elements of the matrix C. Since the matrix C is of a size M×K, it is necessary to have at least K such equations, that can be obtained by considering at least K set of samples y[nTs] taken from the received signal y(t) during at least K symbol durations Tb. In other words, in order to solve for C, given b and Y, each user k has to send a training sequence bkt, where




   
  
    
      
        
          
            b
            
              1
              ⁢
              t
            
          
          =
          
            [
            
              
                
                  
                    b
                    1
                    
                      (
                      1
                      )
                    
                  
                
                
                  
                    b
                    1
                    
                      (
                      2
                      )
                    
                  
                
                
                  ...
                
                
                  
                    b
                    1
                    
                      (
                      H
                      )
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        
          
            b
            
              2
              ⁢
              t
            
          
          =
          
            [
            
              
                
                  
                    b
                    2
                    
                      (
                      1
                      )
                    
                  
                
                
                  
                    b
                    2
                    
                      (
                      2
                      )
                    
                  
                
                
                  ...
                
                
                  
                    b
                    2
                    
                      (
                      H
                      )
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        ⋮
      
    
    
      
        
          
            b
            Kt
          
          =
          
            [
            
              
                
                  
                    b
                    K
                    
                      (
                      1
                      )
                    
                  
                
                
                  
                    b
                    K
                    
                      (
                      2
                      )
                    
                  
                
                
                  ...
                
                
                  
                    b
                    K
                    
                      (
                      H
                      )
                    
                  
                
              
            
            ]
          
        
      
    
  




The length H of each training sequence bkt, which is the number H of symbols bk(h), is at least K, where K denotes the number of users k.
The equation system to be solved by the processing device w of the receiver r can thus be written as




  
    
      (
      
        
          
            
              c
              11
            
          
          
            
              c
              12
            
          
          
            ...
          
          
            
              c
              
                1
                ⁢
                K
              
            
          
        
        
          
            
              c
              21
            
          
          
            
              c
              22
            
          
          
            ...
          
          
            
              c
              
                2
                ⁢
                K
              
            
          
        
        
          
            ⋮
          
          
            
              
            
          
          
            
              
            
          
          
            
              
            
          
        
        
          
            
              c
              
                M
                ⁢
                
                  
                
                ⁢
                1
              
            
          
          
            
              c
              
                M
                ⁢
                
                  
                
                ⁢
                2
              
            
          
          
            ...
          
          
            
              c
              MK
            
          
        
      
      )
    
    ⁢
    
      (
      
        
          
            
              b
              1
              
                (
                1
                )
              
            
          
          
            
              b
              1
              
                (
                2
                )
              
            
          
          
            ...
          
          
            
              b
              1
              
                (
                K
                )
              
            
          
        
        
          
            
              b
              2
              
                (
                1
                )
              
            
          
          
            
              b
              2
              
                (
                2
                )
              
            
          
          
            ...
          
          
            
              b
              2
              
                (
                K
                )
              
            
          
        
        
          
            ⋮
          
          
            
              
            
          
          
            
              
            
          
          
            
              
            
          
        
        
          
            
              b
              K
              
                (
                1
                )
              
            
          
          
            
              b
              K
              
                (
                2
                )
              
            
          
          
            ...
          
          
            
              b
              K
              
                (
                K
                )
              
            
          
        
      
      )
    
  
  =
  
    
      
        (
        
          
            
              
                
                  Y
                  
                    (
                    1
                    )
                  
                
                ⁡
                
                  [
                  1
                  ]
                
              
            
            
              
                
                  Y
                  
                    (
                    2
                    )
                  
                
                ⁡
                
                  [
                  1
                  ]
                
              
            
            
              
                
              
            
            
              
                
                  Y
                  
                    (
                    K
                    )
                  
                
                ⁡
                
                  [
                  1
                  ]
                
              
            
          
          
            
              
                
                  Y
                  
                    (
                    1
                    )
                  
                
                ⁡
                
                  [
                  2
                  ]
                
              
            
            
              
                
                  Y
                  
                    (
                    2
                    )
                  
                
                ⁡
                
                  [
                  2
                  ]
                
              
            
            
              
                
              
            
            
              
                
                  Y
                  
                    (
                    K
                    )
                  
                
                ⁡
                
                  [
                  2
                  ]
                
              
            
          
          
            
              
                
              
            
            
              
                
              
            
            
              
                
              
            
            
              
                
              
            
          
          
            
              
                
                  Y
                  
                    (
                    1
                    )
                  
                
                [
                M
                }
              
            
            
              
                
                  Y
                  
                    (
                    2
                    )
                  
                
                ⁡
                
                  [
                  M
                  ]
                
              
            
            
              
                
              
            
            
              
                
                  Y
                  
                    (
                    K
                    )
                  
                
                ⁡
                
                  [
                  M
                  ]
                
              
            
          
        
        )
      
      ≡
      
        C
        ·
        B
      
    
    =
  




This can be solved for C as

C=Y·B−1 

The above equation provides a unique solution as long as B is a full rank matrix. B is the matrix made up of the known training sequences bkt of all users k and, as long as these training sequences bkt are linearly independent, the matrix B will be a full rank matrix. In other words, each user k must send a determined training sequence bkt, stored for instance in a memory storage device in the corresponding encoder 50, linearly independent from any training sequence bkt sent by any other user k.
From the above equation all the coefficients cmk can be calculated.




  
    c
    mk
  
  =
  
    
      
        S
        k
      
      ⁡
      
        [
        m
        ]
      
    
    ⁢
    
      
        ∑
        
          l
          =
          1
        
        L
      
      ⁢
      
        
      
      ⁢
      
        (
        
          
            a
            k
            
              (
              l
              )
            
          
          ⁢
          
            e
            
              
                -
                j
              
              ⁢
              
                
              
              ⁢
              m
              ⁢
              
                
              
              ⁢
              
                ω
                0
              
              ⁢
              
                τ
                k
                
                  (
                  l
                  )
                
              
            
          
        
        )
      
    
  




Since the spectral values Sk[m] of the coding sequences sk(t) are known weighting coefficients, a new matrix D can be defined by




  D
  =
  
    (
    
      
        
          
            
              c
              11
            
            /
            
              
                S
                1
              
              ⁡
              
                [
                1
                ]
              
            
          
        
        
          
            
              c
              12
            
            /
            
              
                S
                2
              
              ⁡
              
                [
                1
                ]
              
            
          
        
        
          ...
        
        
          
            
              c
              
                1
                ⁢
                K
              
            
            /
            
              
                S
                K
              
              ⁡
              
                [
                1
                ]
              
            
          
        
      
      
        
          
            
              c
              21
            
            /
            
              
                S
                1
              
              ⁡
              
                [
                2
                ]
              
            
          
        
        
          
            
              c
              22
            
            /
            
              
                S
                2
              
              ⁡
              
                [
                2
                ]
              
            
          
        
        
          ...
        
        
          
            
              c
              
                2
                ⁢
                K
              
            
            /
            
              
                S
                K
              
              ⁡
              
                [
                2
                ]
              
            
          
        
      
      
        
          ⋮
        
        
          
            
          
        
        
          
            
          
        
        
          
            
          
        
      
      
        
          
            
              c
              
                M
                ⁢
                
                  
                
                ⁢
                1
              
            
            /
            
              
                S
                1
              
              ⁡
              
                [
                M
                ]
              
            
          
        
        
          
            
              c
              
                M
                ⁢
                
                  
                
                ⁢
                2
              
            
            /
            
              
                S
                1
              
              ⁡
              
                [
                1
                ]
              
            
          
        
        
          ...
        
        
          
            
              c
              MK
            
            /
            
              
                S
                K
              
              ⁡
              
                [
                M
                ]
              
            
          
        
      
    
    )
  




with dmk=cmk/Sk[m]. The coefficients dmk are thus given by




  
    d
    mk
  
  =
  
    
      ∑
      
        l
        =
        1
      
      L
    
    ⁢
    
      
        a
        k
        
          (
          l
          )
        
      
      ⁢
      
        e
        
          
            -
            j
          
          ⁢
          
            
          
          ⁢
          m
          ⁢
          
            
          
          ⁢
          
            ω
            0
          
          ⁢
          
            τ
            k
            
              (
              l
              )
            
          
        
      
    
  




With the number M≧2L then the k-th column of D provides sufficient information to solve uniquely for the channel parameters of the user k. For example, considering the first column of D:

d11=a1(1)e−jω0τ1(L)+a1(2)e−jω0τ1(2) + . . . +a1(L)e−jω0τ1(L) 

d21=a1(1)e−j2ω0τ1(L)+a1(2)e−j2ω0τ1(2) + . . . +a1(L)e−j2ω0τ1(L) 

. . .


d2L1=a1(1)e−j2Lω0τ1(L)+a1(2)e−j2Lω0τ1(2) + . . . +a1(L)e−j2Lω0τ1(L) 

Only the unknown propagation parameters of the first user appear in the above set of equations. In other words, the propagation parameters τk(l) and ak(l) of user k can be perfectly estimated, in the noiseless case, from the k-th column of matrix D. The problem of multiuser channel estimation is therefore decomposed into a series of one-dimensional estimation problems that can be efficiently solved for instance using known 1-D subspace methods for harmonic retrieval.
It is thus demonstrated that the method of the invention allows, during the training phase 30, the estimation of the propagation parameters τk(l) and ak(l) for all users k from a lowpass filtered version of the received wideband signal y(t) sampled at a sub-Nyquist rate, which implies that the sampling frequency fs as well as the computational requirements at the receiver's side can be significantly reduced in comparison to the sampling frequency and the computational requirements induced by current methods.
The number of samples M needed per symbol bk(h) depends only on the number L of multipaths l, while the number H of symbols bk(h) in each training sequence bkt depends on the number K of users k that need to be synchronized. In the noiseless case, the method according to the preferred embodiment of the invention leads to a perfect estimation of channel parameters ak(l) and τk(l) of all users k by taking only M=2L+1 samples Y[m] per symbol bk(h). This means that the sampling frequency fs must be at least greater than 2L times the symbol rate:




  
    f
    s
  
  =
  
    
      1
      
        T
        s
      
    
    >
    
      
        2
        ⁢
        L
      
      
        T
        b
      
    
  




During the training phase 30, the values of the sent bits bk(h) of the training sequences bkt being known, the degrees of freedom of the received signal y(t) are the set of unknown propagation parameters, that is the KL delays τk(l) and the KL amplitude attenuations ak(l) that the K transmitted signals 10 can take along their L propagation paths 1. The number of degrees of freedom of the received signal y(t) is thus 2KL. Since the propagation parameters are constant over the entire training phase 30, and since at least K bits bk(h) of the training sequences bkt are known, the number of degrees of freedom of the received signal y(t) stays constant over the entire training phase, which is at least KTb long. The rate of innovation p of the received signal y(t) can therefore be expressed as




  ρ
  =
  
    
      
        2
        ⁢
        KL
      
      
        KT
        b
      
    
    =
    
      
        2
        ⁢
        L
      
      
        T
        b
      
    
  




Thus it is demonstrated that the sampling frequency has to be higher than the rate of innovation of the signal.




  
    1
    
      T
      s
    
  
  =
  
    
      
        f
        s
      
      >
      ρ
    
    =
    
      
        2
        ⁢
        L
      
      
        T
        b
      
    
  




In a CDMA communication system, the symbol rate 1/Tb is typically considerably lower than the received signal's chip rate 1/Tc. The inventive method thus significantly reduces the required sampling frequency fs in comparison to current methods typically requiring digital receivers to sample the received signal at least at its chip rate 1/Tc.
Consequently, the number of sampled values required by the inventive method for estimating the propagation parameters is also significantly reduced, reducing the complexity of the estimation problem to be solved and thus reducing the computational requirements for the processing device w of the digital receiver r compared to the computational requirements for receivers using prior art methods.
As already mentioned, the training sequences bkt sent by the users k during the training phase 30 have to be carefully chosen so as to ensure the good performance of the inventive method for channel estimation. Therefore, the training sequence bkt to be sent by each user k is chosen from a set of training sequences specifically designed to optimize the performance of the channel estimation and stored in the corresponding encoder 50. Preferably, the encoder 50 can store at least two different training sequences bkt from this set. During the training phase 30, the user k sends the stored training sequence bkt most adapted to the current characteristics of the communication channel, basing for instance on a feedback message from the receiver r.
In the noisy case, in order to obtain a more precise estimation of the propagation parameters ak(l) and τk(l), the sampling frequency fs needs to be increased, while the length H of the training sequences bkt remains the same. In the presence of noise, the sampling frequency fs required for good estimation accuracy depends on signal-to-noise ratio (SNR), yet in most cases encountered in practice that sampling frequency fs is still far below the chip rate 1/Tc.
In a variant preferred embodiment, the method described above during the training phase 30 is applied to an asynchronous CDMA communication system where the receiver r has an arbitrary timing reference that is not aligned to transmitted symbol bk(h) boundaries. Therefore, in the general case, the sample values ys[nTs] from which the Fourier series coefficients Y[m] are computed, will actually contain the information about two consecutive bits in the training sequence, provided that a maximum delay spread of each user k is less than a symbol duration Tb. As a result, the computed Fourier series coefficients Y[m] may not correspond to the actual values, in particular in the case when the adjacent bits have different signs. It is thus desirable to repeat every bit bk(h) in the training sequence bkt twice during the training phase, to make sure that the Fourier series coefficients Y[m] are computed accurately. This does not imply that the derived equations should be modified. All the equations remain the same, the only difference is that every bit bk(h) in the training sequences bkt is sent twice.
Once the propagation parameters ak(l) and τk(l) of the transmission channel c for all users k have been estimated, the processing device w of the receiver r proceeds to the detection phase 40, that is, the detection of the signal x(t), or the symbols bk, sent by each user k.
According to the preferred embodiment of the invention, the detection phase 40 is performed using known multiuser detection methods such as Minimum Mean Square Error (MMSE) or decorrelating detector. The received signal y(t) however is, as in the training phase 30, first filtered with a lowpass filter f and then sampled at a sub-Nyquist rate, that is, at a sampling frequency fs lower than the chip rate 1/Tc of the received signal y(t), but higher than its rate of innovation ρ. The inventive method base on the surprising finding that a set of sampled values generated from a signal at a sub-Nyquist rate is sufficient to reconstruct or to decode said signal, if said set of sampled values is generated at a sampling frequency fs higher than the signal's rate of innovation ρ.
During the detection phase 40, the receiver r receives a second signal y(t) made of the superposition of multiple copies of information signals x(t) sent over the communication channel by the users k, each copy of each information signal x(t) having a previously estimated amplitude attenuation ak(l) and a previously estimated relative delay τk(l) with respect to a reference at the receiver r. The information signals x(t) sent by the users k are made of symbols bk. These symbols bk are then coded with the respective coding sequence sk(t), and transmitted to the receiver r over the transmission channel c. The second signal y(t) is first filtered and then sampled at a sampling frequency fs lower than the sampling frequency given by the Shannon theorem, but higher than rate of innovation p of the second signal y(t), which is, as described above in the multi-user case, equal to the signal's information rate K/Tb, thus generating a second set of sampled values y[nTs]. Signal detection is then performed with known detection methods such as for instance Minimum Mean Square Error (MMSE) or decorrelating detector, using the values of the second set sampled values y[nTs] and the previously estimated propagation parameters ak(l) and τk(l).
In a variant preferred embodiment of the method, the training phase 30 is initiated as described previously. The coefficients cmk of the matrix C are computed with

C=Y·B−1 

However, once the matrix C is computed, the system proceeds to the subsequent detection phase 40 without solving the series of one-dimensional estimation problems for estimating each propagation parameter ak(l) or Tk(l). During the detection phase 40, the second signal y(t) is sampled as described in the previous embodiment of the method, thus generating a second set of sampled values y[nTs] from which a second set of spectral values Y[m] can be computed with for instance the FFT method.
The linear system




  
    
      (
      
        
          
            
              c
              11
            
          
          
            
              c
              12
            
          
          
            ...
          
          
            
              c
              
                1
                ⁢
                K
              
            
          
        
        
          
            
              c
              21
            
          
          
            
              c
              22
            
          
          
            ...
          
          
            
              c
              
                2
                ⁢
                K
              
            
          
        
        
          
            ⋮
          
          
            
              
            
          
          
            
              
            
          
          
            
              
            
          
        
        
          
            
              c
              
                M
                ⁢
                
                  
                
                ⁢
                1
              
            
          
          
            
              c
              
                M
                ⁢
                
                  
                
                ⁢
                2
              
            
          
          
            ...
          
          
            
              c
              MK
            
          
        
      
      )
    
    ⁢
    
      (
      
        
          
            
              b
              1
            
          
        
        
          
            
              b
              2
            
          
        
        
          
            ⋮
          
        
        
          
            
              b
              K
            
          
        
      
      )
    
  
  =
  
    
      
        (
        
          
            
              
                Y
                ⁡
                
                  [
                  1
                  ]
                
              
            
          
          
            
              
                Y
                ⁡
                
                  [
                  2
                  ]
                
              
            
          
          
            
              ⋮
            
          
          
            
              
                Y
                ⁡
                
                  [
                  M
                  ]
                
              
            
          
        
        )
      
      ≡
      
        C
        ·
        b
      
    
    =
    Y
  




is then solved for b in order to determine the value of the symbols bk, with all coefficients cmk being known from the synchronization phase. Therefore, the vector containing the bits sent by each user can be computed as




  
    (
    
      
        
          
            b
            1
          
        
      
      
        
          
            b
            2
          
        
      
      
        
          ⋮
        
      
      
        
          
            b
            K
          
        
      
    
    )
  
  =
  
    
      
        
          
            (
            
              
                
                  
                    c
                    11
                  
                
                
                  
                    c
                    12
                  
                
                
                  ...
                
                
                  
                    c
                    
                      1
                      ⁢
                      K
                    
                  
                
              
              
                
                  
                    c
                    21
                  
                
                
                  
                    c
                    22
                  
                
                
                  ...
                
                
                  
                    c
                    
                      2
                      ⁢
                      K
                    
                  
                
              
              
                
                  ⋮
                
                
                  
                    
                  
                
                
                  
                    
                  
                
                
                  
                    
                  
                
              
              
                
                  
                    c
                    
                      M
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                  
                
                
                  
                    c
                    
                      M
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                
                
                  ...
                
                
                  
                    c
                    MK
                  
                
              
            
            )
          
          
            -
            1
          
        
        ⁢
        
          (
          
            
              
                
                  Y
                  ⁡
                  
                    [
                    1
                    ]
                  
                
              
            
            
              
                
                  Y
                  ⁡
                  
                    [
                    2
                    ]
                  
                
              
            
            
              
                ⋮
              
            
            
              
                
                  Y
                  ⁡
                  
                    [
                    M
                    ]
                  
                
              
            
          
          )
        
      
      ≡
      b
    
    =
    
      
        C
        
          -
          1
        
      
      ·
      Y
    
  




In other words, it is possible to detect user's signals without knowing specific users' signature sequences and without even estimating the propagation coefficients ak(l) and τk(l). The receiver only has to estimate the matrix C during the training phase, while during the detection phase the vector of bits b is simply given by the linear system above. This preferred embodiment of the method thus significantly reduces the computational requirements for the computing device w of a receiver r using said method. However, it can only be satisfactorily applied to quasi-synchronous CDMA communication systems where the timings of the users k are a priori known to the receiver, and where the maximum delay spread of each user k is much smaller than a symbol duration Tb.
As mentioned above, during the detection phase 40, the number of degrees of freedom of the second signal y(t) is equal to the number K of symbols bk sent by the users k. The rate of innovation ρ of the second signal y(t) is then equal to its information rate K/Tb. The sampling frequency fs must then be




  
    1
    
      T
      s
    
  
  =
  
    
      
        f
        s
      
      >
      ρ
    
    =
    
      K
      
        T
        b
      
    
  




which is still well below the chip rate 1/Tc of the received signal.
In the case of noisy transmission, the propagation parameters ak(l) and τk(l) of the transmission channel c and consequently the transmitted symbols bk can not be estimated perfectly. In order to perform a better estimation of these channel parameters and therefore a less bit error rate, the sampling frequency fs should be higher than the rate of innovation ρ. The sampling frequency fs required for good estimation accuracy will then depend on signal-to-noise ratio (SNR), yet in most cases encountered in practice, that sampling frequency fs is still far below the chip rate 1/Tc.
In a variant preferred embodiment of the method, the filtering signal φ(t) is a Gaussian signal. Since the Gaussian signal has an exponential decay, the problem of intersymbol interference, which can potentially arise with the use of a sinc filtering signal, can be avoided.
In another variant preferred embodiment, the method according to the invention is applied to a CDMA system where the receiver r is connected to an array of antennas (FIG. 5). The array of antennas is composed of a regularly spaced aligned antennas i. After demodulation, the signal yi(t) received by each antenna i is a superposition of multiple copies of the signals transmitted by the K users k over the transmission channel c, each copy having a possibly different amplitude attenuation and a possibly different relative delays with respect to a reference at the receiver r. Each copy arrives at the antenna array at the incident angle θk(l) which is the same for all antennas i in the array. However, there will be a fixed phase difference of




  
    e
    
      
        
          jω
          c
        
        ⁢
        D
        ⁢
        
          
        
        ⁢
        sin
        ⁢
        
          
        
        ⁢
        
          θ
          k
          
            (
            l
            )
          
        
      
      c
    
  
  =
  
    e
    
      jφ
      k
      
        (
        l
        )
      
    
  




between the copies received at each two consecutive antennas i, where D denotes the spacing between two adjacent antennas, ωc is the carrier angular frequency and c is the speed of light. This holds under the assumption that the carrier frequency is relatively high compared to the bandwidth of the transmitted signal, which is typically true in practical cases.
The copies of the same signal component received by each two consecutive antennas i are thus shifted by a fixed phase delay that depends on the direction of arrival θk(l) of the specific signal component. Thus the same phase difference will exist between the Fourier series coefficients of the same signal component received by each two consecutive antennas i.
During the training phase 30, each signal yi(t) received by each antenna i is, as in the previously described embodiments of the method, first filtered with a lowpass filter f and then sampled at a frequency fs higher than the innovation rate p of the signal yi(t), but lower than the frequency given by Shannon's sampling theorem. As previously described, sets of spectral values Yi[m] are then computed from each generated set of sampled values yi[nTs], for computing a matrix Di with each said set of spectral values Yi[m], with the known values of the bits bk(h) of the training sequences bkt and with the known spectral values Sk[m] of the coding sequences sk(t). The elements dmni of the computed matrices Di are therefore given by




  
    d
    mk
    i
  
  =
  
    
      ∑
      
        l
        =
        1
      
      L
    
    ⁢
    
      
        (
        
          
            a
            k
            
              (
              l
              )
            
          
          ⁢
          
            e
            
              
                -
                j
              
              ⁢
              
                
              
              ⁢
              m
              ⁢
              
                
              
              ⁢
              
                ω
                0
              
              ⁢
              
                τ
                k
                
                  (
                  l
                  )
                
              
            
          
        
        )
      
      ⁢
      
        A
        g
      
      ⁢
      
        e
        
          
            -
            
              j
              ⁡
              
                (
                
                  i
                  -
                  1
                
                )
              
            
          
          ⁢
          
            φ
            k
            
              (
              l
              )
            
          
        
      
    
  




where Ag denotes the antenna gain (assumed to be the same for all antennas). The unknown propagation parameters τk(l), θk(l) and ak(l) of the user k can then be estimated by considering only the k-th columns of the matrices Di. Thus, for each user k, a matrix Fk made up of the k-th column of each matrix Di is defined by




  
    
      
        
          F
          k
        
        =
        
          (
          
            
              
                
                  
                    D
                    
                      
                        
                      
                      ⁢
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      
                        :
                      
                      ,
                      k
                    
                    )
                  
                
              
              
                
                  
                    D
                    
                      
                        
                      
                      ⁢
                      2
                    
                  
                  ⁡
                  
                    (
                    
                      
                        :
                      
                      ,
                      k
                    
                    )
                  
                
              
              
                
                  
                    D
                    
                      
                        
                      
                      ⁢
                      3
                    
                  
                  ⁡
                  
                    (
                    
                      
                        :
                      
                      ,
                      k
                    
                    )
                  
                
              
              
                ...
              
              
                
                  
                    D
                    
                      
                        
                      
                      ⁢
                      l
                    
                  
                  ⁡
                  
                    (
                    
                      
                        :
                      
                      ,
                      k
                    
                    )
                  
                
              
            
          
          )
        
      
    
  
  
    
      
        =
        
          (
          
            
              
                
                  d
                  
                    1
                    ⁢
                    k
                  
                  1
                
              
              
                
                  d
                  
                    1
                    ⁢
                    k
                  
                  2
                
              
              
                ...
              
              
                
                  d
                  
                    1
                    ⁢
                    k
                  
                  l
                
              
            
            
              
                
                  d
                  
                    2
                    ⁢
                    k
                  
                  1
                
              
              
                
                  d
                  
                    2
                    ⁢
                    k
                  
                  2
                
              
              
                ...
              
              
                
                  d
                  
                    2
                    ⁢
                    k
                  
                  l
                
              
            
            
              
                ⋮
              
              
                
                  
                
              
              
                
                  
                
              
              
                
                  
                
              
            
            
              
                
                  d
                  Mk
                  1
                
              
              
                
                  d
                  Mk
                  2
                
              
              
                ...
              
              
                
                  d
                  Mk
                  l
                
              
            
          
          )
        
      
    
  




From the matrix Fk it is then solved for the propagation parameters τk(l), θk(l) and ak(l) of user k, for instance using 2-D subspace methods for harmonic retrieval. Therefore, by repeating this operation for all users k, the unknown propagation parameters τk(l), θk(l) and ak(l) of all users k can be estimated. The problem of multiuser parameter estimation is in this case decomposed into a series of 2-D estimation problems.
The one skilled in the art will recognize that it is also possible to estimate all the propagation parameters τk(l), θk(l) and ak(l) of the user k by considering only the first two columns of the matrix Fk, that is, by considering the signals from only two antennas i, and using for instance 1-D subspace methods, which could further reduce the computational requirements. However, this last variant embodiment of the method typically leads to less reliable estimation of the propagation parameters than the previous one.
In the detection phase, beams of antenna arrays are oriented according to the previously estimated directions of arrival and detection is performed for instance with the known 2-D RAKE method but on a lowpass filtered version of the received signals yi(t) sampled at a sampling frequency f, higher than the innovation rate p of the received signals yi(t), but lower than the frequency given by Shannon's sampling theorem.
In a further preferred embodiment, the inventive method is applied to a CDMA communication system using a specific set of coding sequences sk(t) that are orthogonal to each other on their lowpass filtered version. In this preferred embodiment, the training phase 30 is performed as described in the previous embodiments. The detection phase 40 is performed by first filtering the received signal y(t) with a filter f and then sampling it at a frequency fs lower than the frequency given by Shannon's sampling theorem, but higher than the rate of innovation p of the received signal y(t), for generating a set of sampled values y[nTs]. These sampled values y[nTs] are then processed by a bank of digital matched filters, each matched to the sampled lowpass filtered version of a user's coding sequence sk(t). As the lowpass filtered versions of the coding sequence sk(t) of the users k are orthogonal to each other, the output of each matched filter determines the value of the information sent by the corresponding user k.
The method according to the invention was demonstrated above for the case of a CDMA system with K users k transmitting over a multipath fading transmission channel c. The one skilled in the art will however recognize that the inventive method can also be applied to communication systems with transmission channels having a single propagation path as well as for single-user channel estimation.
In the preferred embodiments described above, the method according to the invention and the related receiver using said method are applied to CDMA communication systems. The one skilled in the art will however recognize that the method according to the invention can be applied to other bandwidth-expanding communication systems, such as ultra wideband systems (UWB). More precisely, UWB system can be roughly considered as a special case of CDMA systems where the signature sequence assigned to a user is a very short pulse, much shorter than the bit duration Tb. In the typical practical case, this pulse is a first derivative Gaussian function.
The typical implementation of an UWB communication system is a pulse position modulation system (PPM system) using a wideband pulse shape. In such systems, in order to recover the information contained in the received signal, it is necessary to estimate the locations of the transmitted pulses. The one skilled in the art will recognize that this task can be viewed as a particular case of the time-delay estimation described above during the training phase in the case of a CDMA system.
During the training phase, a user sends a stream of regularly spaced pulses in order to allow for the receiver to estimate, in a similar manner to what is described above, the propagation parameters, that is, the relative time delays induced by the channel τ(l) as well as the propagation coefficients a(i). During the detection phase, the receiver has to solve the same time-delay estimation problem as in the preceding training phase. In order to recover the information sent, the previously estimated time delays induced by the channel must be subtracted form the time delays estimated in the detection phase.
The inventive method, in its various preferred embodiments, is described above for performing both channel estimation during the training phase and signal detection during the detection phase. It is however possible to implement the inventive method in a bandwidth-expanding communication system for performing only channel estimation and to use a method known from the prior art for performing signal detection, or to implement the inventive method in a bandwidth-expanding communication system for performing only signal detection and to use a method known from the prior art for performing channel estimation.

## Claims

1. Method for processing a signal (y(t)) sent over a wireless communication channel, comprising
sampling the received signal (y(t)) with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, lower than the chip rate (1/Tc) of said received signal (y(t)), but greater than the rate of innovation (ρ) of said received signal (y(t)), for generating a set of sampled values (y(nTs))
reconstructing the received signal (y(t)) using the set of sampled values (y(nTs)).

2. Method according to claim 1, further comprising filtering said received signal (y(t)) with a filter (f).

3. Method according to claim 2, wherein said filter (f) is a lowpass filter.

4. Method according to claim 3, wherein said filter (f) is a sinc filter.

5. Method according to claim 3, wherein said filter (f) is a Gaussian filter.

6. Method according to claim 1, wherein said wireless communication channel comprises a multipath fading transmission channel (c).

7. Method according to claim 1, wherein said wireless communication channel comprises a CDMA channel.

8. Method according to claim 1, wherein said sampling frequency (1/Ts) is greater than the information rate (K/Tb) of said received signal (y(t)).

9. Method according to claim 1, wherein said sent signal (y(t)) includes a plurality of training sequences (bkt) each encoded with a user specific coding sequence (sk(t)) and transmitted by said users (k), said method further comprising:
computing a set of spectral values (Y[m]) corresponding to said received signal (y(t)) from said set of sampled values (y(nTs)),
recovering spectral values (Sk[m]) corresponding to each of said user specific coding sequence (sk(t)),
retrieving the delays (τk(l)) and the amplitude attenuations (ak(l)) induced by said communication channel on said sent signal (y(t)), from said set of spectral values (Y[m]) corresponding to said received signal (y(t)) and from said spectral values (Sk[m]) corresponding to each of said user specific coding sequence (sk(t)).

10. Method according to claim 9, wherein retrieving said delays (τk(l)) and said amplitude attenuations (ak(l)) includes solving a series of one-dimensional estimation problems, the size of each said one-dimensional estimation problem being equal to the number of said sampled values (y(nTs)) generated during one symbol duration (Tb).

11. Method according to claim 10, wherein said series of one-dimensional equation systems is derived from said spectral values (Y[m]) of said received signal (y(t)), said spectral values (Sk[m]) of each of said user specific coding sequence (sk(t)) and the value of the bits (bk(h)) of said training sequences (bkt).

12. Method according to claim 11, further comprising:
processing a second sent signal (y(t)) including a plurality of symbols (bk) each encoded with said user specific coding sequence (sk(t)) and transmitted by said users (k),
sampling said second sent signal (y(t)) with a sampling frequency lower than the sampling frequency given by the Shannon theorem, but greater than the rate of innovation (ρ) of said second sent signal (y(t)), for generating a second set of sampled values (y(nTs)).

13. Method according to claim 12, further comprising running a multiuser detection scheme using said second set of sampled values (y(nTs)) and previously computed said delays (τk(l)) and said amplitude attenuations (ak(l)) for estimating the value of the symbol (bk) sent by each said user (k).

14. Method according to claim 13, wherein said multiuser detection scheme is a decorrelating detection scheme.

15. Method according to claim 13, wherein said multiuser detection scheme is a minimum mean-square error detection scheme.

16. Method according to claim 1, wherein said sent signal (y(t)) includes a plurality of symbols (bk) each encoded with said user specific coding sequence (sk(t)) and transmitted by said users (k), said method further comprising:
running a multiuser detection scheme using known delays (τk(l)) and amplitude attenuations (ak(l)) induced by said wireless communication channel on said sent signal (y(t)) and using said set of sampled values (y(nTs)) and for estimating the value of the symbol (bk) sent by each said user (k).

17. Method according to claim 16, wherein said multiuser detection scheme is a decorrelating detection scheme.

18. Method according to claim 16, wherein said multiuser detection scheme is a minimum mean-square error detection scheme.

19. Method according to claim 1, wherein said sent signal (y(t)) includes a plurality of training sequences (bkt) each encoded with a user specific coding sequence (sk(t)) and transmitted by said users (k), said method further comprising:
computing a set of spectral values (Y[m]) of said received signal (y(t)) from said set of sampled values (y(nTs)), computing a set of channel dependant values (C) from said set of spectral values (Y[m]) and said training sequences (bkt),
processing a second sent signal (y(t)) including a plurality of symbols (bk) each encoded with said user specific coding sequence (sk(t)) and transmitted by said users (k),
sampling said second sent signal (y(t)) with a sampling frequency lower than the sampling frequency given by the Shannon theorem, but greater than the rate of innovation (ρ) of said second sent signal (y(t)), for generating a second set of sampled values (y(nTs))
retrieving the value of the symbol (bk) sent by each said user (k) by solving a linear matrix system including said second set of sampled values (y(nTs)) and said set of channel dependant values (C).

20. Method according to claim 1, wherein said sent signal (y(t)) includes a plurality of symbols (bk) each encoded with said user specific coding sequence (sk(t)) and transmitted by said users (k), said user specific coding sequence (sk(t)) being chosen such that, when filtered with a lowpass filter (f), it is orthogonal to any other user's specific coding sequence (sk(t)) used in said communication channel and filtered with said lowpass filter (f), said method further comprising:
sampling said sent signal (y(t)) with a sampling frequency lower than the sampling frequency given by the Shannon theorem, but greater than the rate of innovation (ρ) of said sent signal (y(t)), for generating a set of sampled values (y(nTs))
filtering said set of sampled values (y(nTs)) with a bank of matched filters, each filter being matched to said user specific coding sequence (sk(t)) filtered with said lowpass filter (f), for estimating the value of the symbol (bk) sent by each said user (k).

21. Method according to claim 1, wherein said wireless communication channel comprises an array of antennas (i).

22. Method according to claim 21, wherein said sent signal (y(t)) is the superposition of a plurality of training sequences (bkt) each encoded with a user specific coding sequence (sk(t)) and transmitted by said users (k), said method further comprising:
sampling the received signals (yi(t)) received by each antenna (i) in the antenna array with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, but greater than the rate of innovation (ρ) of said received signals (yi(t)), for generating sets of sampled values (yi(nTs)),
computing sets of spectral values (Y,[m]) of said received signals (yi(t)) from said sets of sampled values (yi(nTs)),
recovering the spectral values (Sk[m]) of each of said user specific coding sequence (Sk(t)),
retrieving the delays (τk(l)), the amplitude attenuations (ak(l)) and the directions of arrival (θk(l)) induced by said communication channel on said sent signal (y(t)) from said sets of spectral values (Yi[m]) corresponding to said received signals (yi(t)) and from said spectral values (Sk[m]) corresponding to each of said user specific coding sequence (sk(t)).

23. Method according to claim 22, wherein retrieving said delays (τk(l)), said amplitude attenuations (ak(l)) and said directions of arrival (θk(l)) includes solving a series of two-dimensional estimation problems, the size of each said two-dimensional estimation problem being equal to the number of said sampled values (yi(nTs)) generated during one symbol duration (Tb).

24. Method according to claim 23, wherein said series of two-dimensional equation systems is derived from said spectral values (Yi[m]) of said received signal (yi(t)), said spectral values (Sk[m]) of each of said user specific coding sequence (sk(t)) and the value of the bits (bk(h)) of said training sequences (bkt).

25. Method according to claim 24, further comprising:
processing a second sent signal (y(t)) including a plurality of symbols (bk) each encoded with said user specific coding sequence (sk(t)) and transmitted by said users (k),
orienting the beams of said array of antennas (i) towards previously determined said arrival directions (θk(l)),
sampling said second sent signal (y(t)) with a sampling frequency lower than the sampling frequency given by the Shannon theorem, but greater than the rate of innovation (ρ) of said second sent signal (y(t)), for generating a second set of sampled values (y(nTs)).

26. Method according to claim 25, further comprising running a 2D-RAKE detection scheme using said second set of sampled values (y(nTs)) and previously computed said delays (τk(l)) and said amplitude attenuations (ak(l)) for estimating the value of the symbol (bk) sent by each said user (k).

27. Method according to claim 1, wherein said wireless communication channel comprises an Ultra Wideband (UWB) communication channel.

28. A non-transitory computer-readable medium on which is recorded a control program for a data processor, the computer-readable medium comprising instructions for causing the data processor to:
sample a signal (y(t)) sent over a wireless communication channel with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, lower than the chip rate (1/Tc) of said signal (y(t)), but greater than the rate of innovation (ρ) of said signal (y(t)), for generating a set of sampled values (y(nTs)) and
reconstruct the received signal (y(t)) using the set of sampled values (y(nTs)).

29. Receiver for decoding a signal (y(t)) sent over a bandwidth-expanding communication system according to the method of claim 1.

30. Receiver according to claim 29, comprising a memory for storing said spectral values (Sk[m]) of said signature sequences (sk(t)).

31. Set of at least two encoders for use with a receiver according to claim 29, each encoder (50) of said set of encoders being assigned at least one training sequence (bkt) to be sent over a bandwidth-expanding channel during a training phase (30), wherein said at least one training sequence (bkt) is chosen such that it is linearly independent from any other training sequence (bkt) assigned to any other encoder (50) of said set of encoders.

32. Set of at least two encoders according to claim 31, each said encoder (50) being assigned at least two said training sequences (bkt), wherein each said encoder (50) is designed to select from said at least two training sequences (bkt) the training sequence (bkt) to be sent during said training phase (30).

33. Set of at least two encoders according to claim 31, each said encoder (50) further being assigned a specific coding sequence (sk(t)) for coding a signal (x(t)) to be sent over said bandwidth-expanding channel, wherein said coding sequence (sk(t)) is chosen such that, when filtered with a lowpass filter (f), it is orthogonal to any specific coding sequence (sk(t)) assigned to any other encoder (50) of said set of encoders filtered with said lowpass filter (f).

34. An apparatus for processing a signal (y(t)) sent over a wireless communication channel, comprising:
a receiver configured to sample the received signal (y(t)) with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, lower than the chip rate (1/Tc) of said received signal (y(t)), but greater than the rate of innovation (ρ) of said received signal (y(t)), for generating a set of sampled values (y(nTs)) and to reconstruct the received signal (y(t)) using the set of sampled values (y(nTs)).

35. The apparatus of claim 34, further comprising a filter configured to filter the received signal (y(t)).

36. The apparatus of claim 35, wherein said filter is a lowpass filter.

37. The apparatus of claim 36, wherein said filter is a sinc filter.

38. The apparatus of claim 36, wherein said filter is a Gaussian filter.

39. The apparatus of claim 38, wherein said wireless communication channel comprises a multipath fading transmission channel.

40. The apparatus of claim 34, wherein said wireless communication channel comprises a CDMA channel.

41. The apparatus of claim 34, wherein said sampling frequency (1/Ts) is greater than the information rate (K/Tb) of said received signal (y(t)).

42. The apparatus of claim 34, wherein said sent signal (y(t)) includes a plurality of training sequences (bkt) each encoded with a user specific coding sequence (sk(t)) and transmitted by said users, said apparatus further comprising:
a computing device configured to compute a set of spectral values (Y[m]) corresponding to said received signal (y(t)) from said set of sampled values (y(nTs)); and
a processing device configured to recover spectral values (Sk[m]) corresponding to each of said user specific coding sequence (sk(t)), and recover the delays (τk(l)) and the amplitude attenuations (ak(l)) induced by said communication channel on said sent signal (y(t)), from said set of spectral values (Y[m]) corresponding to said received signal (y(t)) and from said spectral values (Sk[m]) corresponding to each of said user specific coding sequence (sk(t)).

43. The apparatus of claim 42, wherein the processing device is further configured to solve a series of one-dimensional estimation problems, the size of each said one-dimensional estimation problem being equal to the number of said sampled values (y(nTs)) generated during one symbol duration (Tb).

44. The apparatus of claim 43, wherein said series of one-dimensional equation systems is derived from said spectral values (Y[m]) of said received signal (y(t)), said spectral values (Sk[m]) of each of said user specific coding sequence (sk(t)) and the value of the bits (bk(h)) of said training sequences (bkt).

45. The apparatus of claim 44, wherein the receiver is further configured to process a second sent signal (y(t)) including a plurality of symbols (bk) each encoded with said user specific coding sequence (sk(t)) and transmitted by said users (k), and sample said second sent signal (y(t)) with a sampling frequency lower than the sampling frequency given by the Shannon theorem, but greater than the rate of innovation (ρ) of said second sent signal (y(t)), for generating a second set of sampled values (y(nTs)).

46. The apparatus of claim 45, wherein the receiver is further configured to run a multiuser detection scheme using said second set of sampled values (y(nTs)) and previously computed said delays (τk(l)) and said amplitude attenuations (ak(l)) for estimating the value of the symbol (bk) sent by each said user (k).

47. The apparatus of claim 46, wherein said multiuser detection scheme is a decorrelating detection scheme.

48. The apparatus of claim 46, wherein said multiuser detection scheme is a minimum mean-square error detection scheme.

49. The apparatus of claim 34, wherein said sent signal (y(t)) includes a plurality of symbols (bk) each encoded with said user specific coding sequence (sk(t)) and transmitted by said users (k), and
wherein the receiver is further configured to run a multiuser detection scheme using known delays (τk(l)) and amplitude attenuations (ak(l)) induced by said communication channel on said sent signal (y(t)) and using said set of sampled values (y(nTs)) and for estimating the value of the symbol (bk) sent by each said user (k).

50. The apparatus of claim 49, wherein said multiuser detection scheme is a decorrelating detection scheme.

51. The apparatus of claim 49, wherein said multiuser detection scheme is a minimum mean-square error detection scheme.

52. The apparatus of claim 34, wherein said sent signal (y(t)) includes a plurality of training sequences (bkt) each encoded with a user specific coding sequence (sk(t)) and transmitted by said users (k), said apparatus further comprising:
a computing device configured to compute a set of spectral values (Y[m]) of said received signal (y(t)) from said set of sampled values (y(nTs)); and
a processing device configured to compute a set of channel dependant values (C) from said set of spectral values (Y[m]) and said training sequences (bkt),
wherein the receiver is further configured to process a second sent signal (y(t)) including a plurality of symbols (bk) each encoded with said user specific coding sequence (sk(t)) and transmitted by said users (k), sample said second sent signal (y(t)) with a sampling frequency lower than the sampling frequency given by the Shannon theorem, but greater than the rate of innovation (ρ) of said second sent signal (y(t)), for generating a second set of sampled values (y(nTs)), and retrieve the value of the symbol (bk) sent by each said user (k) by solving a linear matrix system including said second set of sampled values (y(nTs)) and said set of channel dependant values (C).

53. The apparatus of claim 34, wherein said sent signal (y(t)) includes a plurality of symbols (bk) each encoded with said user specific coding sequence (sk(t)) and transmitted by said users (k), said user specific coding sequence (sk(t)) being chosen such that, when filtered with a lowpass filter (f), it is orthogonal to any other user's specific coding sequence (sk(t)) used in said communication channel and filtered with said lowpass filter (f), and wherein the receiver is further configured to sample said sent signal (y(t)) with a sampling frequency lower than the sampling frequency given by the Shannon theorem, but greater than the rate of innovation (ρ) of said sent signal (y(t)), for generating a set of sampled values (y(nTs)), the apparatus further comprising:
a bank of matched filters configured to filter said set of sampled values (y(nTs)), each filter being matched to said user specific coding sequence (sk(t)) filtered with said lowpass filter (f), for estimating the value of the symbol (bk) sent by each said user (k).

54. The apparatus of claim 34, wherein said communication channel comprises an array of antennas (i).

55. The apparatus of claim 54, wherein said sent signal (y(t)) is the superposition of a plurality of training sequences (bkt) each encoded with a user specific coding sequence (sk(t)) and transmitted by said users (k), and wherein the receiver is further configured to sample the received signals (yi(t)) received by each antenna (i) in the antenna array with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, but greater than the rate of innovation (ρ) of said received signals (yi(t)), for generating sets of sampled values (yi(nTs)), the apparatus further comprising:
a computing device configured to compute sets of spectral values (Yi[m]) of said received signals (yi(t)) from said sets of sampled values (yi(nTs)); and
a processing device configured to recover the spectral values (Sk[m]) of each of said user specific coding sequence (sk(t)), and retrieve the delays (τk(l)), the amplitude attenuations (ak(l)) and the directions of arrival (θk(l)) induced by said communication channel on said sent signal (y(t)) from said sets of spectral values (Yi[m]) corresponding to said received signals (yi(t)) and from said spectral values (Sk[m]) corresponding to each of said user specific coding sequence (sk(t)).

56. The apparatus of claim 55, wherein the processing device is further configured to solve a series of two-dimensional estimation problems, the size of each said two-dimensional estimation problem being equal to the number of said sampled values (yi(nTs)) generated during one symbol duration (Tb).

57. The apparatus of claim 56, wherein said series of two-dimensional equation systems is derived from said spectral values (Yi[m]) of said received signal (yi(t)), said spectral values (Sk[m]) of each of said user specific coding sequence (sk(t)) and the value of the bits (bk(h)) of said training sequences (bkt).

58. The apparatus of claim 57, wherein the receiver is further configured to process a second sent signal (y(t)) including a plurality of symbols (bk) each encoded with said user specific coding sequence (sk(t)) and transmitted by said users (k), orient the beams of said array of antennas (i) towards previously determined said arrival directions (θk(l)), and sample said second sent signal (y(t)) with a sampling frequency lower than the sampling frequency given by the Shannon theorem, but greater than the rate of innovation (ρ) of said second sent signal (y(t)), for generating a second set of sampled values (y(nTs)).

59. The apparatus of claim 58, wherein the receiver is further configured to run a 2D-RAKE detection scheme using said second set of sampled values (y(nTs)) and previously computed said delays (τk(l)) and said amplitude attenuations (ak(l)) for estimating the value of the symbol (bk) sent by each said user (k).

60. The apparatus of claim 34, wherein said wireless communication channel comprises an Ultra Wideband (UWB) communication channel.

61. An apparatus for processing a signal, comprising:
means for receiving a signal (y(t)) over a wireless communication channel; and
means for sampling the received signal (y(t)) with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, lower than the chip rate (1/Tc) of said received signal (y(t)), but greater than the rate of innovation (ρ) of said received signal (y(t)), for generating a set of sampled values (y(nTs))
means for reconstructing the received signal (y(t)) using the set of sampled values (y(nTs)).

62. A mobile station for wireless communication, comprising:
at least one antenna; and
a receiver configured to receive a signal (y(t)) over a wireless communication channel via the at least one antenna, and sample the signal (y(t)) with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, lower than the chip rate (1/Tc) of said received signal (y(t)), but greater than the rate of innovation (ρ) of said received signal (y(t)), for generating a set of sampled values (y(nTs)) and to reconstruct the received signal (y(t)) using the set of sampled values (y(nTs).

63. Method for processing a signal (y(t)) sent over a wireless communication channel, comprising:
sampling the received signal (y(t)) with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, lower than the chip rate (1/Tc) of said received signal (y(t)), but greater than the rate of innovation (ρ) of said received signal (y(t)), for generating a set of sampled values (y(nTs))
reconstructing the received signal (y(t)) using the set of sampled values (y(nTs)), wherein the step of reconstructing comprises, retrieving delays (τk(l)) and amplitude attenuations (ak(l)) induced by said communication channel on said sent signal (y(t)), from a set of spectral values (Y[m]) corresponding to said received signal (y(t)) and from spectral values (Sk[m]) corresponding to a user specific coding sequence (sk(t)).

64. Method for processing a signal (y(t)) sent over a wireless communication channel, comprising:
sampling the received signal (y(t)) with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, lower than the chip rate (1/Tc) of said received signal (y(t)), but greater than the rate of innovation (ρ) of said received signal (y(t)), for generating a set of sampled values (y(nTs)), wherein said sent signal (y(t)) includes a plurality of training sequences (bkt) each encoded with a user specific coding sequence (sk(t)) and transmitted by said users (k), said method further comprising,
reconstructing the received signal (y(t)) using the set of sampled values (y(nTs)), wherein the step of reconstructing comprises, computing a set of spectral values (Y[m]) corresponding to said received signal (y(t)) from said set of sampled values (y(nTs)), recovering spectral values (Sk[m]) corresponding to each of said user specific coding sequence (sk(t)), retrieving the delays (τk(l)) and the amplitude attenuations (ak(l)) induced by said communication channel on said sent signal (y(t)), from said set of spectral values (Y[m]) corresponding to said received signal (y(t)) and from said spectral values (Sk[m]) corresponding to each of said user specific coding sequence (sk(t)).

65. Method for processing a signal (y(t)) sent over a wireless communication channel, comprising:
sampling the received signal (y(t)) with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, lower than the chip rate (1/Tc) of said received signal (y(t)), but greater than the rate of innovation (ρ) of said received signal (y(t)), for generating a set of sampled values (y(nTs)),
reconstructing the received signal (y(t)) using the set of sampled values (y(nTs)), wherein the step of reconstructing comprises, retrieving delays (τk(l)) and amplitude attenuations (ak(l)) induced by said communication channel on said sent signal (y(t)), from a set of spectral values (Y[m]) corresponding to said received signal (y(t)) and from spectral values (Sk[m]) corresponding to a user specific coding sequence (sk(t)), wherein retrieving said delays (τk(l)) and said amplitude attenuations (ak(l)) includes solving a series of one-dimensional estimation problems, the size of each said one-dimensional estimation problem being equal to the number of said sampled values (y(nTs)) generated during one symbol duration (Tb).

66. Method for channel estimation comprising:
sending a signal over an channel to be estimated;
receiving the sent signal (y(t));
determining the rate of innovation (ρ) of said received signal (y(t));
sampling the received signal (y(t)) with a sampling frequency (fs) lower than the sampling frequency given by the Shannon theorem, lower than the chip rate (1/Tc) of said received signal (y(t)), but greater than the rate of innovation (ρ) of said received signal (y(t)), for generating a set of sampled values (y(nTs))
using the set of sampled values (y(nTs)) to estimate the channel.