Abstract:
The method seeks a high-performance detection of a signal burst transmitted on the initiative of a sender on a radio channel listened to by a receiver system. The transmitted burst represents a predetermined digital sequence, serving for example to request access to a radio system or to ensure the synchronization of a radio interface. Channel parameters representing a statistical behavior of the radio channel are estimated and a detection magnitude is evaluated on the basis of the estimated channel parameters and of a correlation between a signal received at the receiver system and the predetermined digital sequence. The estimated channel parameters comprise moments of order greater than 2 of the gain on the radio channel.

Description:
BACKGROUND OF THE INVENTION 
     The present invention relates to the detection, by a receiver, of signal bursts transmitted on a radio channel in a communication system. 
     It finds an application in particular in the detection of short bursts sent in a radiocommunication network. These bursts may be of various types, such as initial-synchronization bursts or bursts of random access to the mobile network. The latter case will be more particularly developed hereinbelow, without this being limiting. 
     When a mobile terminal of a communication network wishes to avail itself of communication resources, for example to make a call, it executes a request to the network that manages and distributes the resources. This random access request generally consists in the transmission of a message whose preamble is a signal burst representing a predetermined digital sequence. This message is sent on an uplink radio channel listened to by a reception system of the network. In radiocommunication systems such as GSM (“Global System for Mobile communications”) and UMTS (“Universal Mobile Telecommunication System”), this channel is called RACH or PRACH (“Packet Random Access CHannel”). The format of such a message is in particular described in section 5.2.2.2 of the TS 25.211 technical specification version 5.2.0 Release 5, “Physical channels and mapping of transport channels onto physical channels (FDD)”, published in September 2002 by the 3GPP organization. 
     Reliable detection of random access bursts on the RACH is important since the communications setup failure rate seen by a mobile radio user depends directly thereon. 
     An improvement in the reliability of detection is particularly beneficial in respect of reception systems that comprise sectorial or omnidirectional smart antennas. 
     In the UMTS system, the predetermined digital sequence sent on the RACH channel by a mobile terminal has a size of 4096 “chips”, a chip being an element of code in accordance with the coding used in the system. The data exchanged consist of 10 ms frames, themselves subdivided into 15 time intervals (or “slots”) of 666 μs, corresponding to 2560 chips. Thus, the signal burst associated with the digital sequence sent on the RACH is received within an interval corresponding to two consecutive slots. 
     When the radio network wishes to determine whether a random access burst has been transmitted on an RACH channel, it calculates for the 1024 (=2×2560−4096) possible positions of the digital sequence of the burst within two consecutive slots, a correlation between the sequence as detected and the predetermined digital sequence which is known to the network. 
     A criterion must be defined to decide, on the basis of such a correlation, whether the predetermined digital sequence is present. This criterion is customarily based on the correlation&#39;s energy level which is compared with a predefined threshold level. 
     However, depending on the propagation conditions of the radio channel used, the signal received by the radio network is attenuated to a greater or lesser extent. It follows that the fixing of the threshold is tricky: too low a threshold gives rise to numerous false detections that disturb the system, whereas too high a threshold causes access requests originating from terminals relatively far from the base station to be missed. 
     A power ramp can be used by the mobile terminal to regularly retransmit the burst for access to the network on the RACH channel, with increased transmission power for each new transmission, for as long as the network has not responded to its request for resources. This method makes it possible to improve the detection of the burst by the radio network, in particular in the case where the low transmission power of the first transmissions is the reason for the absence of detection of the burst on the RACH. 
     However, through the repetition of the random access burst on the RACH, this method occupies the channel to the detriment of any requests from the other users. Furthermore, the high power of the signals thus repeated may create nuisance interference in the system. 
     An object of the present invention is to propose a method for detecting predefined signals which makes it possible to attenuate the drawbacks of the known methods. 
     Another object of the invention is to enhance the consideration of the propagation conditions on the radio channel so as to improve the detection of the transmitted bursts. 
     SUMMARY OF THE INVENTION 
     The invention thus proposes a method for detecting a signal burst transmitted on the initiative of a sender on a radio channel listened to by a receiver system, the transmitted burst representing a predetermined digital sequence, in which method channel parameters representing a statistical behavior of the radio channel are estimated and a detection magnitude is evaluated on the basis of the estimated channel parameters and of a correlation between a signal received at the receiver system and the predetermined digital sequence. According to the invention, said estimated channel parameters comprise moments of order greater than 2 of the gain on the radio channel. 
     Thus, the propagation conditions of the radio channel are finely considered, so as to detect the burst transmitted with increased reliability over a wide span of the attenuation that it is apt to undergo. 
     The invention also proposes a receiver system for the implementation of such a detection method. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWING 
       The single FIGURE is a diagram of a system implementing the invention. 
     
    
    
     DESCRIPTION OF PREFERRED EMBODIMENTS 
     Dealt with hereinbelow is the nonlimiting case of an embodiment of the invention applied to the detection of a signal burst of random access to a cellular radio network. 
     The mobile terminal  1  sends a signal burst over a RACH type channel when it wishes to access the network and obtain communication resources therefrom. 
     The network is composed mainly of a network core providing for the switching of the data and the connection to other communication networks, such as the PSTN (“Public Switched Telephone Network”), and of a radio network responsible for the exchanges of data and of signaling with mobile terminals. 
     The radio network generally comprises send and receive systems, belonging to base stations, as well as base station controllers providing for the functions of higher level than the simple transmission of the data, such as the management of radio resources or of mobility for example. Certain functions may be executed either by the base stations or by the base station controllers. Certain of them may also be performed in a shared manner by these entities. 
     The FIGURE shows a base station including a reception system  2  capable of receiving signals sent in particular by the terminal  1 . In an advantageous but non-restrictive manner, certain of the functions performed by the reception system  2 , which will be detailed hereinbelow, are the responsibility of the controller on which this base station depends. This controller  3  is called the BSC (“Base Station Controller”) in the terminology used in the GSM system. In the UMTS system, the base station is sometimes dubbed “node B” and the base station controller is called the RNC (“Radio Network Controller”). 
     The reception system  2  illustrated in the FIGURE comprises two main reception paths, in-phase (I) and quadrature (Q). The radio signal received is mixed with two quadrature radio waves at the carrier frequency. After low-pass filtering, the two components resulting therefrom form an in-phase signal Z x  and a quadrature signal Z y  respectively which, together, may be seen as constituting a complex signal Z=Z x +j.Z y . 
     The signal Z comprises the signals possibly sent by the mobile terminal  1  and also the residual signals consisting of noise and of interference. Given that the carrier frequencies are generally shared by several users, the signals transmitted by other mobile terminals constitute interference, similar to the noise in a CDMA system such as UMTS. At each instant the system  2  therefore receives signals Z x , Z y  consisting of digital sequences on each of the two paths I and Q. 
     The predetermined digital sequence represented by the random access burst is a sequence s of M samples (chips in a CDMA system) having a sufficient length to ensure detection under good conditions. In the case of UMTS, it is M=4096 chips, i.e. slightly more than a millisecond (the chip rate is 3.84 Mchip/s). To detect the possible presence of such a burst, the receiver system comprises two filters  3 , respectively on the I and Q paths, which are matched to the predetermined sequence of chips, and which carry out the operation z=Z.s*, where (.)* denotes the complex conjugate. The complex signal z=z x +j.z y  produced by these filters  3  thus represents a correlation between the signal received and the sequence to be detected, calculated at the chip frequency. The two real signals z x  and z y , correspond respectively to the real and imaginary components of the signal detected after matched filtering. 
     Having detected the complex signal z=z x +j z y , the receiver system  2  performs a calculation to determine the likelihood according to which this signal z reveals the presence of the known digital sequence sent on the RACH by the mobile terminal  1 . 
     Let H1 be the hypothesis according to which the random access burst was sent on the RACH channel and H0 the complementary hypothesis according to which only noise is present. The ratio of the probabilities based on knowing the detected signal z may be written as follows, according to Bayes&#39; formula:
 
 P ( H 1/ z )/ P ( H 0 /z )=( P ( z/H 1)/ P ( z/H 0))×( P ( H 1)/ P ( H 0))  (1)
 
where P(a/b) denotes the probability of a knowing b.
 
     The receiver system  2  regards the burst as having been sent on the RACH if this ratio P(H1/z)/P(H0/z) is greater than a certain threshold c. Furthermore, the ratio 
                 P   ⁡     (     H   ⁢           ⁢   1     )         P   ⁡     (     H   ⁢           ⁢   0     )         =       P   ⁡     (     H   ⁢           ⁢   1     )         1   -     P   ⁡     (     H   ⁢           ⁢   1     )                 
is independent of the signal detected. The ratio P(H1/z)/P(H0/z) can be regarded as greater than the detection threshold c, if the ratio P(z/H1)/P(z/H0) is greater than a threshold c′, such that c′=c×P(H0)/P(H1).
 
     The receiver system  2  therefore evaluates the ratio of probabilities P(z/H1)/P(z/H0) to decide, by comparison with a threshold, whether a random access burst has or has not been detected on the RACH channel. This evaluation advantageously considers the propagation conditions on this channel. 
     The signal detected by the receiver system  2  subsequent to the sending of a burst may be written in the form Z=a.s+n, where a denotes the attenuation or gain of the propagation channel and n denotes the Gaussian white noise picked up by the system  2 . 
     At the output of the filters  3  matched to the sequence s, the signal may then be written z=a.|s| 2 +n′, where n′=n.s* also has the properties of Gaussian noise. Without affecting generality, the sequences s may be regarded as normed, i.e. |S| 2 =1. 
     The probability of detecting the signal z after matched filtering given that the predefined sequence was sent on the RACH can then be written: 
                 P   ⁡     (       z   /   H     ⁢           ⁢   1     )       =       1       π   ⁢           ⁢     N   0           ·       ∫   C     ⁢       ⅇ       -     1     N   0         ·            z   -   a          2         ·     p   ⁡     (   a   )       ·     ⅆ   a             ,         
with C the set of possible realizations of the complex gain a on the propagation channel, N 0  the power of the noise and p(a) the probability density of the gain a. Likewise, the probability of detecting the signal z after matched filtering given that noise alone was received can be written:
 
               P   ⁡     (       z   /   H     ⁢           ⁢   0     )       =       1       π   ⁢           ⁢     N   0           ·       ⅇ       -     1     N   0         ·          z        2         .             
From this we deduce the relation:
 
     
       
         
           
             
               
                 
                   
                     
                       P 
                       ⁡ 
                       
                         ( 
                         
                           
                             z 
                             / 
                             H 
                           
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           1 
                         
                         ) 
                       
                     
                     
                       P 
                       ⁡ 
                       
                         ( 
                         
                           
                             z 
                             / 
                             H 
                           
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           0 
                         
                         ) 
                       
                     
                   
                   = 
                   
                     
                       ∫ 
                       C 
                     
                     ⁢ 
                     
                       
                         ⅇ 
                         
                           
                             - 
                             
                               1 
                               
                                 N 
                                 0 
                               
                             
                           
                           · 
                           
                             ( 
                             
                               
                                 
                                    
                                   a 
                                    
                                 
                                 2 
                               
                               - 
                               
                                 2 
                                 · 
                                 
                                   ℜe 
                                   ⁡ 
                                   
                                     ( 
                                     
                                       za 
                                       * 
                                     
                                     ) 
                                   
                                 
                               
                             
                             ) 
                           
                         
                       
                       · 
                       
                         p 
                         ⁡ 
                         
                           ( 
                           a 
                           ) 
                         
                       
                       · 
                       
                         ⅆ 
                         a 
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
     If the signal z is expanded according to its two components for each of the two paths, we have z=z x  +j z y . Likewise, the gain of the propagation channel a can be written in the form: a=a x +j a y . The independence of the two random variables a x  and a y  makes it possible to factorize the probability density p(a) into the form: p x (a x )·p y (a y ) and to write: 
                             P   ⁡     (       z   /   H     ⁢           ⁢   1     )         P   ⁡     (       z   /   H     ⁢           ⁢   0     )         =       ⁢       ∫   C     ⁢         ⅇ       -     1     N   0         ·     (       a   x   2     +     a   y   2     -     2   ⁢     (         z   x     ⁢     a   x       +       z   y     ⁢     a   y         )         )         ·       p   x     ⁡     (     a   x     )         ⁢         p   y     ⁡     (     a   y     )       ·     ⅆ     a   x         ⁢     ⅆ     a   y                       =       ⁢       (       ∫   R     ⁢       ⅇ       -     1     N   0         ·     (       a   x   2     -     2   ⁢     z   x     ⁢     a   x         )         ·       p   x     ⁡     (     a   x     )       ·     ⅆ     a   x           )     ·                     ⁢     (       ∫   R     ⁢       ⅇ       -     1     N   0         ·     (       a   y   2     -     2   ⁢     z   y     ⁢     a   y         )         ·       p   y     ⁡     (     a   y     )       ·     ⅆ     a   y           )                   (   3   )               
where R denotes the set of real numbers.
 
     Moreover, the Hermite polynomials are polynomials of order n, n being a natural integer, which satisfy the following differential equation:
 
−H n ″(x)+2×.H n ′(x)=2n.H n (x).
 
The first few Hermite polynomials, for orders going from 0 to 5 are the following:
         H 0 (x)=1; H 1 (x)=2x;   H 2 (x)=4x 2 −2; H 3 (x)=8x 3 −12x;   H 4 (x)=16x 4 −48x 2 +12; H 5 (x)=32x 5 −160x 3 +120x.       

     These polynomials satisfy the equation: 
                 ⅇ       2   ⁢   uv     -     u   2         =       ∑     n   =   0     ∞     ⁢           ⁢         H   n     ⁡     (   v   )       ·       u   n       n   !             ,         
so that we may write:
 
                 ∫   R     ⁢       ⅇ       -     1     N   0         ·     (       a   x   2     -     2   ⁢     z   x     ⁢     a   x         )         ·       p   x     ⁡     (     a   x     )       ·     ⅆ     a   x           =         ∫   R     ⁢       (       ∑     n   =   0     ∞     ⁢           ⁢       1     n   !       ·       H   n     ⁡     (       z   x         N   0         )       ·       (       a   x         N   0         )     n         )     ·       p   x     ⁡     (     a   x     )       ·     ⅆ     a   x           =         ∑               n   =   0     ∞     ⁢           ⁢       1       n   !     ⁢       (       N   0       )     n         ·       H   n     ⁡     (       z   x         N   0         )       ·     ma     x   ,   n                   
with
 
               ma     x   ,   n       =       ∫   R     ⁢       a   x   n     ·       p   x     ⁡     (     a   x     )       ·     ⅆ     a   x                 
representing the moment of order n of the distribution of the in-phase component of the gain of the propagation channel. Likewise:
 
                   ∫   R     ⁢       ⅇ       -     1     N   0         ·     (       a   y   2     -     2   ⁢     z   y     ⁢     a   y         )         ·       p   y     ⁡     (     a   y     )       ·     ⅆ     a   y           =       ∑     n   =   0     ∞     ⁢           ⁢       1       n   !     ⁢       (       N   0       )     n         ·     
     ⁢           ⁢       H   n     ⁡     (       z   y         N   0         )       ·     ma     y   ,   n             ,         
with
 
               ma     y   ,   n       =       ∫   R     ⁢       a   y   n     ·       p   y     ⁡     (     a   y     )       ·     ⅆ     a   y                 
representing the moment of order n of the distribution of the quadrature component of the gain of the propagation channel.
 
     Consequently, the probability ratio P(z/H1)/P(z/H0) may be written: 
     
       
         
           
             
               
                 
                   
                     
                       
                         
                           
                             P 
                             ⁡ 
                             
                               ( 
                               
                                 z 
                                 / 
                                 H1 
                               
                               ) 
                             
                           
                           
                             P 
                             ⁡ 
                             
                               ( 
                               
                                 z 
                                 / 
                                 H0 
                               
                               ) 
                             
                           
                         
                         = 
                           
                         ⁢ 
                         
                           
                             ( 
                             
                               
                                 ∑ 
                                 
                                   n 
                                   = 
                                   0 
                                 
                                 ∞ 
                               
                               ⁢ 
                               
                                   
                               
                               ⁢ 
                               
                                 
                                   1 
                                   
                                     
                                       n 
                                       ! 
                                     
                                     ⁢ 
                                     
                                       ( 
                                       
                                         
                                           
                                             
                                               N 
                                               0 
                                             
                                             ) 
                                           
                                           n 
                                         
                                       
                                     
                                   
                                 
                                 · 
                                 
                                   
                                     H 
                                     n 
                                   
                                   ⁡ 
                                   
                                     ( 
                                     
                                       
                                         z 
                                         x 
                                       
                                       
                                         
                                           N 
                                           0 
                                         
                                       
                                     
                                     ) 
                                   
                                 
                                 · 
                                 
                                   ma 
                                   
                                     x 
                                     , 
                                     n 
                                   
                                 
                               
                             
                             ) 
                           
                           · 
                         
                       
                     
                   
                   
                     
                       
                           
                         ⁢ 
                         
                           ( 
                           
                             
                               ∑ 
                               
                                 n 
                                 = 
                                 0 
                               
                               ∞ 
                             
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               
                                 1 
                                 
                                   
                                     n 
                                     ! 
                                   
                                   ⁢ 
                                   
                                     
                                       ( 
                                       
                                         
                                           N 
                                           0 
                                         
                                       
                                       ) 
                                     
                                     n 
                                   
                                 
                               
                               · 
                               
                                 
                                   H 
                                   n 
                                 
                                 ⁡ 
                                 
                                   ( 
                                   
                                     
                                       z 
                                       y 
                                     
                                     
                                       
                                         N 
                                         0 
                                       
                                     
                                   
                                   ) 
                                 
                               
                               · 
                               
                                 ma 
                                 
                                   y 
                                   , 
                                   n 
                                 
                               
                             
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
     
     According to the invention, a calculation module  5  of the receiver system  2  estimates the moments ma x,n  and ma y,n  at the output of the matched filters  3  for each of the two reception paths respectively. 
     This evaluation is performed over a time interval referred to as the evaluation interval and which corresponds to a smaller number of chips than the number of possible positionings of the random access burst inside two consecutive slots. Returning to the case of UMTS, where there are 1024 possible positions of the burst inside two consecutive slots, it is possible to choose for example an evaluation interval corresponding to 32 chips. 
     The evaluation of the moments then consists in estimating the probability p x (a x ), p y (a y ) of finding each value of a component characteristic of the gain of the propagation channel a x,n  and a y,n  in the corresponding sample of the signal detected in the evaluation interval. These probabilities are then weighted by the n th  power of the associated component value, before being summed, as is indicated by the formulae 
               ma     x   ,   n       =         ∫   R             ⁢         a   x   n     ·       p   x     ⁡     (     a   x     )       ·           ⁢     ⅆ     a   x         ⁢           ⁢   and   ⁢           ⁢     ma     y   ,   n           =       ∫   R             ⁢       a   y   n     ·       p   y     ⁡     (     a   y     )       ·           ⁢     ⅆ     a   y                   
respectively.
 
     After each new evaluation, the module  5  for calculating the moments sends the result of its calculation to a module  6  for detecting the RACH of the receiver system  2 . This module calculates the probability ratio P(z/H1)/P(z/H0) by virtue of formula (4), truncating the summation to an order k for example of 3 to 7: 
     
       
         
           
             
               
                 
                   
                     
                       P 
                       ⁡ 
                       
                         ( 
                         
                           z 
                           / 
                           H1 
                         
                         ) 
                       
                     
                     
                       P 
                       ⁡ 
                       
                         ( 
                         
                           z 
                           / 
                           H0 
                         
                         ) 
                       
                     
                   
                   = 
                     
                   ⁢ 
                   
                     
                       ( 
                       
                         
                           ∑ 
                           
                             n 
                             = 
                             0 
                           
                           k 
                         
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         
                           
                             1 
                             
                               
                                 n 
                                 ! 
                               
                               ⁢ 
                               
                                 
                                   ( 
                                   
                                     
                                       N 
                                       0 
                                     
                                   
                                   ) 
                                 
                                 n 
                               
                             
                           
                           · 
                           
                             
                               H 
                               n 
                             
                             ⁡ 
                             
                               ( 
                               
                                 
                                   z 
                                   x 
                                 
                                 
                                   
                                     N 
                                     0 
                                   
                                 
                               
                               ) 
                             
                           
                           · 
                           
                             ma 
                             
                               x 
                               , 
                               n 
                             
                           
                         
                       
                       ) 
                     
                     · 
                   
                 
               
             
             
               
                 
                     
                   ⁢ 
                   
                     
                       ( 
                       
                         
                           ∑ 
                           
                             n 
                             = 
                             0 
                           
                           k 
                         
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         
                           
                             1 
                             
                               
                                 n 
                                 ! 
                               
                               ⁢ 
                               
                                 
                                   ( 
                                   
                                     
                                       N 
                                       0 
                                     
                                   
                                   ) 
                                 
                                 n 
                               
                             
                           
                           · 
                           
                             
                               H 
                               n 
                             
                             ⁡ 
                             
                               ( 
                               
                                 
                                   z 
                                   y 
                                 
                                 
                                   
                                     N 
                                     0 
                                   
                                 
                               
                               ) 
                             
                           
                           · 
                           
                             ma 
                             
                               y 
                               , 
                               n 
                             
                           
                         
                       
                       ) 
                     
                     . 
                   
                 
               
             
           
         
       
     
     This calculation is straightforward since the moments ma x,n  and ma y,n  have been provided by the module  5 . The variance N 0  of the noise is conventionally available in the receiver, on the basis of an average of the energy of the complex signal at the output of the matched filters  3 . 
     It is particularly advantageous for the number k to be greater than 2, so as to consider the moments of high order that finely convey the behavior of the channel. The detection module  6  can store tables giving the certain typical values, the corresponding value for the Hermite polynomials. This enables the value of the ratio P(z/H1)/P(z/H0) to be easily determined for any new detected value of Z x  and Z y  inside the moments evaluation interval. 
     The probability ratio thus determined is then compared by the detection module  6  with a threshold c′ for example fixed according to an RACH detection reliability objective. If the ratio P(z/H1)/P(z/H0) is greater than c′ (this corresponding to the fact that the ratio P(H1/z)/P(H0/z) itself exceeds a certain threshold as was seen above), the receiver system  2  then regards the predefined sequence as having been sent on the RACH channel. It will thus be possible for resources to be made available to the requester terminal. 
     In the converse case, where the ratio P(z/H1)/P(z/H0) is less than c′, the reception system  2  may decide to conclude that no sequence has been sent on the RACH channel. 
     Of course, in the case where the decision of the receiver system  2  is erroneous, for example if it ignores a request sent by the terminal  1  on the RACH, the terminal, which does not receive the expected response, can apply a method of repetition to improve the reliability of detection by the receiver system  2 , for example by implementing a power ramp. 
     As was indicated earlier, the invention applies also to any other type of signal transmitted within a reception window of greater size than that of the digital sequence associated with the signal transmitted. For example, it may be applied to the detection of a synchronization message transmitted by a base station for the attention of a mobile terminal on an SCH channel (“Synchronization Channel”) in a GSM or UMTS system for example. The SCH is described in section 5.3.3.5 of the aforesaid technical specification TS 25.211. It consists of two subchannels: a primary SCH and a secondary SCH. Each of these subchannels can carry messages of 256 chips, hence of much smaller size than that of a slot (2560 chips). 
     In this case, the sender on the SCH channel is a base station of the radio network, whereas the receiver system such as described above forms part of a mobile terminal. The burst belongs to a radio signal sequence sent periodically to synchronize the two ends of the radio link. The reliability of estimation of the moments ma x,n  and ma y,n  is strengthened thereby since the moments are then estimated over a duration that may be longer than in the case of the RACH channel, that is to say a duration covering several periods of the radio signal sequence sent on the SCH channel. A duration of the order of that for which the channel may be regarded as stationary (&lt;100 ms) will typically be chosen. In UMTS, the predefined burst sent on the SCH channel represents around 10% of each slot. It is for example possible to calculate the moments over five frames, i.e. 50 ms or 75 slots. 
     It should also be noted that the present invention applies also to any other type of radiocommunication system where detection of the signals transmitted is necessary (radar for example). 
     In another advantageous embodiment, the receiver system used is a rake receiver, which comprises a certain number of “fingers” operating in parallel to estimate the digital symbols received. The gain in reception diversity results from the combining of the estimations obtained in the various fingers of the receiver. 
     In this case, a signal z containing a pilot sequence known to the receiver system is transmitted at predetermined instants. The signal may for example be transmitted on dedicated or common channels, traffic channels in particular. The receiver system then evaluates, for a certain number of fingers of the rake, moments ma x,n  and ma y,n  and a probability ratio P(z/H1)/P(z/H0) based on these moments. 
     When successive values of the ratio P(z/H1)/P(z/H0) have been obtained for each of these fingers, the latter then form the subject of a ranking so as to identify the fingers for which the signal transmitted was detected with a high correlation on the basis of the pilot sequence, that is to say the fingers that have a predominant contribution in the detection of the signals transmitted. The fingers thus identified may then be selected by the receiver system so as to be used during the subsequent receptions.