EP1069798A1

Universal mobile telephone system network with improved rate matching method

Abstract

In a UMTS network in which a single user can transmit or receive a number of services having different transmission power requirements over a single channel, a method of determining for each service the number of bits to be punctured or repeated to provide rate matching by the steps of deriving for each service the Energy per Bit per Noise density EB/NO required to achieve a desired Bit Error Rate; from each EB/MO deriving a value of the Energy per coded Symbol per Noise density ES/NO; and from ES/NO deriving a rate matching factor by which that ES/NO can be matched to the minimum Energy per coded Symbol per Noise density applicable to the channel in which the services are multiplexed. The values of EB/NO are stored in a look up table in the BTS and each mobile; the BSC generates values of semi static rate matching factors and spreading factors for each service and transmits them to the BTS and mobiles so that the mobile can calculate from the received values and the values stored in the look up table the number of bits to be punctured or repeated.

EP1069798A1, drawing sheet 1 — Sheet 1 of 22

Term

Term ended

Projected expiry passed 12 July 2019, 7.2 years ago.

11 claims: 2 independent, 9 dependent

1
In a UMTS network in which a plurality of services of a single user having different transmission power requirements are multiplexed in one channel and the technique of rate matching is applied, a method of determining for each service the number of bits to be punctured or repeated characterised by the steps of:- deriving for each service the Energy per Bit per Noise density E B /N O required to achieve a desired Bit Error Rate;for each E B /N O deriving a value of the Energy per coded Symbol per Noise density E S /N O ;and from the E S /N O deriving a rate matching factor by which that E S /N O can be matched to the minimum Energy per coded Symbol per Noise density applicable to said one channel.
2
A method according to Claim 1 comprising the initial step of generating for each service a look up table containing the value of E B /N O required for each spreading factor used and for every environment likely to be encountered.
3
A method according to Claim 2 in which the look up table is stored in the physical layer of the UMTS.
5
A method according to Claim 4 comprising performing the derivations of semi static rate matching factor and spreading factor in the Radio Resource Control of the UMTS;transmitting the values to the physical layer of the UMTS;and in the physical layer performing puncturing or repetition in accordance with the transmitted values and the values in the look up table.
6
A method according to Claim 4 or Claim 5 in which the rate matching factor is derived by generating a semi static rate matching factor for each service and multiplying the semi static rate matching factor by a dynamic rate matching factor which is equal for all services to be multiplexed.
7
A method according to Claim 6 in which the semi static rate matching factor is normalised by division by the coding gain associated with said factor which gain is limited to greater than - 1 dB.
8
A method according to Claim 7 in which the semi static rate matching factor and the spreading factor for each service are derived by estimating an initial spreading factor dependent on the number of bits per frame being greater than the sum of the data rates for all services to be multiplexed;comparing the initial spreading factor with said look up table of values of E S /N O for each service and for all likely environments and levels of coding to determine the appropriate set of E S /N O .
9
A method according to Claim 4 or Claim 5 in which the rate matching factor is derived by setting the E S /N O of the Coded Composite Transport Channel equal to the E S /N O of a service times the inverse of the rate matching factor.
10
A method according to Claim 4 or Claim 5 in which the rate matching factor is derived by setting the E S /N O of a service equal to the Quality of Service after channel coding of that service times the inverse of the rate matching factor.
11
A UMTS comprising a UMTS core network;a plurality of Base Station Controllers;associated with each BSC a plurality of Base Transmission Systems;and associatable with each BTS a plurality of mobiles, characterised by every mobile comprising storage means to store a look up table of the number of bits for rate matching required for each service and environment likely to be encountered for each value of E B /N O ;and each BSC comprising means to transmit to each mobile and to each BTS values of spreading factor and semi static rate matching factor for a combination of services to be multiplexed in one channel to or from that mobile.

45 paragraphs, as filed

0001This invention relates to a Universal Mobile Telephone System (UMTS) network and more especially to a method of calculating the number of bits to be punctured or repeated to achieve effective rate matching.

0002In a UMTS system, the technique of time multiplexing is used to combine different services required by one user. The services have different Quality of Service (QoS) requirements, such as signal power with respect to noise and interference power, and latency restrictions which lead to different requirements of transmission power; transmission power must therefore be adjusted so that in any one transmission channel the QoS is maintained for the service making the highest demand, but simultaneously transmission power is minimised.

0003To achieve this, and also to adapt the symbol data rate to the physical channel data rate, the method of rate matching is used, ie, some bits are punctured or repeated. The principle of rate matching is described by the Ericsson company in the paper "Description of Rate Matching in UTRA/FDD," TDoc SMG2 UMTS L1 235/98 and by the Nokia company in the paper "Mapping Rule for semi static rate matching," TDoc SMG2 UMTS L1 476/98. The publication by Nokia also proposes a method of deriving the number of bits to be punctured or repeated to achieve the required QoS for two different services by interpolation methods. However, interpolation cannot be applied to more than two services, which is a substantial limitation on the network and also the algorithm is complex.

0004According to the invention, in a UMTS network in which a plurality of services of a single user having different transmission power requirements are multiplexed in one channel and the technique of rate matching is applied, a method of determining for each service the number of bits to be punctured or repeated characterised by the steps of <ul id="ul0001" list-style="none"><li>deriving for each service the Energy per Bit per Noise density EB/NO required to achieve a desired Bit Error Rate;</li><li>from each EB/NO deriving a value of the Energy per coded Symbol per Noise density ES/NO;</li><li>and from ES/NO deriving a rate matching factor by which that ES/NO can be matched to the minimum Energy per coded Symbol per Noise density applicable to said one channel.</li></ul>

0005The invention will now be described by way of example only with reference to the accompanying drawings in which:- <ul id="ul0002" list-style="none"><li>Figure 1 is a schematic view of a UMTS network at network level;</li><li>Figure 2 shows the conventional steps in UMTS transport channel multiplexing for the uplink;</li><li>Figure 3 shows rate matching gain;</li><li>Figure 4 shows the major steps in a first example of a method according to the invention; and</li><li>Figure 5 shows a relationship between channel coding and rate matching in a second example of a method according to the invention.</li></ul>

0006In Figure 1, a UMTS network 10 comprises a number of mobile users 12, 14 each connectable to a base station BTS/Node B 16. The BTS 16 is connected through a Base Station Controller BSC 18 in a Radio Network Controller (RNC) 20 to a Mobile Switching Controller (MSC) 21 in the UMTS Core Network (CN) 22. The CN 22 provides connections to the public switched telephone network PSTN 24, integrated services digital network ISDN 26 and the internet 28.

0007The Radio Access Network (RAN) comprises the mobile users 12, 14 and the BTS 16. To multiplex signals in the RAN in the uplink direction (from the mobile 12,14 to the BTS 16), the arrangement of Figure 2 is used; the steps are performed in the appropriate mobile 12 or. Figure 2 shows transport channel multiplexing for the uplink and is taken from the standard TS 25.212 V1.1.0 (1999-06).

0008In Figure 2, the steps to encode services with identical QoS requirements are shown within box 30, and identical steps to encode a set of different services are performed within box 31 (steps not shown). The steps comprise Cyclic Redundancy Coding (CRC) steps 40 for identical services, (but in this invention a single service at step 40 is considered), a first multiplexing step 41, channel coding step 42, first interleaving step 43. radio frame segmentation step 44 and rate matching step 45.

0009The equivalent rate matching step 55 is shown in box 31.

0010The outputs of the two boxes 30, 31 are combined in a second multiplexing step 60 followed by a physical channel segmentation step 61, second interleaving step 62, and physical channel mapping step 63; the outputs are then provided to respective Dedicated Physical Data Channels DPDCH 64.

0011The reverse steps are performed for uplink de-multiplexing at the BTS 16.

0012This entire procedure exists also in the downlink direction, ie from the BTS 16 to a mobile 12 or 14.

0013While the rate matching steps 45. 55 are indicated as separate, they are in fact interrelated because rate matching is based on the relative QoS requirements of different sets of services, and because the channel must be able to support the combined rate matching output of all services, and this interrelationship is indicated at 56 but, as stated above, the interrelationship has previously been specified only for rate matching of two services by interpolation.

0014By application of the method of the invention, rate matching of more than two different services is achievable.

0015In the rate matching steps 45, 55, a set of puncturing or repetition factors is determined based on the requirements that:- <ul id="ul0003" list-style="none"><li>a) desired transmission quality requirements of each transport channel is fulfilled and not significantly exceeded. This means that required transmission power to meet quality requirements for all transport channels is as low as possible.</li><li>b) on the uplink, the total bit rate after transport channel multiplexing is identical to the total channel bit rate of the dedicated physical channels allocated.</li><li>c) on uplink and downlink, the total allocated code resource should be minimised.</li><li>d) the puncturing factors should not exceed a certain maximum puncturing factor, specific for each transport channel.</li></ul>

0016In the current UMTS concept there are two types of rate matching specified: <ul id="ul0004" list-style="none"><li>(i) Semi-static Rate Matching: this is used to balance the transmission power requirements of different services, which are multiplexed to one Common Composite Traffic Channel (CCTrCH). This function is also known as 'ES/NO-balancing' - balancing the ratio of symbol energy to noise density. Because the elements related to service multiplexing are decided by the Radio Resource Control (RRC) layer, this physical layer function is controlled by RRC via the semi-static part of TFCI.</li><li>(ii) Dynamic Rate Matching: this is used in the uplink to adapt the symbol data rate to the data rate of the CCTrCH in order to preserve continuous transmission. It is an autonomous function of the physical layer. Dynamic rate matching is performed through discontinuous transmission (DTX) in the downlink.</li></ul>

0017In a single channel, several services (as indicated by boxes 30, 31) must be multiplexed which have different bit rates and different types of coding. For example a low rate video using 144 kbps and turbo coding; a voice service at 13kbps using convolutional coding, plus signalling information, also using convolutional coding.

0018Each service will have a QoS requirement, and an important part of that requirement is the Energy per Bit per Noise Density EB/NO required to achieve the desired Bit Error Rate BER. The EB/NO for a service will apply only to specific measurement conditions, such as the environment (pedestrian, indoor, vehicular etc). the level and type of coding (turbo, conventional), the level of physical layer control signalling (Dedicated Physical Control Channel DPCCH overhead) and the spreading factor. Conventionally, the requirements have been calculated by simulation or by measurement of a service in a particular environment.

0019When services having different EB/NO requirements are to be multiplexed, certain differences can be adjusted by comparing EB/NO requirements; eg, the DPCCH consists of pilot symbols, power control and Transport Format Combination Indicator (TFCI) symbols only, with the amount of energy required being relatively independent of the service and dependent only on environment. Also, most UMTS services use rate 1/3 coding schemes with similar levels of extra overhead such as tail bits. Adjustment of power is therefore relatively easy.

0020Other differences cannot be derived from EB/NO values. For example, when services are multiplexed, the Coded Composite Transport Channel CCTrCH will use a spreading factor which is different to the spreading factor that each service would use individually, and variations may be wide. A voice service normally uses a spreading factor of 128 and could be mapped onto a CCTrCH using a spreading factor of 4, when sent together with other services.

0021The method of the invention solves this problem.

0022In the invention, a look up table of EB/NO is created; EB/NO is expressed as Energy per coded Signal versus noise density, ie ES/NO. It must be understood that EB/NO is not the bit energy when the data is uncoded, but is the equivalent energy per bit assuming a certain coding scheme, spreading factor and environment. Therefore for every value of EB/NO there is a unique value ES/NO which in this context does not include the DPCCH overhead.

0023Using the ES/NO value for each service I, (ES/NO)i, a required level of semi-stactic rate matching can be calculated. Since it is impossible for the ES/NO for the CCTrCH to satisfy the (ES/NO)I, rate matching is needed, such that each service achieves its desired (ES/NO)i.

0024The ES/NO for the CCTrCH is set as E'S/NO, which is likely to equal the ES/NO for one of the constituent services; all other services are therefore forced to use semi-static rate matching. In some circumstances however the E'S/NO does not equal the ES/NO for a constituent service, in which case all services will be required to use rate matching. The relationship between (ES/NO)n and E'S/NO is given by<maths id="math0001"><img file="EP1069798A1_D0001.tif" /></maths> In order to be satisfied with E'S/NO, the service must use a semi static rate matching factor, SRFi, of<maths id="math0002"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">SRF</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext> = </mtext><mfrac><mrow><msub><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext mathvariant="italic">R,i</mtext></mrow></msub></mrow><mrow><msub><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext mathvariant="italic">S,i</mtext></mrow></msub><mtext mathvariant="italic">·G</mtext><mtext>(</mtext><msub><mrow><mtext mathvariant="italic">SRF</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></msub><mtext>)</mtext></mrow></mfrac><mtext>,</mtext></mrow></math><img file="EP1069798A1_D0002.tif" /></maths> where <ul id="ul0005" list-style="none" compact="compact"><li>NR,i is the number of coded symbols after semi static rate matching</li><li>NS,i is the number of code symbols before rate matching,</li></ul> and G(SRFi), illustrated in Figure 3, is the coding gain associated with the level of semi-static rate matching.

0025Thus any service i must use a semi-static matching factor SRFi.

0026Generally, it can be assumed that adjusting the energy by adding extra symbols is equivalent to adjusting the ES/NO. Therefore if SRFi is limited to greater than -1 dB, G(SRFi) is 1 (0dB). However, puncturing alters the coding scheme used, which results in a loss greater than the decrease in energy. Moreover, repetition may result in extra time diversity, thereby providing coding gain beyond the increase in energy. Repeating some of the bits in a transport block may not be equivalent to increasing the energy of all of the bits. Finally, the gain achieved by repetition depends on the combining method implemented.

0027An additional requirements is that the semi-static rate matched transport block (on leaving box 30 or box 31 in Figure 2) must fit into a physical channel having bits per frame NFrame. One time frame is 10 milliseconds, and contains NS symbol bits where <chemistry id="chem0001" num="0001"><img file="EP1069798A1_D0003.tif" /></chemistry> where m=1 for single code transmission, and m is greater than 1 for multicode transition, ie where more than one DPDCH is assigned to one CCTrCH, as in the method according to the invention.

0028In the uplink the number of data bits Ndata of one DPDCH in a time slot (0.625 ms) is simply given by Ndata = 10·2k, k = 0...6. In the downlink, due to time multiplex of DPDCH and DPCCH it is given by Ndata =20·2k-Npilot-NTPC-NTFCI, k = 0...6. The spreading factor of the related DPCH in uplink and downlink is SF = 256/2k, thus it may range from 256 down to 4 . The rate matching factor RFi is given by the product of the dynamic rate matching factor DRF and the semi static rate matching factor SFRi by RFi = DRF · SFRi. The dynamic rate matching factor DRF is equal for all multiplexed services, but the semi static rate matching factor SFRi depends on the service. Two basic conditions must be fulfilled by the rate matching principle:<maths id="math0003"><img file="EP1069798A1_D0004.tif" /></maths><maths id="math0004"><img file="EP1069798A1_D0005.tif" /></maths> where E"S/NO is the ES/NO set point for the CCTrCH. (Through dynamic rate matching each service will achieve its individual target of (ES/NO)i) n is the number of services multiplexed onto the CCTrCH. In the downlink, DRF is set to 1. Discontinuous transmission (DTX) is used instead of dynamic rate matching. DTX means that when Nframe > Ntotal, the difference in the number of bits is simply not transmitted. Hence Ntotal is simply the sum of all NRi, as defined for semi-static rate matching. Therefore, generally E"S/NO = E'S/NO in the downlink. However, if Ntotal is just slightly larger than Nframe it is possible to set DRF to between 0.8 and 1.0. thereby applying puncturing instead of DTX to adjust the CCTrCH rate. This method avoids using the next lower spreading factor and the resulting high level of repetition. In the uplink, Nframe must be equal to Ntotal, since DTX cannot be used. Therefore, DRF is defined by equations 2 and 3, as well as:<maths id="math0005"><math display="block"><mrow><msub><mrow><mtext mathvariant="italic">N</mtext></mrow><mrow><mtext mathvariant="italic">frame</mtext></mrow></msub><msub><mrow><mtext mathvariant="italic"> = N</mtext></mrow><mrow><mtext mathvariant="italic">total</mtext></mrow></msub></mrow></math><img file="EP1069798A1_D0006.tif" /></maths>

0029Figure 4 indicates five major steps of the method according to the invention; as indicated, steps 1, 2 and 3 are performed in the BSC (reference 18 in Figure 2) while steps 4 and 5 are performed in the BTS 16 and mobiles 12, 14. <dl id="dl0001"><dt>Step 1:</dt><dd>In step 1, Inputs to the rate matching algorithm are the values (ES/N0)i which are determined for each specific service and the number of data bits which is explicitly given by the data rate NSi.</dd><dt>Step 2:</dt><dd>During this step the rate matching factors, SRFi and DRFi, are calculated (equations 1 and 3). First an initial spreading factor (SF) estimate is chosen based such that<maths id="math0006"><img file="EP1069798A1_D0007.tif" /></maths> Using this initial estimate for SF, the set of (ES/NO)i are identified from the look up table for the relevant environment and level of coding. Ntotal is calculated . If Nframe < 0.8·Ntotal, the value of SF is too large and Step 2 is performed again using the new value for the spreading factor of SFnew = SF/2.</dd><dt>Step 3:</dt><dd>The outputs from the RRC part of algorithm are the semi static rate matching factors for each DCH, which are element of the semi-static part of TFCI and the spreading factors for each service combination, which may be part of the dynamic part of the TFCI. The TFCI is used to inform the physical layer of both, the mobiles 12, 14 and the NodeB 16, what physical transmission parameter has to be chosen.</dd><dt>Step 4:</dt><dd>This is the first step of the execution part of the rate matching algorithm. Only the TFCI is necessary to derive all other parameters for rate matching. The dynamic rate matching factor is automatically given by knowing the semi static rate matching factor for a certain service combination. An example is given in the paper by Mitsubishi Electric and Siemens: "Determination of Rate Matching Parameters for Service Multiplexing," Tdoc 3GPP TSG-RAN WG1 710/99. Now the rate matching factor for each service is calculated by RFi = DRF · SRFi. From this, the number of punctured / repeated bits is simply NRMi = (RFi-1) · Ncodi.</dd><dt>Step 5:</dt><dd>The last step performs puncturing / repetition of the bits using the value of NRMi. Several techniques can be applied and an example is given in the paper by Philips "Service Multiplexing," TDoc SMG2 UMTS L1 229/98.</dd></dl>

0030Advantages of the method according to the invention are that the final calculation of the number of bits to be repeated or punctured, and the puncturing or repetition themselves, are carried out in the physical layer in an autonomous arrangement; that the semi-static rate matching is explicitly given; and that the method derives a spreading factor for each service combination for use by the dynamic part of the TFCI. The last two advantages are in contrast to the proposal by the Nokia company (reference above) in which the TFCI elements are not explicitly given but must be calculated separately from the number of bits.

0031Overall, the method of the invention leads to a significant decrease in transmitted power and hence an improvement in overall system capacity.

Example

0032In the following example, three services are multiplexed for a user in a vehicle. In the downlink a spreading factor of 4 is selected resulting in CCTrCH rate of 512ksps. The services are as follows:- <ul id="ul0006" list-style="none" compact="compact"><li>144 kbps low rate video, using turbo coding, requiring ES/NO = 5 dB.</li><li>13 kbps voice, using convolutional coding, requiring ES/NO = 8 dB.</li><li>Signalling information, using convolutional coding, requiring ES/NO = 9 dB.</li><li>E'S/NO = 5 dB, hence rate matching is required by each service to achieve the desired (ES/NO)i is:</li><li>video: 0dB</li><li>voice: 3 dB</li><li>signalling: 4 dB.</li></ul>

0033This is shown in table 1, under the rate matching row. There is no Dynamic rate matching, Discontinuous transmission is used to match Tframe and Ttotal. <tables id="tabl0001" num="0001"><img file="EP1069798A1_D0008.tif" /></tables>

0034In the uplink a spreading factor of 4 was chosen resulting in a CCTrCH rate of 1024 ksps. The services are defined by: <ul id="ul0007" list-style="none" compact="compact"><li>144 kbps low rate video, using turbo coding, requiring ES/NO = 4 dB.</li><li>13 kbps voice, using convolutional coding, requiring ES/NO = 7 dB.</li><li>Signalling information, using convolutional coding, requiring ES/NO = 8 dB.</li><li>If E'S/NO = 4 dB, then the rate matching is required by each service to achieve the desired (ES/NO)i is:</li><li>video: 0 dB voice: 3 dB signalling: 4 dB.</li></ul> This is shown in table 2, under the rate matching row. Additionally, dynamic rate matching is used to match Tframe and Ttotal resulting is a further gain due to repetition of 1.7 dB. Hence E"S/NO = E'S/NO - 1.7 = 2.3 dB. The number will vary slightly in tables 1 and 2 in order to achieve number of bits that agree with realistic interleaver size; interleaver sizes must be divisible by the number of slots. <tables id="tabl0002" num="0002"><img file="EP1069798A1_D0009.tif" /></tables>

Second Method

0035In an alternative approach to the channel coding and rate matching required to multiplex several services, the arrangement shown in Figure 5 is used; in a small variation to Figure 4, the inputs at Step 1 in the BSC 18 are values of Eb/NO for each service and the number of bits in one time frame, Nbiti; the current data rate is RB = Nbiti · 10 ms.

0036(EB/No)i indicates a QoS of service i which is handled by the BSC 18. After the channel coding step, which is specific to the service i and is described by the coding factor (coding gain) CFi, when the number of coded bits Ncodi = Nbiti · CFi

0037This value is the input to a rate matching step, the output of which is (ES/NO)i, the QoS after the coding and rate matching, and the number of symbols NSi = Ncodi · RFi

0038This second method depends on the assumption<maths id="math0007"><img file="EP1069798A1_D0010.tif" /></maths> Eq. (4) may be rewritten using the coding factor CFi and the rate matching factor RFi(cf. eq.(5)). The number of repeated / punctured bits is simply given by NRMi = NSi - Ncodi = (RFi-1) · Ncodi. Depending on the rate matching factor RFi there are three possibilities: <ul id="ul0008" list-style="bullet" compact="compact"><li>Repetition: RFi > 1, i.e. NSi > Ncodi, NRMi > 0</li><li>Puncturing: RFi < 1, i.e. NSi < Ncodi, NRMi < 0</li><li>No rate matching: RFi = 1, i.e. NSi = Ncodi, NRMi = 0</li></ul> The linear approximation in eq. (4) is only valid if the puncturing does not exceed a certain ratio. Currently, in ETSI there is the working assumption, that puncturing should not exceed 20%, i.e. RFi ≥ 0.8! The rate matching factor RFi is given by the product of the dynamic rate matching factor DRF and the semi static rate matching tractor SFRi by RFi = DRF . SFRi. The dynamic rate matching factor DRF is equal for all multiplexed services, and the semi static rate matching factor SFRi depends on the service. Two basic conditions must be fulfilled by the rate matching principle: <chemistry id="chem0002" num="0002"><img file="EP1069798A1_D0011.tif" /></chemistry><chemistry id="chem0003" num="0003"><img file="EP1069798A1_D0012.tif" /></chemistry> The number of symbol bits in one time frame (10 ms) is derived by <chemistry id="chem0004" num="0004"><img file="EP1069798A1_D0013.tif" /></chemistry> The value of m > 1 is used for multi-code transmission, i.e. more than one DPDCH is assigned to one CCTrCH. Single code transmission is described by m = 1. In the uplink the number of data bits Ndata of one DPDCH in a time slot (0.625 ms) is simply given by Ndata = 10·2k, k = 0...6. In the downlink, due to time multiplex of DPDCH and DPCCH it is given by Ndata = 20·2k-Npilot-NTPC-NTFCI, k = 0...6. The spreading factor of the related DPCH in uplink and downlink is SF = 256/2k, thus it may range from 256 down to 4.

0039With this approach and referring once more to Figure 4, after the slightly different inputs to Step 1, as explained above, Step 2 is different in that the rate matching factors are calculated as follows:- <dl id="dl0002"><dt>Step 2:</dt><dd>First, the following transformation is performed (cf. eq.4): (Ecod/N0)i = (EB/N0)i/CFi. Then a service i=i0 with certain (Ecod/N0)i0 requirement is chosen as reference, which has a semi static rate matching factor SRFi0 = 1. From this all semi static rate matching factors for the remaining services can be derived by SRFi = (Ecod/N0)i0/(Ecod/N0)i, i ≠ i0. Such factors do not depend on the currently used data rates, they are a function of EB/N0-requirement and the coding method. Thus, they are part of the semi-static part of the TFCI. Next, each service combination is taken into account. The spreading factor SF which is explicitly given by the number of symbol bits NS must be chosen for each combination of data bits Nbiti according to<maths id="math0008"><img file="EP1069798A1_D0014.tif" /></maths> RFmin/SRFmin, RFmin = 0.8). Because NS and hence SF depends on the currently used data rate, the spreading factor SF may be an element of the dynamic part of TFCI.</dd><dt>Step 3</dt><dd>is identical to that performed in the first method according to the invention.</dd><dt>Step 4</dt><dd>The dynamic rate matching factor is automatically given by<maths id="math0009"><img file="EP1069798A1_D0015.tif" /></maths> for a certain service combination. Note: Nbiti is element of the dynamic part of TFCI (transport block set size), NS is given by SF and CFi comes from the used coding scheme. Now the rate matching factor for each service is calculated by RFi = DRF·SRFi. From this, the number of punctured / repeated bits is simply NRMi = (RFi-1) · Ncodi.</dd><dt>Step 5</dt><dd>is identical to the first method.</dd></dl>

Example 2

0040In the following example of the second method according to the invention, a combination of 2 services assumed with the following parameters:- • DCH1 : LCD data service with EB/N0 = 5dB, 1/3 conv. coding + 8/9 Reed Solomon (e.g. video) • DCH2: UDD data service with EB/N0 = 3dB, 1/3 conv. coding (e.g. packet data) The following three service combinations are permitted: {DCH1, DCH2}={144/32, 64/64, 64/32} kBit/s. In table 3Error! Reference source not found, the result for the semi static rate matching is shown. For illustration the values are given logarithmic in dB. <tables id="tabl0003" num="0003"><table frame="all"><title>Table 3:</title><tgroup cols="4" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="39.37mm" /><colspec colnum="2" colname="col2" colwidth="39.37mm" /><colspec colnum="3" colname="col3" colwidth="39.37mm" /><colspec colnum="4" colname="col4" colwidth="39.37mm" /><thead valign="top"><row rowsep="1"><entry namest="col1" nameend="col4" align="center">Determination of the semi static rate matching factor</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" /><entry namest="col2" nameend="col2" align="center">DCH1: LDD-service</entry><entry namest="col3" nameend="col3" align="center">DCH2: UDD-service</entry><entry namest="col4" nameend="col4" rowsep="0" align="center">Comments</entry></row><row><entry namest="col1" nameend="col1" align="center">EB/N0</entry><entry namest="col2" nameend="col2" align="center">5 dB</entry><entry namest="col3" nameend="col3" align="center">3 dB</entry><entry namest="col4" nameend="col4" /></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="center">coding factor</entry><entry namest="col2" nameend="col2" align="center">5.2827 dB (27/8)</entry><entry namest="col3" nameend="col3" align="center">4.7712 dB (3/1)</entry><entry namest="col4" nameend="col4" align="center">CFdB = 10log10(CF)</entry></row><row><entry namest="col1" nameend="col1" align="center">Ecod/N0</entry><entry namest="col2" nameend="col2" align="center">-0.2827 dB</entry><entry namest="col3" nameend="col3" align="center">-1.7712 dB</entry><entry namest="col4" nameend="col4" align="center">ΔEcod/N0 = 1.4885 dB</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="center">SRFi</entry><entry namest="col2" nameend="col2" align="center">1.4088</entry><entry namest="col3" nameend="col3" align="center">1</entry><entry namest="col4" nameend="col4" align="center">SRF = 10(ΔEcod/N0)/10</entry></row></tbody></tgroup></table></tables> In the current example, the service with the highest requirement on Ecod/N0 was chosen for reference. It will be evident, that with the proposed rate matching algorithm at least this service needs no semi static rate matching. Table 4 shows the results for the dynamic part of the rate matching for the different assumed service combinations and the calculated number of bits. <tables id="tabl0004" num="0004"><table frame="all"><title>Table 4:</title><tgroup cols="4" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="39.37mm" /><colspec colnum="2" colname="col2" colwidth="39.37mm" /><colspec colnum="3" colname="col3" colwidth="39.37mm" /><colspec colnum="4" colname="col4" colwidth="39.37mm" /><thead valign="top"><row rowsep="1"><entry namest="col1" nameend="col4" align="center">Dynamic Rate Matching for different Service Combinations</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" /><entry namest="col2" nameend="col2" align="center">DCH1: LDD-service</entry><entry namest="col3" nameend="col3" align="center">DCH2: UDD-service</entry><entry namest="col4" nameend="col4" align="center">Comments</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="center">144/32 Nbiti</entry><entry namest="col2" nameend="col2" align="center">1440</entry><entry namest="col3" nameend="col3" align="center">336 (16 bit MAC)</entry><entry namest="col4" nameend="col4" align="center">TB set size</entry></row><row><entry namest="col1" nameend="col1" align="center">Ncodi</entry><entry namest="col2" nameend="col2" align="center">4860</entry><entry namest="col3" nameend="col3" align="center">1008</entry><entry namest="col4" nameend="col4" morerows="1" align="center">NS = 10240, SF = 4 DRF = 1.3037</entry></row><row><entry namest="col1" nameend="col1" align="center">Nsixteenths</entry><entry namest="col2" nameend="col2" align="center">8926</entry><entry namest="col3" nameend="col3" align="center">1314</entry></row><row><entry namest="col1" nameend="col1" align="center">ES/N0</entry><entry namest="col2" nameend="col2" align="center">-2.9230</entry><entry namest="col3" nameend="col3" align="center">-2.9230</entry><entry namest="col4" nameend="col4" morerows="1" align="center">ΔES/N0 = 0.222 dB</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="center">ES/N0 w/o RM</entry><entry namest="col2" nameend="col2" align="center">-2.7008</entry><entry namest="col3" nameend="col3" align="center">-4.1893</entry></row><row><entry namest="col1" nameend="col1" align="center">64/64 Nbiti</entry><entry namest="col2" nameend="col2" align="center">640</entry><entry namest="col3" nameend="col3" align="center">772 (32 bit MAC)</entry><entry namest="col4" nameend="col4" align="center">TB set size</entry></row><row><entry namest="col1" nameend="col1" align="center">Ncodi</entry><entry namest="col2" nameend="col2" align="center">2160</entry><entry namest="col3" nameend="col3" align="center">2016</entry><entry namest="col4" nameend="col4" morerows="1" align="center">Ns = 5120, SF = 8 DRF = 1.0121</entry></row><row><entry namest="col1" nameend="col1" align="center">Nsixteenths</entry><entry namest="col2" nameend="col2" align="center">3080</entry><entry namest="col3" nameend="col3" align="center">2040</entry></row><row><entry namest="col1" nameend="col1" align="center">ES/N0</entry><entry namest="col2" nameend="col2" align="center">-1.8234</entry><entry namest="col3" nameend="col3" align="center">-1.8234</entry><entry namest="col4" nameend="col4" morerows="1" align="center">ΔES/N0 = 0.6556 dB</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="center">ES/N0 w/o RM</entry><entry namest="col2" nameend="col2" align="center">-1.1678</entry><entry namest="col3" nameend="col3" align="center">-2.6563</entry></row><row><entry namest="col1" nameend="col1" align="center">64/32 Nbiti</entry><entry namest="col2" nameend="col2" align="center">640</entry><entry namest="col3" nameend="col3" align="center">336 (16 bit MAC)</entry><entry namest="col4" nameend="col4" align="center">TB set size</entry></row><row><entry namest="col1" nameend="col1" align="center">Ncodi</entry><entry namest="col2" nameend="col2" align="center">2160</entry><entry namest="col3" nameend="col3" align="center">1008</entry><entry namest="col4" nameend="col4" morerows="1" align="center">NS=5120, SF=8 DRF = 1.2639</entry></row><row><entry namest="col1" nameend="col1" align="center">Nsixteenths</entry><entry namest="col2" nameend="col2" align="center">3846</entry><entry namest="col3" nameend="col3" align="center">1274</entry></row><row><entry namest="col1" nameend="col1" align="center">ES/N0</entry><entry namest="col2" nameend="col2" align="center">-2.7883</entry><entry namest="col3" nameend="col3" align="center">-2.7883</entry><entry namest="col4" nameend="col4" morerows="1" align="center">ΔES/N0 = 0.4208 dB</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="center">ES/N0 w/o RM</entry><entry namest="col2" nameend="col2" align="center">-2.3675</entry><entry namest="col3" nameend="col3" align="center">-3.8560</entry></row></tbody></tgroup></table></tables>

0041The number of data bits for the LDD service is simply given by its data rate i.e. NbitLDD = RbitLDD · 10ms. For the UDD service an additional MAC header for e.g. adressing purposes of 16 bits is assumed, i.e. NbitUDD = RbitUDD · 10ms + 16 bit. In the example, this bit numbers are equal to the transport block set size. Because the uplink is considered, the number of available symbol bits is simply given by NS = 40960/SF. The value of ΔES/N0 describes the improvement in ES/N0 by use of the proposed rate matching method compared to missing it. The description of the specified service combinations is as follows: <ul id="ul0009" list-style="bullet" compact="compact"><li>LDD144/UDD32: The sum of all coded data bits including semi static rate matching is <chemistry id="chem0005" num="0005"><img file="EP1069798A1_D0016.tif" /></chemistry> DRFmin = 0.8 (SFRmin = 1). The next lowest symbol rate would be NS = 5120, i.e. SF = 8. According to eq. 6 a DRF < 0.8 would be necessary. Thus, the next highest SF = 4 is chosen with NS = 10240. The other results can be found in table 4. Using this constellation an improvement in ES/N0 of ΔES/N0 = 0.222 dB can be achieved. Since the transmission power is directly related to ES/N0 this leads to a decrease of the transmission power of 0.222 dB, too.</li><li>LDD64/UDD64: Here,<maths id="math0010"><img file="EP1069798A1_D0017.tif" /></maths> Thus, SF = 8 is chosen with NS = 5120. For this service combination, an improvement of ΔES/N0 = 0.6556 dB can be achieved.</li><li>LDD64/UDD32: For the last examined service combination<maths id="math0011"><img file="EP1069798A1_D0018.tif" /></maths> As in the previous case SF = 8 is chosen with NS = 5120. Now the improvement is ΔES/N0 = 0.4208 dB.</li></ul>

0042The second example has many of the advantages of the first method according to the invention.

Every citation, both ways

Citations
Document	Relation	Office	Category	Cited during	Relevant claims
US7436806B2	Cited by	United States of America	–	Applicant	–
EP1211858A2	Cited by	European Patent Office (EPO)	–	Search report	–
US7792085B2	Cited by	United States of America	–	Applicant	–
EP1675428A2	Cited by	European Patent Office (EPO)	–	Search report	–
USRE43866E	Cited by	United States of America	–	Applicant	–
US7031732B2	Cited by	United States of America	–	Applicant	–
EP2068594A1	Cited by	European Patent Office (EPO)	–	Search report	–
WO2004004174A1	Cited by	World Intellectual Property Organization (WIPO)	–	Applicant	–
WO03024049A1	Cited by	World Intellectual Property Organization (WIPO)	–	International search	–
EP1102440A3	Cited by	European Patent Office (EPO)	–	Search report	–
EP1102440A2	Cited by	European Patent Office (EPO)	–	Search report	–
EP2134038A3	Cited by	European Patent Office (EPO)	–	Search report	–
USRE43866E1	Cited by	United States of America	–	Applicant	–
US8064525B2	Cited by	United States of America	–	Applicant	–
EP1491027A4	Cited by	European Patent Office (EPO)	–	Search report	–
US6934550B2	Cited by	United States of America	–	Applicant	–
FR2872670A1	Cited by	France	–	Search report	–
US7986955B2	Cited by	United States of America	–	Applicant	–
EP1259017A2	Cited by	European Patent Office (EPO)	–	Examiner	–
US7724699B2	Cited by	United States of America	–	Applicant	–
EP1211858A3	Cited by	European Patent Office (EPO)	–	Search report	–
US7228144B2	Cited by	United States of America	–	Applicant	–
WO2004004174A1	Cited by	World Intellectual Property Organization (WIPO)	–	International search	–
US7346646B1	Cited by	United States of America	–	Search report	–
EP2134038A2	Cited by	European Patent Office (EPO)	–	Search report	–
EP1675428A3	Cited by	European Patent Office (EPO)	–	Search report	–
WO2006004189A1	Cited by	World Intellectual Property Organization (WIPO)	–	International search	–
US7376105B2	Cited by	United States of America	–	Applicant	–
FR2855686A1	Cited by	France	–	Search report	–
EP1491027A2	Cited by	European Patent Office (EPO)	–	Search report	–
EP0627827A2	Cites	European Patent Office (EPO)	A	Search report	1-11
US5309474A	Cites	United States of America	A	Search report	1-11
US5581575A	Cites	United States of America	A	Search report	1-11
US5822318A	Cites	United States of America	A	Search report	1-11
US5909434A	Cites	United States of America	A	Search report	1,5
US5909434A	Cites	United States of America	A	Search report	1,5
BERRUTO E ET AL: "VARIABLE-RATE FOR THE BASIC SPEECH SERVICE IN UMTS", PROCEEDINGS OF THE VEHICULAR TECHNOLOGY CONFERENCE,US,NEW YORK, IEEE, vol. CONF. 43, 1993, pages 520-523, XP000393235, ISBN: 0-7803-1267-8	Non-patent	–	–	Search report	–
FRENGER P ET AL: "RATE MATCHING IN MULTICHANNEL SYSTEMS USING RCPC-CODES", IEEE VEHICULAR TECHNOLOGY CONFERENCE,US,NEW YORK, IEEE, vol. CONF. 47, pages 354-357, XP000701819, ISBN: 0-7803-3660-7	Non-patent	–	–	Search report	–

7 members in 4 offices; this record represents the family

This recordMember, by publication date

Members7

Family members, oldest first
Document	Office	Kind
EP1069798A1This record	European Patent Office (EPO)	A1	2001-01-17
US6788657B1	United States of America	B1	2004-09-07
EP1069798B1	European Patent Office (EPO)	B1	2008-04-16
AT392786T	Austria	T	2008-05-15
ATE392786T1	Austria	T1	2008-05-15
DE69938546D1	Germany	D1	2008-05-29
DE69938546T2	Germany	T2	2009-08-20

58 legal events, as 6 offices reported them to INPADOC

Over the term

Point at a mark for the event

Events

Legal events, newest first
	Event	Code	Office
2019-12-31	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2019-07-31	Patent expired after termination of 20 yearsExpiredPE20	PE20	GB
2019-07-12	Expiry of rightR071	R071	DE
2019-05-09	Change of applicant/patenteeR081	R081	DE
2019-05-09	Change of applicant/patenteeR081	R081	DE
2019-05-07	Change of applicant/patenteeR081	R081	DE
2019-04-30	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2019-02-27	Amendments to the register in respect of changes of name or changes affecting rights (sect. 32/1977)REGISTERED BETWEEN 20190131 AND 20190206732E	732E	GB
2018-11-30	Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP	PGFP	EP
2018-10-31	Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP	PGFP	EP
2017-10-31	Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP	PGFP	EP
2017-07-24	Fee paymentPLFP	PLFP	FR
2016-07-21	Fee paymentPLFP	PLFP	FR
2015-06-26	Fee paymentPLFP	PLFP	FR
2014-11-21	Lien (pledge) cancelledRG	RG	FR
2014-05-16	Lien (pledge) constitutedGC	GC	FR
2013-12-27	Change of name or company nameCD	CD	FR
2013-12-18	Amendments to the register in respect of changes of name or changes affecting rights (sect. 32/1977)REGISTERED BETWEEN 20131121 AND 20131127732E	732E	GB
2011-08-25	Amendment of ipc main classPREVIOUS MAIN CLASS: H04Q0007380000R079	R079	DE
2011-08-25	Amendment of ipc main classPREVIOUS MAIN CLASS: H04W0028180000R079	R079	DE
2010-10-29	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2010-06-30	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2009-09-30	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2009-08-31	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2009-07-31	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2009-06-30	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2009-06-30	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2009-03-31	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2009-03-25	No opposition filedOpposition26N	26N	EP
2009-02-27	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2009-02-27	Patent ceasedCeasedPL	PL	CH
2009-02-20	No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE	PLBE	EP
2009-02-20	Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA	STAA	EP
2009-01-30	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2009-01-30	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2008-11-28	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2008-11-21	Fr: translation filedET	ET	EP
2008-10-31	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2008-10-31	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2008-10-31	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2008-10-31	Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25	PG25	EP
2008-10-01	Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents actLapsedNLV1	NLV1	EP
2008-05-29	Corresponds to:REF	REF	EP
2008-05-28	European patents granted designating irelandGrantedFG4D	FG4D	IE
2008-05-15	European patent takes effect as a national patent in ch/liEP	EP	CH
2008-04-16	Designated contracting statesAK	AK	EP
2008-03-14	(expected) grantORIGINAL CODE: 0009210GRAA	GRAA	EP
2008-01-24	Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS	GRAS	EP
2007-09-29	Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP	GRAP	EP
2007-09-21	Information on interlocutory revision modifiedORIGINAL CODE: EPIDOSCIRAPEAPAO	APAO	EP
2007-09-21	Interlocutory revision of appeal recordedAppealORIGINAL CODE: EPIDOSNIRAPEAPBV	APBV	EP
2007-09-15	Date of receipt of statement of grounds of appeal recordedAppealORIGINAL CODE: EPIDOSNNOA3EAPBR	APBR	EP
2007-07-04	Date of receipt of notice of appeal recordedAppealORIGINAL CODE: EPIDOSNNOA2EAPBN	APBN	EP
2001-10-04	Designation fees paidAT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SEAKX	AKX	EP
2001-09-05	Request for examination filed17P	17P	EP
2001-01-17	Designated contracting statesAK	AK	EP
2001-01-17	Request for extension of the european patentAL;LT;LV;MK;RO;SIAX	AX	EP
2000-12-01	Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI	PUAI	EP

Universal mobile telephone system network with improved rate matching method

Abstract

Term

Members7

Over the term

Events

Numbers

Titles3

Classification

Designated states25