Abstract:
A transmission signal (S) resulting from modulation of a digital data signal by a modulation function dependent on time t, the data signal being formed of a series of bits (b k ) each identified by its rank k and having a duration T, the transmission signal (S) consisting of a summation indexed to the rank k of the product of the complex constant j to the power k, of the modulation function (h(t−kT) and of an input signal. The input signal F(k) being a function of the data signal (b k ), the modulation function h(t−kT) is a Gaussian function of time t.

Description:
RELATED APPLICATION 
   This application is the national filing of international application number PCT/FR98/02812, which claims the priority of FR 97/16454 filed Dec. 22, 1997. 

   BACKGROUND OF THE INVENTION 
   The present invention relates to a technique for modulating a digital signal. 
   It therefore applies to the transmission art, in particular the radio transmission art. 
   A typical application is aimed at radio systems, in particular “broadband” systems. These systems are naturally designed to offer a high capacity and it is therefore necessary to use a modulation technique that offers high spectral efficiency, which amounts to saying that the spectrum of a given channel must be as narrow as possible consistent with its technical specifications. 
   Moreover, constant envelope modulation is generally employed, which minimizes the complexity of transmitters. If the signal features variations of relatively large amplitude, the amplification stages must be perfectly linear, especially the power amplifier. 
   It nevertheless appears to be the case that all forms of constant envelope modulation known in the art until now have a spectrum which features a side lobe. 
   If it is within the spectrum of a neighboring channel, the side lobe increases the level of interference in that neighboring channel. 
   The Gaussian minimum shift keying (GMSK) modulation technique employed in the GSM has a −40 dBc side lobe at 200 kHz from the main lobe. The spacing between two adjacent channels is also 200 kHz. Obviously this reduces spectral efficiency. 
   The spectrum of quadrature amplitude modulation (QAM) has no side lobe if an appropriate filter is used. 
   However, these modulation techniques cause strong variations in the amplitude of the modulated signal. As mentioned above, it is necessary to use more complex and therefore more cost amplifiers in this case. 
   SUMMARY OF THE INVENTION 
   The object of the present invention is therefore to provide a modulation technique which offers a spectrum with no side lobe but which still has a practically constant envelope. 
   The invention therefore provides a transmission signal resulting from modulation of a digital data signal by a modulation function dependent on time t, the data signal being formed of a series of bits b k  each identified by its rank k and having a duration T, the transmission signal (S) consisting of a summation indexed to the rank k of the product of the complex constant i to the power k, of the modulation function h(t−kT) and of an input signal. According to the invention, since the input signal is a function of the data signal, the modulation function is a Gaussian function of time t. 
   The modulation function is advantageously defined by the following equation, in which the parameter σ is a form factor which determines the spreading of a bit: 
         h   ⁡     (   t   )       =       1     σ   ⁢           ⁢   T   ⁢       2   ⁢   π           ⁢     ⅇ     -       t   2       2   ⁢     σ   2     ⁢     T   2                   
 
   The simplest embodiment of the invention defines the input signal as equal to the data signal. 
   However, if this solution is adopted, the transmission signal is still subject to amplitude variations which, although minimal, still impose some constraints on the amplifiers of the transmitter. 
   Accordingly, the input signal E(k) preferably has the value: 
         F   ⁡     (   k   )       =       ∑     n   =   0     N     ⁢           ⁢       a   n     ⁢     B   k   n             
         where:   N is a positive natural integer,   a is a positive correction constant,   the polynomial B k   n  is defined as follows:   where: 
         B   k   n     =       ∑     1   =   i     L     ⁢           ⁢     (       ∏     i   =   0       2   ⁢           ⁢   M       ⁢           ⁢     b     k   +     p     1   ,   i             )           
   a family (F 1 ) of relative integers P l,i  is constructed so that there is a natural integer M   which satisfies the following equations: 
           ∑     i   =   0     M     ⁢           ⁢     p     1   ,     2   ⁢   i           =       ∑     i   =   1     M     ⁢           ⁢     p     1   ,       2   ⁢   i     -   1               
             ∑     i   =   0     M     ⁢           ⁢     p     1   ,     2   ⁢   i       2       -       ∑     i   =   1     M     ⁢           ⁢     p     1   ,       2   ⁢   i     -   1       2         =     2   ⁢           ⁢   n         
   p l,i &lt;p l,i+1  (for all i)   L represents the total number of these families.       

   For example, the correction constant has the value 
         ⅇ     -     1     σ   2           .       
 
   The invention also relates to a modulator for producing the transmission signal. 
   In a preferred embodiment of the invention, the modulator comprises a digital processor which receives said input signal and produces the real part and the imaginary part of the transmission signal, a first mixer which multiplies the real part by a carrier, a phase-shifter which receives the carrier and phase-shifts it by π/2, a second mixer which multiplies the imaginary part by the output signal of the phase-shifter, and an adder which sums the output signals of the two mixers. 
   When the correction level is greater than zero the digital processor includes a first module for producing the polynomials B k   n . 
   The digital processor further comprises a second module for producing digital samples of the transmission signal, four samples E rk+1  being associated with the bit b k  for i varying from 0 to 3 and having the value: 
         E       4   ⁢   k     +   i       =       ∑     q   =   k       k   -   5       ⁢           ⁢       j   q     ·     (       b   q     +       1   8     ·     B   q   1       +       1   64     ·     B   q   2         )     ·     h       4   ⁢     (     k   -   q     )       +   i               
 
   The invention also provides a demodulator for reproducing the data signal from the transmission signal. 
   The demodulator preferably comprises a baseband transposition unit which receives a signal which has been modulated by the modulation function, a complex multiplier which multiplies the output signal of the transposition unit by the expression 
         e       -   j     ⁢       π   ⁢           ⁢   i       2   ⁢   t           ,       
 
a convolution operator which convolutes the output signal of the complex multiplier and the modulation function, and a decision unit which reproduces the data signal as a function of the sign of the real part of the result of the convolution.
 
   The transposition unit is routinely a Hilbert filter. 

   
     BRIEF DESCRIPTION OF THE DRAWINGS 
     The present invention will now emerge in more detail from the following description of embodiments of the invention, which description is given by way of illustrative example only and with reference to the accompanying diagrammatic drawings, in which: 
       FIG. 1  shows a modulator according to the invention, 
       FIG. 2  shows a first module of one embodiment of the modulator, 
       FIG. 3  shows a second module of the same embodiment of the modulator, and 
       FIG. 4  shows a demodulator according to the invention. 
   

   DESCRIPTION OF THE PREFERRED EMBODIMENTS 
   It is therefore a question of modulating a digital data signal which consists of a stream of bits b k  taking the value +1 or −1. 
   The following expression is known in the art for a modulated transmission signal S with various types of modulation:
         where: 
       S   =       ∑   k     ⁢       j   k     ·     h   ⁡     (     t   -   kT     )       ·     b   k             
   k is the index of the current bit b k ,   j is the complex constant such that j 2 =−1,   T is the duration of a bit,   t represents time, and   h is the modulation function.       

   If h is a rectangular function, the modulation is referred to as “offset QPSK”. 
   According to the invention, h is a Gaussian function which takes the following form, for example: 
         h   ⁡     (   t   )       =       1     σ   ⁢           ⁢   T   ⁢       2   ⁢   π           ⁢     ⅇ     -       t   2       2   ⁢     σ   2     ⁢     T   2                   
 
   The parameter σ is a form factor which determines the spreading of a bit. 
   If B denotes the half-bandwidth of the spectrum at the 3 dB points, and using the abbreviation ln for natural logarithms, the following equation applies: 
         B   ·   T     =         ln   ⁢           ⁢   2         2   ⁢           ⁢   πσ           
 
   Adopting a Gaussian modulation function eliminates the side lobe present in constant envelope modulation spectra. 
   Note however that the modulated signal is still subject to amplitude variations, although they are significantly reduced compared to QAM. 
   Accordingly, and in accordance with another aspect of the invention, a correction term C is added to the modulated signal as defined above: e with: 
       S   =         ∑   k     ⁢       j   k     ·     h   ⁡     (     t   -   kT     )       ·     b   k         +   C         
         where: 
       C   =       ∑   k     ⁢       j   k     ·     h   ⁡     (     t   -   kT     )       ·     [       ∑     n   =   1     N     ⁢           ⁢       a   n     ⁢     B   k   n         ]             
   N is an integer representing a correction level, and   a is a constant with the value 
         e     -     1     σ   2           .       
       

   The polynomials B k  are constructed in the following manner. For a given value of n, all families of relative integers P l,i  are found such that there is a natural integer M satisfying the following equations: 
                 ∑     i   =   0     M     ⁢           ⁢     p     1   ,     2   ⁢   i           =       ∑     i   =   1     M     ⁢           ⁢     p     1   ,       2   ⁢   i     -   1                   (   1   )                     ∑     i   =   0     M     ⁢           ⁢     p     1   ,     2   ⁢   i       2       -       ∑     i   =   1     M     ⁢           ⁢     p     1   ,       2   ⁢   i     -   1       2         =     2   ⁢           ⁢   n             (   2   )             
  p   l,i   &lt;p   l i+1  (for all i)  (3) 
   The limit values of p l,i  must be found. They are p 1,0  and p 1,2M . 
   From equation (1) it follows that p 1,0  is negative or zero: 
         p     1   ,   0       =       ∑     i   =   1     M     ⁢           ⁢     (       p     1   ,       2   ⁢   i     -   1         -     p     1   ,     2   ⁢   i           )           
 
   From equation (3), the above expression is negative or zero. 
   Similarly, the term P 1,2M  is positive or zero. 
   Equation (1) can be written: 
         p     1   ,     2   ⁢   M         =       ∑     i   =   1     M     ⁢           ⁢     (       p     1   ,       2   ⁢   i     -   1         -     p     1   ,       2   ⁢   i     -   2           )           
 
   From equation (3), this expression is positive or zero. 
   Because the relative integers p l,i  constitute a strictly increasing series, there is only one natural integer z for which the product p l,x ·p l,z−1  is negative or zero. 
   If z is even, equation (2) can be written: 
             ∑     i   =       z   2     +   1       M     ⁢           ⁢     (       p     1   ,     2   ⁢   i       2     -     p     1   ,       2   ⁢   i     -   1       2       )       +     p     1   ,   z     2     +       ∑     i   =   0         z   2     -   1       ⁢           ⁢     (       p     1   ,     2   ⁢   i       2     -     p     1   ,       2   ⁢   i     +   1       2       )         =     2   ⁢   n         
 
   If z is odd, equation (2) can be written: 
             ∑     i   =       z   +   1     2       M     ⁢           ⁢     (       p     1   ,     2   ⁢   i       2     -     p     1   ,       2   ⁢   i     -   1       2       )       +     p     1   ,     z   -   1       2     +       ∑     i   =   0         z   -   3     2       ⁢           ⁢     (       p     1   ,     2   ⁢   i       2     -     p     1   ,       2   ⁢   i     +   1       2       )         =     2   ⁢   n         
 
   In the above two expressions, the left-hand member of the equation takes the form of a sum of positive terms, which implies that each of those terms is at most equal to 2n. 
   Accordingly:
         if z=2M:
 
p 1,2M &lt;√{square root over (2 n )}
   if z&lt;2M:
 
p 1,2M   2   −p   1,2M−1   2 ≦2 n  
 
( p   1,2M   −p   1,2M−1 )( p   1,2M   −p   1,2M−1 )≦2 n  
   letting (p 1,2M   −p   1,2M−1 )= a , with 1≦a≦2 n 
             2   ⁢     p     1   ,     2   ⁢   M           -   a     ≤       2   ⁢   n     a       ,       p     1   ,     2   ⁢   M         ≤       n   a     +     a   2             
       

   It can easily be shown that (n/a+a/2)≦(n+1/2) when a is between 1 and 2n. 
   It follows that p 1,2M  is less than or equal to n. It can be shown in the same way that p 1,0  is greater than or equal to −n. 
   It follows from the above that the set of relative integer families p l,i  is a finite set. 
   For a given value of n, now consider the first family p l,i , which is obtained for l=1. That family is constructed starting from p 1,0 =−n, after which the series of relative integers p 1,1 , . . . , p 1,2M  which satisfies equations (1), (2) and (3) is found empirically. 
   For example, if n=1, there is only one family F 1 ={p 1,0 , p 1,1 , p 1,2 }={−1, 0, +1}. 
   If n is greater than 1, all the families are found in the same manner by successively incrementing all p l,i . In this case, l varies from 1 to L. 
   For the first values of n, those families are: 
                 -   n     =   2     ,       F   1     =       ⁢       {       p     l   ,   0       ,     p     l   ,   1       ,     p     l   ,   2         }     =     {       -   2     ,     -   1     ,     +   1       }                       F   2     =       ⁢       {       p     2   ,   0       ,     p     2   ,   1       ,     p     2   ,   2         }     =     {       -   1     ,     +   1     ,     +   2       }                 
                 -   n     =   3     ,       F   1     =       ⁢       {       p     l   ,   0       ,     p     l   ,   1       ,     p     l   ,   2         }     =     {       -   3     ,     -   2     ,     +   1       }                       F   2     =       ⁢       {       p     2   ,   0       ,     p     2   ,   1       ,     p     2   ,   2       ,     p     2   ,   3       ,     p     2   ,   4         }     =     {       -   2     ,     -   1     ,   0   ,     +   1     ,     +   2       }                     F   3     =       ⁢       {       p     3   ,   0       ,     p     3   ,   1       ,     p     3   ,   2         }     =     {       -   1     ,     +   2     ,     +   3       }                 
                 -   n     =   4     ,       F   1     =       ⁢       {       p     l   ,   0       ,     p     l   ,   1       ,     p     l   ,   2         }     =     {       -   4     ,     -   3     ,     +   1       }                       F   2     =       ⁢       {       p     2   ,   0       ,     p     2   ,   1       ,     p     2   ,   2       ,     p     2   ,   3       ,     p     2   ,   4         }     =     {       -   3     ,     -   2     ,   0   ,     +   1     ,     +   2       }                     F   3     =       ⁢       {       p     3   ,   0       ,     p     3   ,   1       ,     p     3   ,   2         }     =     {       -   2     ,     +   0     ,     +   2       }                     F   4     =       ⁢       {       p     4   ,   0       ,     p     4   ,   1       ,     p     4   ,   2       ,     p     4   ,   3       ,     p     4   ,   4         }     =     {       -   2     ,     -   1     ,   0   ,     +   2     ,     +   3       }                     F   5     =       ⁢       {       p     5   ,   0       ,     p     5   ,   1       ,     p     5   ,   2         }     =     {       -   1     ,     +   3     ,     +   4       }                 
 
   Finally, the polynomial B k   n  is obtained from the following expression: 
         B   k   n     =       ∑     1   =   i     L     ⁢           ⁢     (       ∏     i   =   0       2   ⁢           ⁢   M       ⁢           ⁢     b     k   +     p     1   ,   i             )           
 
   Returning to the previous examples:
 
 B   k   1   =b   k−1   .b   k   .b   k+1  
 
 B   k   2   =b   k−2   .b   k−1   .b   k+1   +b   k−1   .b   k+1   .b   k+2 3  
 
 B   k   3   =b   k−3   .b   k−2   .b   k+1   +b   k−2   .b   k−1   .b   k   .b   k+1   .b   k+2   +b   k−1   .b   k+2   .b   k+3  
 
 B   k   4   =b   k−4   .b   k−3   .b   k+1   +b   k−3   .b   k−2   .b   k   .b   k+1   .b   k+2   +b   k−2   .b   k   .b   k+   2   +b   k−2   .b   k−1   .b   k   .b   k+2   .b   k+3   +b   k−1   .b   k+3   .b   k+4  
 
   Returning to the equation of the modulated signal S: 
       S   =         ∑   k     ⁢       j   k     ·     h   ⁡     (     t   -   kT     )       ·     b   k         +       ∑   k     ⁢       j   k     ·     h   ⁡     (     t   -   kT     )       ·     [       ∑     n   =   1     N     ⁢           ⁢       a   n     ⁢     B   k   n         ]               
 
   Letting B k   0 =b k , the signal S can be written: 
       S   =       ∑   k     ⁢       j   k     ·     h   ⁡     (     t   -   kT     )       ·     [       ∑     n   =   0     N     ⁢           ⁢       a   n     ⁢     B   k   n         ]             
 
   It is therefore possible to define an input signal 
         F   ⁡     (   k   )       =       ∑     n   =   0     N     ⁢           ⁢       a   n     ⁢     B   k   n             
 
   If N=0, this is the simplest embodiment of the invention. The greater the value of N, the more limited are the amplitude variations of the modulated signal S. 
   Note that the spectrum of this signal is independent of N. Its value is:
 
[ H   σ ( f )] 2   =e   −(2πσfT)   2  
 
   The invention naturally relates to a modulator for producing the signal S modulated onto a carrier. Although the implementation of a modulator so specified will be obvious to the skilled person, one of many examples will now be described. 
   Referring to  FIG. 1 , the modulator compromises a digital processor  1  which receives the bits b k  to produce the real part I and the imaginary part Q of the modulated signal S:
 
 S=I+jQ.  
 
   It also comprises a first mixer  4  for multiplying the real part I by the carrier C and a second mixer  5  for multiplying the imaginary part Q by the carrier phase-shifted by π/2. To this end, a phase-shifter  3  receives the carrier and feeds it to the second mixer  5 . 
   It also comprises an adder  6  for summing the output signals of the two mixers  4 , 5 . 
   Finally, the modulator includes a time base  2  which supplies the clock signal Ck to the digital processor  1  and the carrier to the first mixer  4  and to the phase-shifter  3 . 
   It works for the most varied values of the various constants and in particular with a correction level N equal to 0. However, to obtain good performance, and to facilitate the task of the processor  1 , the following values are given by way of example:
         form factor: 
         σ   =     1       3   ⁢   ln   ⁢           ⁢   2           ;       
    because of this, the constant 
       a   =     ⅇ     -     1     σ   2               
    has the value ⅛, which enables multiplication by a means of a shift of three bits to the right,   correction level N=2,   value of bits b k : +1 or −1,   modulated signal S expressed on 12 bits,   oversampling factor: 4.       

   The modulated signal S is therefore a series of digital samples produced at the rate of four per bit period T. 
   The modulation function h(t) is also represented by a series of positive numbers h q  on 11 bits. An appropriate scale factor is chosen so that the modulated signal S can be coded on 12 bits:
         (h q ) 0≦q≦11 ={0,1,5,17,47,116,253,485,816,1205,1563,1780}       

   The function h(t) is even so that for any c from 0 to 11 h 23−q =h q . Given the scale factor adopted, h q  is zero for q&lt;0 or q&gt;23: the function is memorized for −3T&lt;t&lt;3T. 
   Because of the oversampling, it is possible to set q=4.k+i, for i varying from 0 to 3; in other words, k is the integer part of q/4. 
   Referring to  FIG. 2 , and by the way of example, the processor  1  comprises a first module for calculating the expressions B k   1  and B k   2 . Here the corresponding calculations are performed by means of shift register which contains the bits b k+2  to b k−2  at a reference time. B k   1  is obtained by a first multiplier  7  which forms the product of the bits b k−1 , b k  and b k+1 . To obtain B k   2 , a second multiplier  8  forms the product of the bits b k−2 , b k−1  and b k+1 , a third multiplier  9  forms the product of the bits b k−1 , b k+1 , and b k+2 , and an adder  10  sums the outputs of the second and third multipliers  8  and  9 . 
   The processor  1  also includes a second module, shown in  FIG. 3 , which calculates the digital samples of the modulated signal S by filtering the oversampled input signals using a filter with impulse response h(t). The four samples E 4k+1  associated with the bit b k  for i varying from 0 to 3 therefore have the values: 
         E       4   ⁢   k     +   i       =       ∑     q   =   k       k   -   5       ⁢           ⁢       j   q     ·     (       b   q     +       1   8     ·     B   q   1       +       1   64     ·     B   q   2         )     ·     h       4   ⁢     (     k   -   q     )       +   i               
 
   The above expression can be written:
 
 E   4k+i   =E   ki   0   +E   ki   1   +E   ki   2  
         where: 
               E   ki   0     =         ∑     q   =   k       k   -   5       ⁢           ⁢       j   q     ·     b   q     ·     h       4   ⁢     (     k   -   q     )       +   i           =       x   0     +     j   ⁢           ⁢     y   0                   (   4   )                 E   ki   1     =         ∑     q   =   k       k   -   5       ⁢           ⁢       j   q     ·     1   8     ·     B   q   1     ·     h       4   ⁢     (     k   -   q     )       +   i           =       x   1     +     j   ⁢           ⁢     y   1                   (   5   )                 E   ki   2     =         ∑     q   =   k       k   -   5       ⁢           ⁢       j   q     ·     1   64     ·     B   q   2     ·     h       4   ⁢     (     k   -   q     )       +   i           =       x   2     +     j   ⁢           ⁢     y   2                   (   6   )             
       

   The numbers x 0 , y 0 , y 1 , x 2  and y 2  are real numbers. 
   For example, the second module includes a first sampling circuit E o  which receives the bit b k  and supplies it to a first router A 0  synchronized with the sampling circuit in response to a sampling frequency Fs generated by circuit  11 . The first router produces as its output signal I 0 , successively, the first sample of the bit b k  and then the third sample of the same bit b k  with the sign changed. It also produces as its output signal Q 0 , successively, the second sample of the bit b k  and then the fourth sample of the same bit b k  with the sign changed. The second module then correlates the output signal I 0  with the modulation function h according to equation (4) to produce the first real component x 0  (this is symbolized by the operator * in the figure). Note that only the terms corresponding to an even index q are non-zero. 
   The discrete correlation operation need not be described in more detail because this technique is well-known to the skilled person. 
   The second module also correlates the output signal Q 0  with the modulation function h according to equation (4) to produce the first imaginary component y 0 . Note that only the terms corresponding to an odd index q are non-zero. 
   Similarly, the second module comprises a second sampling circuit E 1  which receives the signal B k   1  and feeds it to a second router A 1  synchronized with that sampling circuit. The second router produces as its output signal I 1 , successively, the first sample of the term B k   1  and then the third sample of that same term with the sign changed. It also produces as its output signal Q 1 , successively, the second sample of the term B k   1  and then the fourth sample of that same term with the sign changed. The second module then correlates the output signal I 1  with the modulation function h multiplied by the constant a (⅛ in this instance) according to equation (5) to produce the second real component x 1 . 
   The second module also correlates the output Q 1  with the modulation function h multiplied by ⅛ according to equation (5) to produce the second imaginary component y 1 . 
   The second module produces the third real component x 2  and the third imaginary component y 2  from the expression B k   2  according to equation (6) in an analogous manner. 
   The real part I of the modulated signal is the result of summing the three real components x 0 , x 1 , x 2  and its imaginary part Q is the result of summing the three imaginary components y 0 , y 1  and y 2 . 
   The invention naturally also relates to a demodulator for recovering the data signal from the modulated signal S. Although the implementation of a demodulator as specified will be evident to the skilled person, one of many examples of its implementation will now be described. 
   Referring to  FIG. 4 , the demodulator includes a baseband transposition unit  12  which receives a signal r(t) modulated as described above. The transposition unit is routinely implemented by means of a Hilbert filter. 
   The demodulator also includes a complex multiplier  13  for multiplying the output signal of the transposition unit  12  by the expression 
       e       -   j     ⁢     πτ     2   ⁢   T             
 
to produce a signal whose frequency is equal to one-quarter of the bit time.
 
   It also includes a convolution operator  14  which convolutes the output signal of the complex multiplier  13  and the modulation function h(t) defined above. 
   The result of this convolution is interpreted by a decision unit  15  which reproduces the bit b k  according to the sign of the real part of the result. 
   The invention therefore relates to a digital modulation technique which applies regardless of how the modulation function is represented, including by means of a compression law. It is not limited to the embodiments described above. In particular, it is possible to replace any means by equivalent means.