HK1103486B - Method for balancing the ratio eb/i in a service multiplexing cdma system and telecommunication systems - Google Patents

Description

Method for equalizing ratio Eb/I in service multiplexing code division multiple access system and communication system

The present application is a divisional application of chinese patent application 01133943.8 entitled "method for equalizing the ratio Eb/I in a service multiplexing code division multiple access system and communication system" filed on 20/4/2000.

Technical Field

The invention relates to a method for designing a communication system comprising at least one emitter and at least one receiver, implementing a process for communicating data transmitted by several transmission channels, the transmission channels being divided into at least two groups, the same group of transmission channels being required to be received with a same ratio Eb/I, the ratio Eb/I being the ratio of the mean energy in bits to the mean energy in interference, the process for communicating the emitter comprising a specific treatment of the group of transmission channels, each treatment comprising a step of rate matching which ensures the conversion of an input block of initial size into an output block of final size, the maximum contraction rate being defined for each treatment as a function of a given rate matching ratio.

Background

The 3GPP (third generation partnership project) organization is a group whose members originate from several regional standards bodies, including, inter alia, ETSI (european telecommunications standards institute) and ARIB (radio industry and business association). Its goal is the third generation mobile communication system standardization. One of the fundamental aspects of the distinction between third generation and second generation systems is that they allow for more flexibility in services beyond the fact that they can more efficiently utilize the wireless spectrum. Second generation systems provide an optimized wireless interface for certain services. For example, GSM

(e.g., global system for mobile) is optimized for voice transmission (telephony). Third generation systems provide wireless interfaces suitable for both typed services and combinations of services.

One of the problems of the third generation mobile radio systems is to efficiently multiplex services having different requirements in terms of quality of service (QoS) over the radio interface. Conventionally, the quality of service is defined on the basis of at least one error rate per transport block including, inter alia, handling of relays, bit error rates and/or. These different qualities of service require corresponding transport channels with different channel coding and channel interleaving. Furthermore, they require different maximum Bit Error Rates (BER). For a given channel coding, the requirements regarding BER are met when the coded bits have at least some code-dependent ratio Eb/I. The ratio Eb/I represents the ratio of the average energy of a certain coded bit to the average energy of the interference.

The following problem is that the requirements for the contrast value Eb/I are different for different quality of service. In CDMA (code division multiple access) type systems, the system capacity is limited by the interference level. The ratio Eb/I must therefore be fixed as correctly as possible for a certain service. Therefore, rate matching operations must be performed between different services for the equalization ratio Eb/I. Without this, the ratio Eb/I will be fixed by the service with the highest requirements, with the result that the other services will have "too good" quality, thus directly reducing the capacity of the system.

This leads to a problem because the rate matching ratios at both ends of the wireless link must be somehow constrained to be the same.

The present invention relates to a design methodology for limiting the rate matching ratio to be the same across a CDMA wireless link.

For the OSI model (open systems interconnection) of ISO (international standards association), a communication device is modeled as a layered model consisting of a large number of negotiations, each of which is a negotiation for providing a service to an upper layer. Layer 1 is responsible for, among other things, performing channel coding and channel interleaving. The services provided by layer 1 are referred to as "transport channels". Transport channels allow higher layers to transport data at a certain quality of service. The quality of service characteristics are represented by delay and BER.

To meet the quality of service requirements, layer 1 uses some coding and appropriate channel interleaving.

Brief Description of Drawings

Several known solutions and in particular those suggested in the 3GPP project will be described in connection with the first several figures. Wherein:

fig. 1 is a diagram illustrating multiplexing of transport channels in the uplink in the current 3GPP proposal;

fig. 2 is a diagram describing multiplexing of transport channels in the downlink in the current 3GPP proposal.

Detailed Description

Shown in fig. 1 and 2 are block diagrams of interleaving and multiplexing, as defined by the current proposal of the 3GPP organization, although this proposal has not been finalized.

In these figures, similar blocks have the same reference numerals. In both cases, the uplink (from the mobile station to the network) may be distinguished from the downlink (from the network to the mobile station) and only the transmission part is shown.

Each transport channel is labeled 100 periodically receives a sequence of transport blocks from a higher layer labeled 102. The number of transport blocks 100 in the sequence and their size depend on the transport channel. The minimum period for providing the transport block sequence corresponds to an interleaving period of the transport channel. Transport channels with the same quality of service (QoS) are processed by respective processing chains 103A, 103B.

In each processing chain 103A, 103B, the transport channels are multiplexed together by the link in step 104, in particular after channel coding and channel interleaving. The multiplexing loads each multiplexed frame. The multiplex frame is the smallest unit of data that can be at least partially multiplexed. The multiplex frame typically corresponds to a radio frame. The radio frames form successive time intervals synchronized with the network and have a network count. In the proposals of the 3GPP organization, the radio frame corresponds to a 10ms period.

The 3GPP proposal includes service specific coding and interleaving selection schematically indicated at 103C. Because of its necessity, the possibility of such a selection is currently under consideration, or in other words has not yet been established.

In the usual case, the processing chain 103A first comprises a step 106 in which a bit word called FCS (frame check sequence) is set in each transport block. The bit word FCS is usually calculated using a so-called CRC method (cyclic redundancy check) which consists in considering the bits of the transport block as polynomial coefficient p and in calculating the CRC after division by a so-called generator polynomial G through a remaining polynomial (p + p0), where p0 is a polynomial predefined for a given degree p. Setting the bit word FCS is optional and some transport channels do not include this step. The particular method of calculating the bit word FCS is also related to the maximum size of the transmission channel, in particular of the transmission block. The bit word FCS serves to detect whether a received transport block is valid or invalid.

A next step 108 includes multiplexing together transport channels (trchs) of similar quality of service (QoS). This is because these transport channels with the same quality of service may use the same channel coding. In general, the multiplexing at step 108 is implemented for each transport channel by linking the transport block sequence with their FCS.

The next step, labeled 110, includes implementing channel coding.

At the exit from the channel encoder 110, there is a series of encoded blocks. Typically, in the case of convolutional codes, we get a single coded block of zero or different length. The length is given by the following formula:

N_output＝N_input/(coding rate) + N_tail(length of code block)

Wherein:

-N_outputthe number of bits of the output end (the length of the coding block);

-N_inputthe number of bits of the input end;

-the coding rate is a constant ratio; and

-N_tailfixed amount of information, with N_inputIndependently, the effect is to completely empty the channel encoder when an encoded block is received.

From this step 110 onwards the uplink is different from the downlink.

At each transmission channel, whether uplink (fig. 1) or downlink (fig. 2), a rate matching step is performed after the channel coding step 110. This step is labeled 112 for the uplink and 114 for the downlink. The rate matching does not have to be done immediately after the channel coding 110.

The purpose of the rate matching step 112 or 114 is to equalize the ratio Eb/I between the transport channels with different quality of service. The ratio Eb/I gives the ratio of the bit average energy to the interference average energy. In a system utilizing multiple access CDMA techniques, the greater the ratio, the higher the quality that can be achieved. It will therefore be appreciated that transport channels with different quality of service will also have different requirements for the ratio Eb/I, and that without rate matching, some transport channels will have "too" good quality of service for their respective requirements, as it is fixed by the channel with the highest quality of service requirement. Such a transmission channel does not necessarily generate interference. The task of rate matching is therefore to match the ratio Eb/I. Rate matching is such that X bits at the input give Y bits at the output, thus multiplexing Eb/I by the ratio Y/X and hence by matching capabilities. In the following description, the ratio Y/X is referred to as a rate matching ratio, which is also known as a rate matching ratio.

The rate matching is implemented differently in the uplink and downlink.

This is because continuous transmission has been decided in the uplink because discontinuous transmission will deteriorate the peak-to-average ratio of radio frequency power at the output of the mobile station. The closer the ratio is to 1, the better. Since if the ratio deteriorates (i.e. increases) this means that the power amplifier needs a large linearity margin (compensation) corresponding to the average operating point. Taking this redundancy into account, the efficiency of the power amplifier will be reduced and thus more average power consumption will be required for transmitting the same, which in particular will reduce the battery power life of the mobile station and is unacceptable. The rate matching ratio Y/X cannot be kept constant because continuous transmission is necessary on the uplink. This is because of the number of bits after matching and Y₁+Y₂+...+Y_kMust equal the total number of bits in the data transmission frame. The number may take only some predetermined value N₁、N₂、...、N_p. Therefore, it becomes necessary to solve the following k unknowns Y₁、...、Y_kThe system of equations of (1):

wherein X_i、Eb_iI and p_iIs a characteristic constant for each transmission channel and wherein the aim is to derive from p possible values of N₁、N₂、...、N_pIn such a way that N_jMinimum (note: p)_iIs the maximum allowed puncturing rate for the coded transport channel).

Thus, in the uplink, the rate matching ratio Y/X is not constant from one multiplexed frame to the next for each transmission channel, but is limited to a range of multiplication constants; so that the ratio of two between these ratios remains constant.

In the downlink, the peak-to-average ratio of the radio frequency power is in any case poor, since the network transmits to several users simultaneously. The signals destined for these users combine, either positively or negatively, causing the radio frequency power transmitted by the network to vary greatly, thus resulting in poor peak-to-average ratio differences. It was therefore decided to perform Eb/I equalization between different transport channels for the downlink using rate matching with a constant rate matching ratio Y/X, the multiplexed frame would be supplemented with null bits, i.e. bits that are not transmitted, that is to say not transmitted continuously.

The difference between uplink and downlink is therefore the fact that the uplink rate matching 112 is dynamic to supplement the multiplexed frame, while the downlink rate matching 114 is static, and the multiplexed frame is supplemented by inserting nulls in the immediately following step 124.

Whether dynamic or static, the rate matching is performed by repetition or puncturing, according to the algorithm proposed by siemens to ETSI in the technical document referenced SMG2/UMTS-L1/Tdoc428/98 (registered trademark). The algorithm enables non-integer puncture/repeat ratios to be obtained and is described in table 1.

TABLE 1 repeat or shrink Algorithm

A particular feature of the algorithm is that it avoids successive bit puncturing when it is operating in the puncturing mode, but instead tends to maximize the separation between two puncturing positions. For repetition, the repeated bits follow the bits they repeat. Under these conditions, it is understood that it is more advantageous to perform rate matching prior to interleaving. For repetition, due to the fact that interleaving after rate matching spaces out the repeated bits, and for puncturing, due to the fact that the interleaver before rate matching leads to the risk that rate matching may puncture consecutive bits as it comes out of the channel encoder.

It is therefore advantageous to perform rate matching at as high a level as possible, that is to say as close as possible to the channel encoder.

Furthermore, after the channel coding step 110, each processing chain 103A, 103B also comprises a first interleaver, denoted 116 for the uplink and 118 for the downlink, followed by a step of segmenting each multiplex frame, denoted 120 for the uplink and 122 for the downlink. The first interleaver 118 does not have to be arranged to follow the channel coding 110.

For the downlink, the rate matching 114 can be placed exactly at the output of the channel coding 110, since the rate matching ratio is constant, and therefore only one interleaver 118 is needed in advance.

However, the second interleaver 126 is necessary because the multiplexing of transport channels of different quality of service QoS is achieved by forward linking, since such an approach would in fact limit the time period of each multiplexed block.

For the uplink, the rate matching ratio may vary with each multiplexed frame. This explains that at least a first interleaver 116 is required before rate matching 112 to allocate bits of the coded block over the interleaved multiplexed frames, and a second interleaver 128, which is arranged after rate matching, is required to space the bits repeated by rate matching 112.

Thus two interleavers, referred to as first and second interleavers in the block diagram, can be seen in the block diagram of fig. 1 and 2. The first interleavers 116, 118 are interleavers having a time interval equal to the interleaving time interval of the respective transport channel. The time interval may be longer than the period of the multiplexed frame, typically multiplied by a constant ratio. This is why the first interleavers 116, 118 are sometimes also referred to as inter-interleavers.

The second interleaver 126, 128 is also referred to as an intra-frame interleaver because its time period is the time interval of the multiplexed frame.

Thus, the step of segmenting each multiplexed frame, labeled 120, 122, is located between the first interleavers 116, 118 and the second interleavers 128, 126 (when there are second interleavers). This step consists in dividing the block coded and interleaved by the first interleaver into as many blocks as possible, since it is equal to the ratio of the time period of the first interleaver to the period of the multiplex frame. This segmentation is typically done in such a way that the segments are linked again resulting in interleaved encoded blocks.

It should be noted that in the uplink, the segmentation step 120 must precede the rate matching 112. This is because the rate matching 112 is based on the ratio of the multiplex frame to the dynamic multiplex frame and therefore cannot be performed on the data units of a possible duration interval multiplex frame.

In both uplink and downlink, the step 130 of segmenting into physical channels is done before each second interleaver 126, 128. Similarly, the second interleavers 126, 128 are followed by a physical channel mapping step 132 adapted for transmission.

Currently, only multiplexing, channel coding, interleaving and rate matching algorithms are defined and discussed. No rule enables to fix the way that for a block size X input into the bit-rate matcher, the associated block size Y is obtained at the output. We have to assume that all pairs combinations (X, Y) are predefined and stored in memory in a solidified manner. Only one of the following two cases is possible:

or the sequence pair (X, Y) remains fixed, with no flexibility for the service considered, contrary to the search;

or the sequence pair (X, Y) is negotiated between the concerned mobile station and the communication network and a large number of signalling bits must be expected, so that additional fixed resources are conceivable.

A rule for determining the size Y of a rate matching block, which is rate matched with other blocks, from the size X of the block before rate matching is at least necessary in the uplink. This is because the number of transport blocks provided to each transport channel is different since the service has a variable bit rate. Sequence of sizes (X) of blocks to be rate matched₁、X₂、...、X_k) May change continuously from multiplexed frame to multiplexed frame. The number k of elements in the sequence need not be constant.

Because of the same size as X_iRelative size Y_iNot dependent solely on X_iBut rather depends on the entire sequence (X) due to dynamic matching₁、X₂、...、X_k) Thus for each sequence (X)₁、X₂、...、X_k) There is a sequence (Y)₁、Y₂、...、Y_k). The number of sequences can be very large, at least as large as the number of transport format combinations. The combination of transport formats is a number that defines how the multiplexed frames are demultiplexed.

Thus, the emitter and receiver should utilize the same correlation sequence (X)₁、X₂、...、X_k)→(Y₁、Y₂、...、Y_k). In combined coded transmissionThis association sequence signals between the two volumes when the channel is connected, representing a non-negligible cost in terms of signaling bits. The combined coded transport channels include at least two sets of coded transport channels. Moreover, for each increase or decrease included in the combined coded transport channel, a new association sequence (X) must be made₁、X₂、...、X_k)→(Y₁、Y₂、...、Y_k) The exchange of (2).

Moreover, the ratio Eb/I exactly matches the technique of the channel decoder depending on each quality of service QoS. The performance of such devices may vary from manufacturer to manufacturer, depending on their respective production experience. In fact, the rate matching is independent of the individual performance of each decoder, but rather of their performance relative to each other, which may vary from manufacturer to manufacturer if the performance of one of them varies.

It is therefore not possible to "negotiate" the matching of the ratio (Eb/I) for the transmitting and receiving bodies used by appropriately exchanging signaling messages.

To explain this, we consider two qualities of service a and B, and two manufacturers M and N. M and N have the same channel decoder for a, but for B, the decoder for M is much more efficient than for N. It is clear that manufacturer M can benefit from a smaller ratio Eb/I for B because this will reduce the total power required and therefore increase capacity, thus making M a proven option to sell more mobile communication devices to the network operator.

Therefore, it is very useful to transmit the signal parameters so that it can define the rule X → Y for determining the size Y of the block from the block size X before matching after rate matching. This will enable the size of the ratio Eb/I to be negotiated or renegotiated. Thus, the signal must be transmitted at as low a cost as possible.

The adjustment thus carried out by the higher layer at the ratio Eb/I connection means that if two communication stations a and B wish to establish or modify a connection with service multiplexing above, they proceed according to the following steps:

b signals a the maximum load N that multiplex frame B can send.

A determines the ideal size of the ratio Eb/I for A by the following parameters:

-a value of N received from B;

-for each quality of service QoS, a maximum allowed contraction rate;

-the relevant requirements for each quality of service QoS in terms of Eb/I;

minimum performance requirement specified for a.

A signals B the size of the desired ratio Eb/I for A.

Step 1 is not necessary at present. The system can assume that its maximum load is known in advance and forms part of the characteristics of the system. That is, such a system would be highly unlikely from a lack of flexibility perspective.

It may happen that the size of the ratio Eb/I determined by a is sub-optimal with respect to the search target, which is better than it without a transmission channel. This is a compromise, in which case reducing the capacity of the network should be seen as preferable, provided that a connection for a combinational service can be established.

This trade-off is acceptable for degradation within the limits determined by the minimum performance requirements defined in the system requirements.

It may also happen that the actual tolerance is partly within the processing range of the network. This will enable the definition of a non-guaranteed layer of service, which is provided when the traffic conditions allow, responsible for negotiating down again.

There is of course an explanation of possible combinations of services. In this description, a series of combinations of transport formats will be set for each combination service. This is clearly the case for basic services such as basic telephony services and all related services such as call signals, waiting etc.

However, the number of potential combinations may increase substantially in the future, and explicit rules will be needed for higher layers to determine which combinations are possible, to negotiate them, and/or to negotiate them again, and to facilitate them in determining a range of transport format combinations for a given combination.

Therefore, higher layers must be able to determine which transport format combinations are possible with the aid of simple mathematical algorithms. To this end, the higher layers should utilize at least three algorithm rules:

● the first rule is related to channel coding, enabling the number of elements of a sequence of transport blocks and their respective sizes to be transformed into the number of elements of a sequence of coded blocks and their respective sizes. For example, the rule may be of the type:

x/(coding rate) + N_tailWherein "coding rate" and "N_tail"is the characteristic constant of the code.

● the second rule is for segmentation, transforming the size of the coded block into the size of the segment produced by segmenting each multiplexed frame. Typically the rule is simply to divide by F when the transmission interval of the relevant transmission channel corresponds to F multiplex frames. However, it is not clear whether the segments are equal or unequal. In case of equal segmentation, the size of the coded block is a multiple of F. In this case, the size of all segments is the same, since there is no rounding error when divided by F. In the case of unequal fragmentation, the size of the fragment is limited to within 1 bit, including carry or truncation errors, and the sequence number of the fragment must be known in order to reduce uncertainty. For example, if 80 bits are segmented into 8 frames of F equal, each segment will contain 10 bits and the sequence number (or segment position) of the associated segment need not be known in order to determine its size. On the other hand, if 78 bits are segmented into 8 frames of equal F, then 6 segments will contain 8 bits, the other two segments will contain 9 bits, and the sequence number of the segment must be known in order to determine its size.

● the third rule is a rule that enables the size Y of a rate matching block to be deduced from the size X of the block to be rate matched.

This third rule does not state that the present invention deduces a solution to the problem of the respective sizes of the blocks to be matched.

The object of the present invention is to ensure that both the transmitting and receiving parties of a mobile communication network can know in a simple manner for each transmission channel associated with the same quality of service the size Y of the block obtained at the output of the rate matching means and associated with each quality of service as a function of the size X of the block input to the matching means.

It is also an object of the invention to minimize the number of signaling bits determined so that the size of the block Y obtained at the output of the rate matching means and input to the associated block size X of these rate matching means can be defined in a versatile manner for one or more transmitting and receiving entities.

It is a further object of this invention to retain the flexibility of defining the relationship of block size Y output by the rate matching means to block size X input to the rate matching means.

Disclosure of Invention

To this end, the subject of the invention is a method for designing a communication system comprising at least one emitter and at least one receiver, implementing a process for communicating data, said communication data being transmitted by several transmission channels, said transmission channels being divided into at least two groups, said same group of transmission channels being required to be received with a ratio Eb/I of mean energy per bit to mean energy per interference, said communication process for an emitter comprising a specific processing of the group of transmission channels, each processing comprising a rate matching step which ensures the conversion of an input block of initial size into an output block of final size, a maximum contraction rate being defined for each processing as a function of a given rate matching ratio. It is characterized in that it comprises in sequence:

for each process, determining from at least one of said volumes a first parameter representative of said rate matching ratio and a second parameter representative of a specific maximum shrinkage rate of said process;

a step of transferring at least one of said first and second parameters from at least one of said volumes (called first volume) to another of said volumes (called second volume); and

for each process, a final block size obtained at the completion of the rate matching step is calculated by at least the second volume as a function of an initial size of the input block based on a criterion determined by at least one of the determined first and second parameters.

According to other features:

-said criterion belongs to the group comprising:

a set of said first and second determined parameters relative to said set of processes;

a set of initial sizes of input blocks relative to the process;

a set of input block initial sizes of the same multiplex frame relative to the set of processes;

-said step of calculating the final size comprises:

a first step of calculating, for each process, a matching ratio as a function of said first and second parameters;

a second step of calculating the intermediate size of the output blocks of the same multiplexed frame;

a step of selecting a maximum payload from a set of available maximum payloads as a function of said calculated intermediate size with respect to said multiplexed frame.

A third step of calculating at least one final size, each final size being calculated as a function of the selected maximum payload and said intermediate size, such that the sum of said final sizes of the output blocks of a multiplex frame equals said selected maximum payload;

-said third step sequence of calculating the final size comprises:

a first step of calculating at least one accumulation size, each accumulation size being calculated as a function of said intermediate size, corresponding to an integral function for the ratio of the selected maximum payload and the sum of said intermediate size fraction and said intermediate size;

a second step of calculating at least one final magnitude, each final magnitude being calculated as a function of the magnitude of the accumulation corresponding to the difference between two successive magnitudes of the accumulation;

-for each process, a match ratio is defined as the product of the first parameter and an extremum of said process, a function dependent on the first and second parameters;

-the selected maximum payload is the smallest of the maximum payloads available;

-for each process, an intermediate matching ratio value is defined as the product of the first parameter and the extremum of said process, being a function dependent on the first and second parameters;

-said function dependent on the first and second parameters is equal to 1 over a multiplier constant and the ratio of the difference between the maximum shrinkage rate, which is derived from the second parameter representing the shrinkage rate, and the first parameter;

-in the process of establishing a communication connection between a first entity to a second entity, it comprises a process of exchanging information between the first and second entities of the system, said exchange process comprising the steps of:

the second volume identifying a maximum transmission capacity of the first volume;

for each process, the second body determines a representative value of the rate matching ratios specific to that process as a function of the maximum transmission capacity of the first body;

the second entity transmitting a set of representative values of rate matching ratios of all processes to the first entity;

the first body determining rate matching ratios for all processes as a function of the values received from the second body; and

it is implemented in a communication system implementing CDMA-like technology.

The subject of the invention is also a base station of the type comprising means for transmitting communication data by several transmission channels divided into at least two groups of transmission channels, said transmission channels of the same group being required to be received with the same bit average energy to interference average energy ratio Eb/I, said emitter communication means comprising processing modules specific to the groups of transmission channels, each processing module comprising rate matching means which ensure the conversion of the initial size of the input block into the final size of the output block, the maximum shrinkage being defined for each processing module as a function of a given rate matching ratio, characterized in that it comprises:

-means for determining, for each processing procedure, a first parameter representative of said rate matching ratio and a second parameter representative of a specific maximum shrinkage of said processing module;

-means for transmitting at least one of said first and second parameters; and

-means for calculating, for each processing module, the size of the last block at the output of said rate matching means as a function of the initial size of the input block based on a criterion determined by at least one of said first and second determining parameters.

The subject of the invention is also a mobile station of the type comprising means for transmitting communication data by several transmission channels divided into at least two groups of transmission channels, said transmission channels of the same group being required to be received with the same bit average energy to interference average energy ratio Eb/I, said transmitter communication means comprising processing modules specific to the groups of transmission channels, each processing module comprising rate matching means which ensure the conversion of the initial size of the input block into the final size of the output block, as a function of a given rate matching ratio, the maximum shrinkage being defined for each processing module, characterized in that it comprises:

-means for determining, for each processing procedure, a first parameter representative of said rate matching ratio and a second parameter representative of a specific maximum shrinkage of said processing module;

-means for transmitting at least one of said first and second parameters; and

-means for calculating, for each processing module, the size of the last block at the output of said rate matching means as a function of the initial size of the input block based on a criterion determined by at least one of said first and second determined parameters.

The invention will be better understood from a reading of the following description, given by way of example only, with reference to the accompanying drawings. Wherein:

fig. 3 is a flow chart explaining the implementation of the algorithm according to the invention for the downlink; and

fig. 4 is a flow chart explaining the algorithm according to the invention for the uplink implementation.

In general, each quality of service is characterized by two integers, E and p, in the present invention. E corresponds to the ratio Eb/I, that is to say if there are several quality of service markers 1, 2,.. and p, their respective coefficients E are marked as E₁、E₂、...、E_PThen the ratio Eb/I per quality of service will be related to the coefficient E_iAre identical to each otherAnd (4) proportion.

The coefficient p corresponds to the maximum shrinkage which is acceptable for a given quality of service. Thus, for each quality of service 1, 2.. multidot.p, there is an associated maximum shrinkage designated P1, P2.. multidot.pp. The maximum puncturing rate is implemented by channel coding, which is implemented within a processing chain specific to the associated quality of service. Puncturing consists in deleting the coded bits. Such erasures are acceptable as long as the channel coding introduces redundancy. However, the number of punctured bits cannot be too large relative to the total number encoded, so the maximum puncturing rate depends on the channel coding and the decoder used.

In a communication system, physical channels dedicated to control data transmission are provided between the various transmitting and/or receiving bodies of the system. In particular, such a channel exists between a fixed network and a mobile station of a mobile radio communication system. The latter is typically indicated by DPCCH in the 3GPP standard (or dedicated physical control channel). In the same standard, this channel, which is along and coexisting with the physical data transmission channel, is denoted as DPDCH (or dedicated physical data channel).

According to the invention, in order to enable each entity of the communication system to confirm the corresponding set between the rate matching block size Yi and the block size to be matched Xi, and for each quality of service, only the pairs (Ei, Pi) i ∈ [1, p ] are transmitted to all the entities of the system that have to communicate with each other through the logical control data transmission channel. These pairs may be established by "negotiation" between an individual or several individuals in a first embodiment, and only the parameters (Ei) are negotiated in a second embodiment, while the parameters (Pi) are predetermined for a given channel coding. In a third embodiment, only the parameters (Pi) are negotiated, whereas the parameter set (Ei) is predetermined for a given group of transmission channels. The method of determining the correspondence between the block sizes Xi, Yi by the pair (Ei, Pi) defined above will be described later.

E and P are integers, because

Integer arithmetic, or fixed-point arithmetic, is easy to implement, as explained, working fast or using fewer resources;

the accuracy of the integer arithmetic is easily made satisfactory by the number of bits of the registers storing these integers. In this way we can easily assume that the same rounding errors are introduced in the network and the mobile station, so that the result of the operation is the same at either end of the radio interface.

More precisely, the dynamic behavior is defined as follows:

● E is an integer between 1 and EMAX,

● P is an integer between 0 and PMAX.

Furthermore, we define a constant PBASE such that PMAX < PBASE and such that P/PBASE is the maximum acceptable shrinkage for a given quality of service.

1/PBASE corresponds to the particle size. The PBASE is of the order of 10⁴.

The maximum acceptable shrinkage factor P/PBASE to achieve a rate matching step for a given quality of service is typically between 0 and 20%.

Thus, the algorithm of the present invention is characterized by the three integers EMAX, PMAX and PBASE.

In the following description, a fourth integer LBASE is used with respect to operational accuracy.

We note that although the same symbols EMAX, PMAX, PBASE and LBASE are used in the uplink and downlink, the former from the mobile station to the network and the latter from the network to the mobile station, the respective constants do not have to take the same value in both cases.

In the following description, the same symbols X and Y are applied to uplink and downlink but have different meanings.

Also, in both cases we shall define a mapping for each link, denoted Q, giving a quality of service QoS value for a given block index.

In the downlink, X₁，X₂，...，X_kExpressed as a list of all possible sizes before rate matching for a block of a given quality of service (QoS), this is true for all possible values of quality of service (QoS).

More precisely, if the quality of service QoS takes a value between 1 and p, then

X_k0+1，...，X_k1All possible block sizes for QoS 1

X_k1+1，...，X_k2All possible block sizes for QoS2

... ... ... ... ... ... ... ... ... ... ...

X_kp-1+1，...X_kpAll possible block sizes for QoS P

Suppose k₀K is 0, kp is k, and k₀＜k₁＜...＜k_p.

Also, we consider the mapping Q between the set of block size indices { 1.. k } for each quality of service QoS to the set of quality of service indices { 1.... p }, so we have:

Q：{1，...，k}→{1，...，p}

i → Q (i) ═ j for k_j-1＜i≤k_j

Note that looking at the above definition, it is assumed that the quality of service is different (Q)_(i)≠Q_(j)) Doubling the same block size (X)_i＝X_jI ≠ j) is possible.

For the uplink, the blocks to be rate matched for a given multiplex frame are numbered 1, 2,, k, and X₁，X₂，，...，X_kRespectively their size.

Thus multiplexing the list between frames { X₁，X₂,... Xk } is varied. In particular the sequence number k of the element does not have to be constant.

Q is the mapping from { 1.. eta.,. k } to { 1.,. eta.,. p } for the relevant multiplex frame, the index i of the other associated block, its quality of service Q_(i)。

In the conventional case, whether they have the same quality of service (Q)_(i)＝Q_(j)) Or (Q)_(i)≠Q_(j)) Doubling the same block size (X)_i＝X_jI ≠ j) is possible.

In fact, for two blocks of similar quality of service to have the same size, it is sufficient for the channel encoder to output a set of encoded blocks having at least two elements of similar size.

In short, for the downlink, it is assumed that the block sizes corresponding to different quality of service are calculated separately, 1, 2.. k is an index of all possible block sizes to be rate matched, and for the uplink, 1, 2.. k is an index of the list of blocks to be rate matched for a given multiplexed frame.

After rate matching, Y₁，Y₂，...，Y_kAre each corresponding to X₁，X₂，...，X_kThe block size of (2).

For the downlink, the same processing chain (Q) for a single body_d(i) From a value E associated with the quality of service q)_qAnd P_qDetermine the pair { X_i，Y_iThe algorithm of the set of { E } is illustrated in FIG. 3, which receives the parameter pair { E } while negotiating a bit average energy to interference average energy ratio (Eb/I) match_q，P_qThe set of { C }. Depending on the body of the decision on the result of the current negotiation, this body may be the emitter (comprising at least one base station) for the composite transport channel or for the composite transport channelA receiver of a combined transmission channel (comprising at least one mobile station). In most cases it is the receiver of the transmission channel set that determines the design of the inventive method, while the emitter implements the design of the inventive method.

Let us assume that for each quality of service q in 1_qAnd P_q. These are received at steps 300A and 300B over the already established transmission channel. In addition, a value X may be obtained at step 300C_iWhether they are predefined or negotiated for the quality of service q.

The first step 302 of the algorithm is to calculate an integer parameter L for each q from 1 to p_qDefined as:

wherein the content of the first and second substances,represents the largest integer less than or equal to x. Obviously, according to a variant embodiment, the smallest integer greater than or equal to x is chosen.

In general, any other rounding function is also applicable when it is desired to calculate a rounding function at any step in the determination of the parameters. Furthermore, the two steps of two different and uncorrelated rounding functions may be used to determine the parameters.

The next step of the notation 304 includes defining a parameter LMAX by:

in the following, for each quality of service q, an integer S is defined in step 306_q：

S_q＝LMAX·E_q

For each quality of service q at a given maximum shrinkage factor P_qIn the case of/PBASE, S_qShould be such that the rational number S is given_q/(PBASE. LBASE) is the minimum rate matching ratio.

As illustrated, S_qThe following relationship should be met:

S_q/(PBASE·LBASE)≥1-P_q/PBASE

the design method of the invention has the following advantages: according to the method, it is not necessary to retransmit all the parameter pairs { E/I used for the quality of service, in particular before or after the increase or decrease in the current transport channel composite for at least one group of transport channels exhibiting the same quality of service, or before or after the modification of the ratio (Eb/I) of the bit average energy to the interference average energy sought for a given quality of service_q，P_qIs transmitted, but only the parameter pairs E associated with the transport channel group are transmitted_q，P_qThe transport channel groups are affected by increasing and/or modifying the sought ratio Eb/I.

The previous part of the algorithm is also applicable to the uplink. Whereas the latter half of the algorithm is only applicable to the downlink.

Once step 306 is complete, at step 308, relationship X is defined by_i→Y_i：

Wherein the content of the first and second substances,is the smallest integer less than or equal to x.

Knowing each X_iAnd Y_iIs determined, a size pair (X) is established in step 310_i，Y_i) The collection of (2).

In short, in the downlink, the algorithm essentially comprises the following four steps:

1. for all QoS q, calculate(step 302)

2.(step 304)

3. For all QoS q, calculate S_q:＝LMAX·E_q(step 306)

4. For i: -1 to k, calculate(step 308-310)

For the uplink, the same processing chain (Q) for a single body_m(i)) From the value E associated with the quality of service q_qAnd P_qDetermine a set of pairs { X_i，Y_iThe algorithm of (E) is illustrated in FIG. 4, which receives a set of parameter pairs { E } while negotiating a ratio of bit average energy to interference average energy (Eb/I) balance_q，P_q}. Depending on the body that determines the result of the present negotiation, this body may be the emitter (comprising at least one base station) for the composite transport channel or the receiver (comprising at least one mobile station) for the composite transport channel. In most casesIn several cases, it is the receiver of the composite transport channel set that determines the design of the method of the present invention, while the emitter implements the design of the method of the present invention.

For the uplink, the rate matching ratio is calculated for each multiplexed frame. Thus, it is not the mapping X that is determined_i→Y_iBut rather determines the mapping { X }₁，X₂，...，X_kTo { Y }₁，Y₂，...，Y_kThe problem of (1); in fact, from Y_iTo Y_kThe sum of (a) and (b) must be equal to the maximum payload of the multiplexed frame.

Furthermore, the (potential) maximum payload of the multiplexed frames may differ for each frame depending on the physical source used, but the amount of data to be transmitted (corresponding to transport block X)_iTo X_kAll sizes of input data). Thus, we can define a set N as such₁，...，N_rE.g. the possible payload N for the multiplexed frame₁The method is less than or equal to Nr. More generally, N₁、N₂To N_rR corresponds to the different maximum payloads allowed to be transmitted N₁，N₂...，N_rThe priority order of the physical source of.

Thus, one of the results of the algorithm used to determine rate matching is to select a maximum payload N allowed for transmission that identifies JSEL from {1, 2_JSELAnd ensures that:

for this purpose, two successive stages are carried out.

In the first phase, the block size Y 'is determined "statically" in a similar manner to the case of the downlink'_i. The steps of this stage are denoted by the same reference numerals as in fig. 3, increased by 100. Thus, this is from X_i→Y’_iTo (3) is performed.

In the second stage, N_JSELAnd corresponds to Y'_iY of (A) is_iIs dynamically determined so as to satisfy equation (1). Thus, this is from (Y'₁，Y’₂，...Y’_k)→(Y₁，Y₂，...，Y_k) To (3) is performed.

The first phase, comprising steps 400 to 408, is simply defined by the following equation: y'_i＝S_Q(i)·X_i。

The JSEL is then determined at step 410 by the following equation:

as stated, if N₁≤N₂...N_rThen the minimum maximum payload allowed for transmission is selected.

Then, in step412 we define by Yi the integer Z corresponding to the last size running total₀，Z₁，...，Z_kThat is to say that

Z₀:＝0

For i: -1 to k, calculate

WhereinIs the largest integer less than or equal to x.

Finally, Y is simply calculated at step 414 from the following equation_i：

Y_i＝Z_i-Z_i-1。

In this way, note that the final size (Y) is being calculated_i) The time rounding error is not cumulative. In this way, regardless of the number k of data blocks, only two rounding errors are made:

relative to the symbol Z_iThe first of the cumulative size values, and

relative to the preceding one denoted by Z_i-1The second of the magnitude values is accumulated.

Finally, the desired pair (X) is obtained in step 416_i，Y_i)。

In short, in the uplink, the algorithm essentially comprises the following seven steps:

1. for all QoS q, calculate(step 402)

2.(step 404)

3. For all QoS q, calculate S_q:＝LMAX·E_q(step 406)

4. For i: -1 to k, calculate Y'_i:＝S_Q(i)·X_i(step 408)

5.(step 410)

Z₀＝0

6. For i: -1 to k, calculate(step 412)

7. For i: -1 to k, Y is calculated_i:＝Z_i-Z_i-1(step 414)

Before we note that although the concept of quality of service is defined as the quality of service of one transport channel, the assumption is that the goal is to determine rate matching, i.e. to illustrate more accurately the quality of service provided by the lower layers of the interleaving and multiplexing chain to the channel encoder with the quality of service provided by the layers 1 to higher.

The examples given above are not meant to limit the scope of the invention, and various modifications may be made without departing from the scope of the invention. In particular, it should be noted that for determining the parameter pair { E }_q，，F_qThe step of (c) is not only performed for each quality of service but also for each level of coded bits of the same quality of service. In fact, it should be remembered that some channel codes (for example in turbo coding in particular) transmit a plurality of levels of coded bits more or less sensitive to puncturing.

Claims (5)

1. A method of configuring a telecommunication system, said method being implemented in an uplink of said telecommunication system, said telecommunication system comprising a plurality of entities performing a phase of communicating data, said data being communicated by a plurality of transmission channels, said plurality of entities being an emitter and a receiver, said data of said transmission channels being multiplexed into a plurality of multiplexed frames, said data being rate matched by the emitter converting an initial size block of input data into a final size block of output data, characterized in that said method comprises the steps of:

-calculating, by one of said entities, for each of said transport channels, an intermediate size of said output data block by multiplying a rate matching parameter with said initial size of said input data block, said rate matching parameter representing a rate matching ratio and corresponding to a ratio of a bit average energy to an interference average energy;

-determining, by one of the entities, a minimum maximum payload for the multiplex frame from a plurality of possible maximum payloads based on a sum of a size of the possible maximum payloads and an intermediate size of the output data block;

-calculating, by one of said entities, a plurality of set sizes, each of said set sizes being calculated for a transmission channel i by the following formula:

here:

Z₀＝0；

Z_iis the set size of the transport channel i;

is the largest integer less than or equal to x;

Y′_jis the intermediate size of the output data block of transport channel j;

N_JSELis the smallest maximum payload;

k is the number of the transport channels included in the transport channel combination; and

-calculating, by one of said entities, a final size Y of said output data block for said transport channel i_iThe last size Y of the output data block_iIs as a difference Z of the sizes of two successive sets_i-Z_i-1To be calculated;

-an execution step, performed by one of said entities, of a conversion of an input block of an initial size into an output block of a final size;

-a transmitting step of transmitting, by one of the entities, the data converted in the rate matching step to another of the entities via a physical channel.

2.A method of configuring a telecommunication system comprising a plurality of entities to implement a communication phase of data, said data being communicated by a plurality of transmission channels, wherein said plurality of entities comprises at least one emitter and at least one receiver, the communication phase of said emitter comprising a plurality of processes dedicated to said plurality of transmission channels, each process comprising a step of rate matching, said step of rate matching performing a conversion of an input block of initial size to an output block of final size by puncturing or repeating, the method further comprising:

a transmitting step of transmitting a first parameter and a second parameter from the receiving volume to the emitting volume, wherein the first parameter represents a maximum shrinkage rate and the second parameter represents a rate matching ratio and corresponds to a ratio of a mean energy at bit to a mean energy at interference; and

a calculation step of calculating, for each of said processes, said final size of said output block by said emitter as a function of said initial size of said input block based on a criterion dependent on said first and second parameters transmitted in said transmission step,

wherein bits of the input block are punctured or repeated based on a change between the final size and the initial size in the rate matching step.

3.A mobile station configured to communicate data on a plurality of transport channels grouped in a composite transport channel, the mobile station comprising:

means for receiving a first parameter representing a maximum shrinkage and a second parameter representing a rate matching ratio and corresponding to a ratio of a bit average energy to an interference average energy;

means for calculating a final size of the output block as a function of an initial size of the input block according to a criterion, the criterion being dependent on the first parameter and the second parameter; and

means for converting the input block of the initial size to the output block of the final size by puncturing or repeating according to a change between the final size and the initial size.

4. A method of transmitting data on a plurality of transport channels, the transport channels being grouped in a composite transport channel, an input block of the data being converted to an output block in a rate matching step, the method comprising:

a transmitting step of transmitting, by a base station, a first parameter representing a maximum shrinkage rate and a second parameter representing a rate matching ratio and corresponding to a ratio of a bit average energy to an interference average energy;

a receiving step of receiving the first parameter and the second parameter from a base station; and

a determining step of determining the size of the output block as a function of the size of the input block according to a criterion dependent on the first and second parameters received from the base station; wherein bits of the input block are punctured or repeated in the rate matching step according to a change between a size of the input block and a size of the output block.

5. A method of configuring a telecommunication system comprising a plurality of entities to implement a communication phase of data, said data being communicated by a plurality of transmission channels, wherein said plurality of entities comprises at least one emitter and at least one receiver, the communication phase of said emitter comprising a plurality of processes dedicated to said plurality of transmission channels, each process comprising a step of rate matching, said step of rate matching performing a conversion of an input block of initial size to an output block of final size by puncturing or repeating, the method further comprising:

-a calculation step, for each of said processes, of calculating, by said emitter, said final size of said output block as a function of said initial size of said input block based on a criterion dependent on a first parameter representative of the maximum shrinkage and on a second parameter representative of the rate matching ratio and corresponding to the ratio of the mean energy in bits to the mean energy in interference;

-said rate matching step performs a conversion of an input block of an initial size to an output block of a final size by puncturing or repeating bits of said input block based on a variation between said final size and said initial size;

-a transmitting step, said emitter transmitting the data converted in the rate matching step to another one of said entities, called second entity, via a physical channel; and

-a receiving step of receiving, by the receiving entity, the data transmitted in the transmitting step.