Abstract:
The invention proposes a data transmission process, from a first unit ( 1 ) situated at a predetermined depth of an oil well to a second unit ( 2 ) situated at the surface of this well, the process comprising a digital-analog conversion stage ( 8 ) of the data to obtain an analog signal forming support of the data, and an amplification stage ( 9 ) of this signal prior to its emission in a cable ( 11 ) connecting the two units,
       characterised in that at least two distinct scramblings ( 20, 21 ) of the data are completed, such that there is a first and a second set of scrambled data. After passage in a single complex inverse Fourier transform, that intended for emission is selected ( 26 ), whereof the dynamic in amplitude is the lowest. If the probability of saturating with a single set is  10   −q , then due to this process the probability will be 10 −2q .

Description:
INTRODUCTION 
       [0001]    The present invention relates to data transmission systems and processes. 
         [0002]    In particular, the invention has advantageous application in the case of data transmission in oil wells between a first unit situated at a predetermined depth and a second unit situated at the surface of the well. 
         [0003]    The system according to the invention has communication means for sending/receiving signals. 
         [0004]    The invention is particularly well adapted to use in a difficult environment. 
         [0005]    In the case of application to oil wells, the second unit situated in the well is in a particularly aggressive environment (high temperature, corrosive gas, confinement, limited template, etc.). 
         [0006]    This applicative environment sharply reduces the means to be employed in this same unit (available calculating power, feed, dissipation, etc.). 
         [0007]    The first unit and the second unit are for example connected by a cable called a &lt;&lt;tanker&gt;&gt;, very solid, typically a hepta-cable of a length capable of stretching from several kilometres to tens of kilometres. 
         [0008]    This cable offers numerous functions: mechanical support, power feed, communications support. 
         [0009]    It should be noted that this type of cable is not designed, initially and in light of its length, for high-rate data transport. 
         [0010]    In fact, the passband of this cable is relatively limited since it is principally the mechanical qualities and the multi-conductive aspect which are preferred to the detriment of communication qualities. 
         [0011]    Another type of cable exists, the most recent coaxial cable having much better characteristics for high-rate communications. 
         [0012]    This type of cable is currently in minimal use in data transmission applications in oil wells. 
       Identification of Needs 
       [0013]    The current tendency observed is clearly an increase in rate needs. 
         [0014]    Augmentation of the resolution of measurements, growth in the number of measuring points made in the well and thus of the quantity of data to be collected by the telemetry unit (second unit for sending measuring data) are the principal levers. 
         [0015]    The need for greater flexibility as well as greater reliability from all types of cable should also be noted. 
         [0016]    The capacity to better manage external perturbations such as parasitic frequencies which might pollute the frequential spectrum should also be focussed on. 
       Identification of the Advantages and Disadvantages of Mono-Carrier and Multi-Carrier Techniques 
       [0017]    In light of such needs, transmission techniques of multi-carrier type turn out to be very advantageous, to the detriment of more classic mono-carrier techniques simpler to implement. 
         [0018]    One of the multi-carrier techniques is OFDM (acronym for the English expression &lt;&lt;Orthogonal Frequency Division Multiplexing&gt;&gt;). 
         [0019]    The advantages of this type of modulation are many. 
         [0020]    Due to its plurality of carriers, OFDM permits better spectral occupation of the distribution channel (for example a cable) and this as a function of its attenuation for each carrier. 
         [0021]    OFDM also absorbs the parasitic frequencies often present on the well and capable of polluting the spectrum. 
         [0022]    However, the fact that the amplitude of the OFDM signal is not limited represents a serious impediment to its physical implementation with the electronic components. 
         [0023]    Since feeds and amplifiers are considerably limited especially due to the difficult environment described previously, the OFDM signal will thus sometimes be excreted and deteriorated since is exceeds emission capacity and this according to occurrence depending on the maximum factor admissible by equipment (it should be noted that clipping causes a fairly large quantity of errors according to its amplitude). 
         [0024]    The factor of maximum crest admissible by the equipment is the ratio between the maximum power available and the average power output. 
         [0025]    This power ratio needs to be minimised to optimise the rate while retaining a preferred reception error rate. 
         [0026]    In fact, the lower the maximum crest factor admissible by the equipment the greater the probability of peaking increases. 
         [0027]    The adjustment of this parameter is thus a compromise between rate and preferred error rate. 
         [0028]    For this purpose, the applicant proposes simple means for diminishing the saturation probability of the OFDM signal with the aim of optimising emission power. 
         [0029]    In fact, since the invention diminishes the probability of saturating, the crest factor admissible by the equipment can be diminished, thus augmenting the rate while conserving the preferred error rate. 
         [0030]    Further this process is simple to implement to enable implementation in well tools subjected to high temperatures and dimensional constraints (limitation of calculation power, for example). 
         [0031]    In fact, within the scope of applications to oil wells, the electronics placed at the bottom of the well must be able to maintain local environmental conditions and in particular temperatures reaching some 180 degrees Celsius, not generally the case for electronics utilised in multi-carrier transmission systems. 
         [0032]    In fact, on one hand the electronics in place in the case of multi-carrier system are much more complex than those utilised in the case of low-rate transmission, for example. And also, in such temperature conditions the amplifiers and the converters have very limited performance. 
       BASIS OF THE INVENTION 
       [0033]    To eliminate the above problems, the present invention proposes more precisely a data transmission process, from a first unit to a second unit, the process comprising a digital-analog conversion stage of data so as to obtain an analog signal forming support for the data, and an amplification stage of this signal prior to emission in a cable connecting the two units, characterised in that: 
         [0034]    Stage 1—at least two distinct data scramblings are performed, such that there is a first and a second set of scrambled data. 
         [0035]    Stage 2—the inverse Fourier transforms of the first and second sets of scrambled data are determined from real and imaginary parts of a single complex inverse Fourier transform. This slightly particular utilisation of the Fourier transform in our application allows for not doubling the necessary power despite the presence of these two data sets. 
         [0036]    Stage 3—the maximum dynamic for each of the two sets of scrambled data leaving the inverse Fourier transform is determined, and any one of these sets is selected if said dynamics are compatible with the maximum dynamics authorised or if any of the two sets is compatible, the set which will engender the lowest saturation so as to minimise the induced errors. 
         [0037]    Stage 4—the process further comprises a stage where a supplementary datum intended to indicate to the second unit the result of the selection made at stage 3 is sent; the datum corresponds to one bit, of which the values ‘0’ and ‘1’ respectively identify one and the other of these two scramblings; the supplementary datum is sent according to modulation of type BPSK. 
     
    
     
       PRESENTATION OF FIGURES 
         [0038]    Other characteristics and advantages of the invention will emerge from the following description which is purely illustrative and non-limiting and must be viewed in terms of the attached diagrams, in which: 
           [0039]      FIG. 1  illustrates a multi-carrier transmission system such as known in the prior art, 
           [0040]      FIG. 2  illustrates modules using the stages of the embodiment of the process according to the invention. 
       
    
    
     DESCRIPTION OF THE INVENTION 
       [0041]    To facilitate comprehension of the following description both a complex inverse Fourier transform and an IFFTc will be designated in this text in an undifferentiated manner. 
       Classic Multi-Carrier Transmission (FIG. 1) 
       [0042]    The simple object of the description made hereinbelow is to briefly specify aspects well known to the specialist, but which will allow better comprehension of the invention. 
         [0043]    The multi-carrier transmission system of  FIG. 1  comprises two units  1  and  2 . 
         [0044]    For example, the first unit  1  can be arranged at the surface of a oil well and the second unit  2  at a certain depth of an oil well. 
         [0045]    It is understood that the two units  1  and  2  can be at different altitudes. 
         [0046]    In addition, according to the conditions of use the first unit is situated at the surface of the oil well and is at ambient temperature, while the second unit is situated at a certain depth of the well and can thus be subjected to high temperatures, for example of the order of 180° C. 
         [0047]    These two units are suitable for communicating and in particular transmitting data by means of a communication channel  11 , for example in a standard cable. 
         [0048]    By way of non-limiting example it is supposed that the unit  1  sends while the unit  2  receives. 
         [0049]    In this case, forming a signal representative of the data makes use of different modules known per se and represented in particular in  FIG. 1 . 
         [0050]    In this figure, a block of initial binary data  3  is supplied to a series-parallel converter  4 . 
         [0051]    As it leaves this converter the parallelised data undergoes &lt;&lt;mapping&gt;&gt; in an adapted device  5 . 
         [0052]    The &lt;&lt;mapping&gt;&gt; consists simply of transforming a binary word of p bits into a complex symbol belonging to an alphabet of 2 p  possible complex numbers. 
         [0053]    The data then enter a module  6  to perform inverse Fourier transform (IFFT) on N points. 
         [0054]    The data are then &lt;&lt;serialised&gt;&gt; by means of a parallel-series converter  7 . 
         [0055]    The serialised data are then supplied to a digital-analog converter  8 . 
         [0056]    The analog signal leaving this converter  8  is then amplified by means of an amplifier  9 , prior to being sent to the channel  11  in the form of a signal  10 . 
         [0057]    At the other end of the cable, or equivalent to the other end of the channel  11 , the second unit receives the signal  12  on entry. 
         [0058]    The signal typically undergoes first forming  13  prior to being converted into data in an analog-digital converter  14 . 
         [0059]    On leaving the module  15  the data then transits to a synchronisation module  17 . 
         [0060]    Fourier transform is then applied to these data in a module  16 , after which a classic stage is used for converting symbols into bits  18 . This is the inverse operation of the &lt;&lt;mapping&gt;&gt; done at emission. 
         [0061]    The result is a block of binary data transmitted to a parallel-series converter  19 . 
         [0062]    These binary data then form received message. 
         [0063]    It should be noted that without transmission errors this block is rigorously identical to the block of data sent. 
       Multi-Carrier Transmission Including the Invention (FIG. 2) 
       [0064]    Now that a classic transmission system of multi-carrier type has been presented, a preferred embodiment of the process according to the invention will now be described in detail. 
         [0065]    One problem associated with this type of transmission is that the signal  12  in reception has an extremely fluctuating envelope. 
         [0066]    From the statistical viewpoint it is known that signals  12  of this type can be seen as a sum of random independent signals (the bits modulating the different carriers are random and independent). 
         [0067]    Accordingly, by application of the central limited theorem, this type of signal sent tends towards a random signal of density of gaussian probability, of zero average and σ 2  variance. 
         [0068]    This gaussian is truncated, and it is a sum finished with random independent limited signals which is sent. 
         [0069]    Because of this it can be deduced that, in the worst case, all the power distributed over the inputs of the module  6  concentrates at a single one of its outputs. Therefore, in practice very strong digital values (in absolute value) are obtained fairly frequently. 
         [0070]    As these values are supplied to the digital-analog converter  8 , they can be represented only over a limited number of bits. 
         [0071]    It is thus necessary here to effect a compromise between the maximum value representable, noted U max  by the converter  8 , which would preferably have to be the greatest possible, and the quantification pitch δ which would preferably have to be very small. 
         [0072]    In general, for a digital-analog converter, it is known that these two quantities can be connected by an equation of the type 
         [0000]    
       
         
           
             
               δ 
               = 
               
                 
                   2 
                    
                   
                     U 
                     max 
                   
                 
                 M 
               
             
             , 
           
         
       
     
         [0000]    where M represents the number of bits of this converter. 
         [0073]    It will be ensured in the conception to fix U max =ασ, α being a real number which according to the invention is preferably greater than three. 
         [0074]    Therefore, all values between −ασ and ασ ought not to be saturated. 
         [0075]    It will also be ensured that these values are compatible with the performances of the amplifier  9 . 
         [0076]    It is in fact necessary that the entire converter  8  and amplifier  9  are not saturated. 
         [0077]    According to the invention, this probability, which is in principle equal to 10 −q , can be reduced to a value close to 10 −2q . 
         [0078]    For this purpose, it is proposed in general to select scrambling which, applied to the data of the block, will saturate the least possible the entire digital-analog converter  8  and amplifier  9 . 
         [0079]    The preferred mode of the process according to the invention is illustrated schematically in  FIG. 2 . 
         [0080]    The data block  3  coming from the converter  4  is supplied, by duplication, to two distinct scramblers  20  and  21 . 
         [0081]    It is understood here that these two scramblers provide two sets of statistically independent scrambled data. 
         [0082]    Scrambling is done by a logical &lt;&lt;or exclusive&gt;&gt; function known to the specialist. 
         [0083]    The &lt;&lt;or exclusive&gt;&gt; scrambling is done between the block of original binary data and the output of a shift register, the purpose of which is to produce a pseudo-random signal. A shift register is, for example, based on a primitive polynome in the Galois body GF2. 
         [0084]    In the case where the two scramblers correspond to the same shift register they can be differentiated by means of different initialisations. 
         [0085]    These two sets are then supplied to two &lt;&lt;mapping&gt;&gt; modules  22  and  23  respectively. 
         [0086]    After the &lt;&lt;mapping&gt;&gt;  22  the two sets of data pass through the combination module  24 , producing the combination of the two sets prior to complete their inverse Fourier transform. 
         [0087]    The two data blocks then transit to a module  25  in which complex inverse Fourier transform (IFFTc) is completed. 
         [0088]    More precisely, the real part of this complex transform is used to determine the transform of one of the sets and the imaginary part for the other of the sets. 
         [0089]    Even more precisely, the following elementary properties are used. 
         [0090]    Let x(n) be a real signal. 
         [0091]    It is known that its Fourier transform on N values is equal to: 
         [0000]    
       
         
           
             
               X 
                
               
                 ( 
                 k 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   n 
                   = 
                   0 
                 
                 
                   N 
                   - 
                   1 
                 
               
                
               
                 
                   x 
                    
                   
                     ( 
                     n 
                     ) 
                   
                 
                  
                 
                   
                      
                     
                       - 
                       
                         
                           j2π 
                            
                           
                               
                           
                            
                           nk 
                         
                         N 
                       
                     
                   
                   . 
                 
               
             
           
         
       
     
         [0092]    This gives, X(0) which is real. 
         [0093]    Plus, X(k)=conj{X(N−k)} for 
         [0000]    
       
         
           
             k 
             ∈ 
             
               
                 [ 
                 
                   1 
                   , 
                   
                     
                       N 
                       2 
                     
                     - 
                     1 
                   
                 
                 ] 
               
               . 
             
           
         
       
     
         [0094]    Finally, 
         [0000]    
       
         
           
             X 
              
             
               ( 
               
                 N 
                 2 
               
               ) 
             
           
         
       
     
         [0000]    is real also. 
         [0095]    Now let y(n) be a purely imaginary signal; its Fourier transform calculated on N points is equal to: 
         [0000]    
       
         
           
             
               Y 
                
               
                 ( 
                 k 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   n 
                   = 
                   0 
                 
                 
                   N 
                   - 
                   1 
                 
               
                
               
                 
                   y 
                    
                   
                     ( 
                     n 
                     ) 
                   
                 
                  
                 
                   
                      
                     
                       
                         - 
                         
                           
                             j2π 
                              
                             
                                 
                             
                              
                             nk 
                           
                           N 
                         
                       
                        
                       
                           
                       
                     
                   
                   . 
                 
               
             
           
         
       
     
         [0096]    This time, this gives Y(0) which is purely imaginary and Y(k)=−conj{X(N−k)} for 
         [0000]    
       
         
           
             k 
             ∈ 
             
               
                 [ 
                 
                   1 
                   , 
                   
                     
                       N 
                       2 
                     
                     - 
                     1 
                   
                 
                 ] 
               
                
               
                   
               
                
               and 
                
               
                   
               
                
               
                 Y 
                  
                 
                   ( 
                   
                     N 
                     2 
                   
                   ) 
                 
               
             
           
         
       
     
         [0000]    which is purely imaginary. 
         [0097]    According to these properties, it is easily shown that the two real Fourier transforms can be created by means of a single complex Fourier transform. 
         [0098]    Consider for example that the aim is to calculate the Fourier transforms of two real signals x 1 (n) and x 2 (n). 
         [0099]    A complex signal can then be formed: 
         [0000]        z ( n )= x   1 ( n )+ jx   2 ( n ). 
         [0100]    The Fourier transform of this signal is thus: 
         [0000]    
       
         
           
             
               Z 
                
               
                 ( 
                 k 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   n 
                   = 
                   0 
                 
                 
                   N 
                   - 
                   1 
                 
               
                
               
                 
                   z 
                    
                   
                     ( 
                     n 
                     ) 
                   
                 
                  
                 
                   
                      
                     
                       - 
                       
                         
                           j2π 
                            
                           
                               
                           
                            
                           nk 
                         
                         N 
                       
                     
                   
                   . 
                 
               
             
           
         
       
     
         [0101]    To regain the Fourier transform X 1 (k) and X 2 (k) of the real signals x 1 (n) and x 2 (n) from Z(k), the procedure should be as follows; 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         X 
                         1 
                       
                        
                       
                         ( 
                         0 
                         ) 
                       
                     
                     = 
                       
                      
                     
                       Real 
                        
                       
                           
                       
                        
                       
                         { 
                         
                           Z 
                            
                           
                             ( 
                             0 
                             ) 
                           
                         
                         } 
                       
                     
                   
                   , 
                 
               
             
             
               
                 
                   
                     
                       
                         X 
                         1 
                       
                        
                       
                         ( 
                         k 
                         ) 
                       
                     
                     = 
                       
                      
                     
                       
                         
                           1 
                           2 
                         
                          
                         
                           ( 
                           
                             
                               Z 
                                
                               
                                 ( 
                                 k 
                                 ) 
                               
                             
                             + 
                             
                               conj 
                                
                               
                                 ( 
                                 
                                   Z 
                                    
                                   
                                     ( 
                                     
                                       N 
                                       - 
                                       k 
                                     
                                     ) 
                                   
                                 
                                 ) 
                               
                             
                           
                           ) 
                         
                          
                         
                             
                         
                          
                         for 
                          
                         
                             
                         
                          
                         k 
                       
                       ∈ 
                       
                         [ 
                         
                           1 
                           , 
                           
                             
                               N 
                               2 
                             
                             - 
                             1 
                           
                         
                         ] 
                       
                     
                   
                   , 
                   and 
                 
               
             
             
               
                 
                   
                     
                       
                         X 
                         1 
                       
                        
                       
                         ( 
                         
                           N 
                           2 
                         
                         ) 
                       
                     
                     = 
                       
                      
                     
                       Real 
                        
                       
                           
                       
                        
                       
                         { 
                         
                           Z 
                            
                           
                             ( 
                             
                               N 
                               2 
                             
                             ) 
                           
                         
                         } 
                       
                     
                   
                   , 
                 
               
             
             
               
                 
                   
                     
                       
                         Y 
                         1 
                       
                        
                       
                         ( 
                         0 
                         ) 
                       
                     
                     = 
                       
                      
                     
                       Imag 
                        
                       
                         { 
                         
                           Y 
                            
                           
                             ( 
                             0 
                             ) 
                           
                         
                         } 
                       
                     
                   
                   , 
                 
               
             
             
               
                 
                   
                     
                       
                         Y 
                         1 
                       
                        
                       
                         ( 
                         k 
                         ) 
                       
                     
                     = 
                       
                      
                     
                       
                         
                           - 
                           
                             j 
                             2 
                           
                         
                          
                         
                           ( 
                           
                             
                               Z 
                                
                               
                                 ( 
                                 k 
                                 ) 
                               
                             
                             - 
                             
                               conj 
                                
                               
                                 ( 
                                 
                                   Z 
                                    
                                   
                                     ( 
                                     
                                       N 
                                       - 
                                       k 
                                     
                                     ) 
                                   
                                 
                                 ) 
                               
                             
                           
                           ) 
                         
                          
                         
                             
                         
                          
                         for 
                          
                         
                             
                         
                          
                         k 
                       
                       ∈ 
                       
                         [ 
                         
                           1 
                           , 
                           
                             
                               N 
                               2 
                             
                             - 
                             1 
                           
                         
                         ] 
                       
                     
                   
                   , 
                 
               
             
             
               
                 
                   
                     
                       Y 
                       1 
                     
                      
                     
                       ( 
                       
                         N 
                         2 
                       
                       ) 
                     
                   
                   = 
                     
                    
                   
                     Imag 
                      
                     
                       
                         { 
                         
                           Z 
                            
                           
                               
                           
                            
                           
                             { 
                             
                               N 
                               2 
                             
                             ) 
                           
                         
                         } 
                       
                       . 
                     
                   
                 
               
             
           
         
       
     
         [0102]    Therefore, according to the invention, using complex properties of direct or inverse Fourier transform advantageously determines the direct or inverse Fourier transforms of the two sets of scrambled data without employing two modules of the type of module  6 . The effect of this is to limit the complexity of the process according to the invention. 
         [0103]    The two sets of data leaving the module  25  are then supplied to a selection module  26 . 
         [0104]    In the latter, stages are employed whereof the aim is to select which of the two sets are intended for emission via the cable  11 , considering the maximum dynamics permitted known for the entire digital-analog converter  8  and amplifier  9 . 
         [0105]    According to the preferred mode, if the dynamic in amplitude of the two sets of data is compatible with the maximum dynamics permitted (it is provided that in the two cases there should have been no saturation of the entire digital-analog converter and amplifier), any one of these sets for emission is selected. 
         [0106]    It must be understood here by &lt;&lt;compatible&gt;&gt; that the dynamic of a set must be included in the maximum permitted dynamics. 
         [0107]    In the case now where it is determined that one of the dynamics is compatible with the maximum permitted dynamics but the other is not, the set of data with the compatible dynamic is selected for emission. 
         [0108]    Finally, in the event where the two sets present an incompatible dynamic, that having the lower dynamic is selected for emission. 
         [0109]    Therefore, the selection module  26  advantageously decreases the probability that saturation of the entire digital-analog converter and amplifier does not occur. 
         [0110]    In fact, it can be hoped statistically that if P s  is the probability of observing saturation on a block of 256 scrambled values, then the probability of observing saturation on a second scrambled block will be equal to P s   2 , where the scramblers are different in terms of the invention. 
         [0111]    It is also evident that this reasoning applies equally well if the data block is duplicated, and if scrambling is carried out only on one of these duplicates. 
         [0112]    In fact, if P s  is the probability of observing saturation on the non-scrambled copy then the probability of again observing saturation on the scrambled copy will be equal to P s   2 , since, once again, scrambling renders these copies statistically independent. 
         [0113]    It is accordingly understood that as a variant of this preferred embodiment the scrambler  21  could be omitted, for example. 
         [0114]    In all cases, according to the preferred mode of the invention, when the set of scrambled data has been selected one bit is added after these data. 
         [0115]    This bit will indicate to the receiving unit  2  which scrambler was used for emission. 
         [0116]    For example, the bit ‘0’ could correspond to the scrambler  20  and the bit ‘1’ to the scrambler  21 . 
         [0117]    As will be understood, the receiving unit is thus aware in advance of such coding. 
         [0118]    Therefore the receiving unit is suitable for regaining the sent data  3  from the scrambled data received. 
         [0119]    Also, so a to ensure good reception of this bit, that is, that it can be decoded by the unit  2  with an extremely low error rate and if the corresponding probability of error can be considered as negligible, it can be sent on a carrier different to that utilised for the rest of the data. Modulation in two phase states will preferably be used (in English, &lt;&lt;Binary Phase Shift Keying&gt;&gt;, (BPSK)) with a strong power level. 
         [0120]    Finally, the selected set of scrambled data is converted into an analog signal, which is amplified and sent to the cable  11 . 
         [0121]    Of course, the present invention is not at all limited to the embodiment described hereinabove and illustrated in the diagrams. 
         [0122]    It is evident in particular that only the scrambler  20  or  21  was able to be utilised. All the same, according to the applicant using two scramblers statistically balances the sets of data supplied to the module  25  of inverse Fourier transform complex. 
         [0123]    In another variant, more than two scramblers could be used. For example, if four scramblers are used, two calculation modules  25  of inverse Fourier transform complex will be used. 
         [0124]    It is understood in this respect that the supplementary datum added to the selected set of data for indicating which scrambler was used for emission can be coded on a number of bits. 
         [0125]    Therefore, despite the technical difficulties associated with using transmission of the multi-carrier type in the environmental conditions known to be critical, especially in oil wells, the applicant has determined simple means for increasing the rate while reducing the probability of saturation with a given crest factor.