Abstract:
Data rates of simultaneous radio transmissions of data are matched for services over a connection between a base station and a subscriber station by determining a service-specific rate matching factor for one of the services based on a steady-state rate matching factor and a dynamic rate matching factor. The dynamic connection-oriented rate matching factor is based on the steady-state matching factor. The dynamic-connection oriented rate matching factor matches a sum of a volume of data for the services over the connection to a volume of data available in a next frame of data. In addition, the data is compressed or expanded for the one of the services based on the corresponding service-specific rate matching factor.

Description:
CROSS REFERENCE TO RELATED APPLICATIONS 
     This application is a continuation of application Ser. No. 10/747,024, filed Dec. 23, 2003, now U.S. Pat. No. 7,403,781, which is a continuation of 09/806,628, filed Jun. 20, 2001, abandoned, which is a National Stage entry of PCT/DE99/03182 filed Oct. 1, 1999, which claimed priority to German Application No. 198 46 067.8, filed on Oct. 6, 1998, and German Application No. 199 22 968.6 filed on May 19, 1999, the contents of which are hereby incorporated by reference. 
    
    
     BACKGROUND 
     The invention relates to a method for matching data rates for transmitting data via a radio interface between a base station and a subscriber station, especially via broadband radio interfaces which use a CDMA subscriber separation method and simultaneously provide a number of services per call. 
     In radio communication systems, messages (for example voice, image information or other data) are transmitted via a radio interface with the aid of electromagnetic waves. The radio interface relates to a connection between a base station and subscriber stations where the subscriber stations can be mobile stations or stationary radio stations. The electromagnetic waves are radiated at carrier frequencies in the frequency band intended for the respective system. For future radio communication systems, for example the UMTS (Universal Mobile Telecommunication System) or other third-generation systems, frequencies are provided in the frequency band of approx. 2 000 MHz. 
     For the third generation of mobile radios, broadband (B=5 MHz) radio interfaces are provided which use a CDMA (Code Division Multiple Access) subscriber separation method for distinguishing between different transmission channels and can simultaneously provide a number of services per call. The problem is how the data of different services of a call are to be time-division multiplexed, i.e. inserted into a frame. The transmission capacity of the radio interface must be utilized in the best possible way, especially taking into consideration a highly dynamic variance in the data rates of the individual services. 
     From ETSI STC SMG2 UMTS-L1, Tdoc SMG2 UMTS-L1 221/98 of Aug. 25, 1998, especially pages 15-20, it is known to perform a two-stage data rate matching. First data rate matching is performed after channel coding and is intended to guarantee the service-specific qualities of service since the joint transmission of the data of a number of services makes a common signal/noise ratio mandatory. A second data rate matching after the multiplexing guarantees continuous transmission. The disadvantage of this solution can be seen in the fact that it is not possible to minimize the number of required transmission channels or at least, by spreading, the required transmitting power in the transmission channels. The code efficiency also drops since, in part, an expansion followed by a compression or conversely is performed on the same data. The code efficiency specifies the ratio between the change in the bit error rate (BER) and change in the redundancy of the data, the signal/noise ratio being considered as constant. 
     SUMMARY 
     It is the object of the invention to eliminate these disadvantages. This object is achieved by the method having the features of claim  1 . Advantageous further developments of the invention can be found in the subclaims. 
     According to the invention, a service-specific steady-state rate matching factor which sets a service-specific quality of service is determined as already known. However, the rate matching is not performed using this factor. Instead, a dynamic call-oriented rate matching factor is determined for the call which matches the hypothetical volume of data to a volume of data available in the next frame, taking into consideration the service-specific data rate matching yet to be performed. It is also possible in this case to pass through a number of optimization loops if this volume of data is not permanently predetermined due to there being an adequate number of transmission channels and spread factors. 
     It is thus possible to optimize the total transmission capacity needed. 
     In a next step, a service-specific rate matching factor is determined by combining the steady-state rate matching factor and the dynamic call-oriented rate matching factor and only then performing the single and thus single-stage data rate matching. Thus, the data of the services are compressed or expanded by means of these service-specific rate matching factors and are inserted into a frame for transmission. 
     The steady-state and dynamic rate matching is performed at the same time in one step in which it is only possible to perform the calculation of the factors but not the matching itself in an optimization loop so that the code efficiency increases and conflicting rate matching for the same data is prevented. 
     If certain frame intervals must be shortened in order to perform measurements (slotted mode), this can already be taken into consideration in the available volume of data. 
     According to an advantageous further development of the invention, the dynamic call-oriented rate matching factor is set to a minimum value related to the service to be compressed most severely and for this purpose, a number of transmission channels and of spread factors to be used during the transmission is determined in accordance with a predetermined coding rule. Once this has been done, the dynamic call-oriented rate matching factor is then determined as a quotient of the maximum volume of data available for the call and the sum of the volume of data of all services of the call, taking into consideration the respective service-specific steady-state rate matching factors. The minimum value is established so that the code efficiency is not impaired too much. This further development of the invention needs minimum resources. 
     If the dynamic call-oriented rate matching factor is greater than a maximum value related to the service to be expanded most severely, it is advantageous to accept additional data into the frame and to redetermine the dynamic call-oriented rate matching factor. Thus, transmission capacity is not unnecessarily given away. 
     Before the dynamic call-oriented rate matching factor is determined, the steady-state rate matching factors are advantageously referred to their geometric mean in such a manner that the product of all steady-state rate matching factors of a call is equal to one. Thus, only the lowest possible rate matching is necessary for optimizing the code efficiency when the data rates of the services are similar. 
     A mapping rule for multiplexing the data of the services into a frame to be transmitted is advantageously specified in such a manner that it is simultaneously known to the transmitting and receiving end so that only the volume of data per service is signaled and the arrangement of the data in the frame can be unambiguously duplicated. The rate matching can also be reconstructed from the signaled volume of data. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       Exemplary embodiments of the invention will be explained in greater detail with reference to the attached drawings, in which: 
         FIG. 1  shows a diagrammatic representation of a radio communication system, 
         FIG. 2  shows a diagrammatic representation of requirements for three services to be transmitted simultaneously, 
         FIG. 3  shows a block diagram of a rate matching method, and 
         FIG. 4  shows a representation of an optimization loop in the rate matching. 
     
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
     The mobile radio system shown in  FIG. 1  as an example of a radio communication system consists of a multiplicity of mobile switching centers MSC which are networked together and set up the access to a landline network PSTN. Furthermore, these mobile switching centers MSC are connected to in each case at least one facility RNM for allocating radio resources. Each of these facilities RNM, in turn, provides-for a connection to at least one base station BS. Such a base station BS can set up a call to subscriber stations, e.g. mobile stations MS or other mobile and stationary terminals via a radio interface. Each base station BS forms at least one radio cell. 
       FIG. 1  shows a connection V for the simultaneous transmission of user information of a number of services S 1 , S 2 , S 3  between a base station BS and a mobile station MS. An operation and maintenance center OMC implements control and maintenance functions for the mobile radio system or for parts thereof. The functionality of this structure can be transferred to other radio communication systems in which the invention can be used, especially for subscriber access networks with wireless subscriber access. 
     In the connection V, the data d 1 , d 2 , d 3  of three different services S 1 , S 2 , S 3  are simultaneously transmitted in accordance with  FIG. 2 . These three services S 1 , S 2 , S 3  greatly differ in the possible values and the dynamic range of the data rate. The block sizes B and absolute or relative coding were selected correspondingly. 
     With reference to  FIG. 3 , channel coding is carried out at the transmission end as the first step in data transmission for each service S 1 , S 2 , S 3 , and is selected for each service individually as a function of the required maximum bit error rate (BER). Then, as an option for each service S 1 , S 2 , S 3 , the data d 1 , d 2 , d 3  are scrambled over a number of frames fr (interframe scrambling), and the steady-state rate matching factors SRFi are then determined for each of the services i. A service-specific quality of service is set in the process. 
     Rate matching is carried out as the next step, with the algorithm that is described in the following text at the same time including the multiplexing of the services. The rate matching and the multiplexing are followed by scrambling of the data within a frame fr (intraframe scrambling). 
     The service-specific rate matching factors SFRi for each service i describe expansion or compression of the data, with expansion being achieved by addition of redundancy (for example repetition of individual bits), and compression being achieved, for example, by puncturing. The coding, and hence the addition of redundancy, can also be set adaptively depending on the specific rate matching factors. These service-specific rate matching factors SFRi do not depend on the amount of data to be transmitted for each service S 1 , S 2 , S 3  in the next frame fr, but on the channel coding method. 
     In order to optimize the code efficiency, the service-specific steady-state rate matching factors SRF i  are related to their geometric mean value, so that: 
     
       
         
           
             
               
                 
                   
                     
                       ∏ 
                       
                         i 
                         = 
                         1 
                       
                       n 
                     
                     ⁢ 
                     
                       SRF 
                       i 
                     
                   
                   = 
                   1 
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
     The calculation of the factors SRF, DRF, RF, SF, m needed for rate matching and multiplexing is explained with reference to  FIG. 4 . 
     Using the minimum spread factor (SF=4), Nmax bits can be transmitted in a frame fr. Thus, the following inequality can be specified which describes the dependence between the transmission capacity in a frame, given by the number m and the respective spread factor SFj (j=1 . . . m) of the transmission channels and that required by the data blocks of the n services: 
     
       
         
           
             
               
                 
                   
                     DRF 
                     · 
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           1 
                         
                         n 
                       
                       ⁢ 
                       
                         Bi 
                         · 
                         Ki 
                         · 
                         SRFi 
                       
                     
                   
                   ≤ 
                   
                     
                       ∑ 
                       
                         j 
                         = 
                         1 
                       
                       m 
                     
                     ⁢ 
                     
                       N 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         max 
                         · 
                         
                           
                             SF 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             min 
                           
                           SFj 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
     The right-hand side of equation (2) describes the number of bits per frame fr available with m transmission channels whereas on the left-hand side of the inequality, the capacity required by n services, of which in each case Ki blocks with the block size Ki and the steady-state rate matching factors SRFi are to be transmitted, is given. 
     The dynamic rate matching factor DRF introduced in equation (2) provides for the additional uniform expansion and compression of all data in a frame f r. This factor DRF is call-oriented. The equals sign applies if the frame fr has to be filled completely with data in order to avoid a discontinuous transmission (DTX). 
     When the call-oriented dynamic rate matching factor DRF is determined, it must not drop below a minimum value which is the quotient of the minimum total rate matching factor RFmin and the minimum of all steady-state rate matching factors SRF so that the code efficiency is not impaired too much by puncturing. 
     
       
         
           
             
               
                 
                   
                     DRF 
                     ≥ 
                     
                       DRF 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       min 
                     
                   
                   = 
                   
                     
                       RF 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       min 
                     
                     
                       
                         Min 
                         i 
                       
                       ⁡ 
                       
                         ( 
                         SRFi 
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   
                     3 
                     ⁢ 
                     a 
                   
                   ) 
                 
               
             
           
         
       
     
     According to the preceding inequality (3a), the calculation of the minimum value DRFmin is valid for the special case where the same minimum total rate matching factor RFmin applies to all services i. In general, however, individual total rate matching factors RFmin can also apply to different services i. Thus, for a certain service i, for example, the case may occur that no puncturing is performed (RFmin=1) whereas puncturing is still performed for other services i. Depending on the coding method used, an individual minimum total rate matching factor RFmin can thus be allocated to each service i. To take this variability of the service-dependent total rate matching factor RFmin into account, the inequality (3a) is expanded in the following manner: 
     
       
         
           
             
               
                 
                   
                     DRF 
                     ≥ 
                     
                       DRF 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       min 
                     
                   
                   = 
                   
                     
                       Max 
                       i 
                     
                     ⁡ 
                     
                       ( 
                       
                         
                           
                             RF 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             min 
                           
                           , 
                           i 
                         
                         SRFi 
                       
                       ) 
                     
                   
                 
               
               
                 
                   ( 
                   
                     3 
                     ⁢ 
                     b 
                   
                   ) 
                 
               
             
           
         
       
     
     Analogously, neither should a maximum value be exceeded which is the quotient of the maximum total rate matching factor RFmax and the maximum of all steady-state rate matching factors SRF so that not too much transmission capacity is given away by repetition. 
     
       
         
           
             
               
                 
                   
                     DRF 
                     ≤ 
                     
                       DRF 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       max 
                     
                   
                   = 
                   
                     
                       RF 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       max 
                     
                     
                       
                         Max 
                         i 
                       
                       ⁡ 
                       
                         ( 
                         SRFi 
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
     
     Using equation (2), the values for m, SFj and DRF which allow optimum utilization of the physical channels can thus now be calculated in dependence on Bi, Ki and SRFi. For this purpose, it is only necessary to establish an unambiguous order of spread-spectrum codes between transmitter and receiver, which are allocated in dependence on the total number of bits to be transmitted in a frame fr. This mapping rule is established throughout the system or is signaled at the beginning of a call. 
     In the text which follows, a boundary condition is assumed which stipulates occupation of the least number of transmission channels possible. In this case, it holds true that when m&gt;1, all transmission channels apart from one transmission channel must have the minimum spread factor SFmin. It should be emphasized that the coding rule according to equations (5) to (7) is one of a number of possible examples since other boundary conditions can also be assumed. 
     Using the minimum permissible value of the dynamic rate matching factor DRFmin from equation (3a, 3b), the following is obtained for the required number of channels m (┌ ┐=rounding-up operator): 
                   m   =     ⌈         1     N   ⁢           ⁢   max       ·   DRF     ⁢           ⁢     min   ·       ∑     i   =   1     n     ⁢     Bi   ·   Ki   ·   SRFi           ⌉             (   5   )               
and the spread factors
 
                   SFm   =     ⌊       SF   ⁢           ⁢     min   ·   N     ⁢           ⁢   max         DRF   ⁢           ⁢     min   ·     ∑     Bi   ·   Ki   ·   SRFi           -         (     m   -   1     )     ·   N     ⁢           ⁢   max         ⌋             (   6   )               
where └ ┘ is the rounding-down operator to the next possible spread factor
 
SFj=4 for m&gt;1 and  j=l . . . m− 1.  (7)
 
     The dynamic rate matching factor DRF is now recalculated in deviation from its minimum value DRFmin: 
     
       
         
           
             
               
                 
                   DRF 
                   = 
                   
                     
                       N 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         max 
                         · 
                         
                           ( 
                           
                             m 
                             - 
                             1 
                             + 
                             
                               
                                 SF 
                                 ⁢ 
                                 
                                     
                                 
                                 ⁢ 
                                 min 
                               
                               SFm 
                             
                           
                           ) 
                         
                       
                     
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           1 
                         
                         n 
                       
                       ⁢ 
                       
                         Bi 
                         · 
                         Ki 
                         · 
                         SRFi 
                       
                     
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
     Instead of the product Bi*Ki, a volume of data Ni can also be used if there is no block-by-block transmission or the block size Bi is equal to one bit. 
     To impair the code efficiency as little as possible, the expansion or compression should be restricted to the minimum required, with the consequence that the dynamic rate matching factor DRF should be as close as possible to 1. This means that in the case of discontinuous transmission, the possible transmission capacity must be completely utilized if, as a result, the compression can be reduced. Even with discontinuous transmission, a value is taken from equation (8) as long as it is less than or equal to 1. If DRF&gt;1, DRF is set to 1. 
     Knowing the dynamic rate matching factor DRF means that the resultant rate matching factor RFi can be specified for all services i:
 
 RFi=DRF*SFRi ( i= 1 . . .  n )  (9)
 
If RFi&gt;1 for a service i bits are repeated and if RF&lt;1, puncturing is performed. In each case, only one of the two methods is used by the rate matching in one step for the data d 1 , d 2 , d 3  for each service.
 
     Combining steady-state and dynamic rate matching automatically minimizes the number m of transmission channels needed and, at the same time, maximizes the spread factors SF in order to generate as little interference as possible. Thus, the implicit dynamic rate matching also has an advantageous effect if DTX is permitted. 
     Optionally, if the dynamic rate matching factor is 
     DRF&gt;DRFmax, individual blocks of those intended for transmission and temporarily stored in a wait loop can be selected and added to the blocks already allocated to the frame fr. The factors SRF, DRF, RF are recalculated in the sense of an optimization loop. If the number m of transmission channels does not need to be increased and the spread factors SF do not need to be reduced, the block can be transmitted in addition to the other data.