WO2002051176A1

WO2002051176A1 - Method for transmitting data in a radio communication system comprising different units, base station system equipped for said purpose and radio communication system

Info

Publication number: WO2002051176A1
Application number: PCT/EP2001/014413
Authority: WO
Inventors: Arnulf Deinzer; Steffen Wagner; Carsten Ball
Original assignee: Siemens Aktiengesellschaft
Priority date: 2000-12-20
Filing date: 2001-12-07
Publication date: 2002-06-27

Abstract

A predetermined transmission capacity in the form of a number of time slots (ZS) is reserved for the base station (BTS') in order to transmit data between units, e.g. between a base station (BTS') and a base station controller (BSC') in a radio communication system via a transmission link (US). When a connection is being set up for voice or data transmission, one or more time slots (ZS) from the reserved transmission capacity are assigned to said connection by means of which the data is transmitted between the base station (BTS') and the base station controller (BSC'). The number of assigned time slots (ZS) depends on the service being transmitted via the connection. During the connection, the number of assigned time slots (ZS) can change dynamically if required. After the connection has been terminated, the assigned time slots (ZS) are freed and made available as part of the reserved transmission capacity.

Description

description

Method for data transmission in a radio communication system comprising different units and base station system and radio communication system set up for this purpose

Radio communication systems are used to transmit data using electromagnetic waves via a radio interface between a transmitting and a receiving radio station. An example of a radio communication system is the known GSM mobile radio network, in which a channel formed by a narrow-band frequency range and a time slot is provided for the transmission of a subscriber signal. Since a subscriber signal in a channel is separated in frequency and time from other subscriber signals, the receiving radio station can detect the data of this subscriber signal. In newer radio communication systems, such as the UMTS system, the individual subscribers are also distinguished by different spreading codes.

A known GSM mobile radio network, the block diagram of which is shown in FIG. 1, comprises a large number of mobile switching centers MSC which are networked with one another or which provide access to a fixed network PSTN. Furthermore, these mobile switching centers MSC are each connected to a base station controller BSC. Each base station controller BSC in turn enables a connection to at least one base station BTS and manages the radio resources of the connected base stations BTS. Such a base station BTS is a radio station which can set up a message connection to mobile stations MS via a radio interface. For the transmission of packet-switched data, the base station controller BSC is also connected to a packet data service node (serving GPRS support note) SGSN, which provides access to a fixed data network PDN. An operation and maintenance center OMC implemented ω L t to HH

LT1 o σi o LΠ o LΠ

N tr Φ Q- α P- P> Hl PA

≤ Φ P- Φ P- p- P P = o φ P- P H φ Φ Hi H P

P- Φ rt

Q- td <td P> H H

S Φ o J φ ü P Φ O tr H P. 03 li Hl Q. P-

TJ φ P- tr P- Φ

03 • τl ü 03 P- P ü Φ 1

Ω 01 P Q> Φ

P = S 3 rt P- P P. P tr φ P ⁾ PP • xi P ⁾ P

Tr CO tr rt P LQ P <! P

H. rt Ü P- LQ P O r H Φ 0 N X P 2! p, Φ t P N P X P>

P ⁾ Ω Φ ^ 3 o H,

LQ t cd P- 3 α rt

Φ φ * um 03 td 3 P- P

P π o Ω P- P φ P

P 3 tr P P LQ

-S 3 to φ Φ 03 P- » ^T j CQ

Φ it. i PP ⁾ ? P Hi r. Φ "~ -. Hi r ⁾ PP

P- P- ω 0 P N rt P

Φ P o Φ P- rt X

P Φ 1 LQ h X 0 P- rt tr ¹ rt OPO P- f φ cd 3 CQ PO α Φ P- P- J 3 03 P> P to

P> P- rt 3 ω φ ^ Φ tr rt P P- P 03 P- P

Φ P P Ω 01 rt rt

P- P LQ CO 01 X φ j: Hi

IQ S rt P ⁾ 3 rt P =

-S f P ⁾ P Φ l φ P CO rt P P-

H. P = - •; P- P = P- Q-

P ^ tr • 01 O tr Φ J φ φ rt P φ 01 01

P ö Φ 01 P. φ J 3 01 rt H, S> Q. tr rt fi 0

P- P- Φ P = Φ PJ co tr

Φ Φ P- tr P LQ r P-

Φ tr H, P ¹ ü 03 tr P- p. JP Hi ⁾ Φ PJ Ω P li XP rt HP tr P - rt P

Φ P- Φ LQ P

P φ Φ H P- P. P

P "≤ td P Φ

P- rt φ CO P- rt

P P- Ω Q. 03 N tr Φ 03 Φ rt tsi P- 03 φ P 3 tr

Φ 03 P Φ PJ N

P- 03 P = P P P -3 rt N P- tr Ω

1 P Ω Φ tr

tr ii

te with 160 up to 1300 bits. As stated above, the transmission capacity of 16 kbps sub-time slots is limited to 320 bits, so that with GPRS and EDGE only the encodings with the lowest data rate, e.g. CS1, CS2, MCS1 and MCS2 can be supported with today's technology. Also new circuit-switched package services such as ECSD with transmission rates of up to 56kbps / 64kbps per time slot on the air interface require transmission capacity greater than 320bit / 20ms.

The invention is therefore based on the problem of specifying a method for data transmission in a radio communication system comprising different units, which supports the transmission of larger amounts of data per channel on the air interface. Furthermore, a base station system and a

Radio communication system can be specified in which the procedure takes place.

This problem is solved by a method according to claim 1 and a base station system according to claim 30 and

Radio communication system according to claim 32. Further embodiments of the invention emerge from the subclaims.

The data transmission between two units of a radio communication system takes place via a transmission link on which a predetermined transmission capacity in the form of a number of time slots is reserved for the connection. When establishing a connection on the air interface to Sprachbzw. Data transmission, the connection is assigned one or more time slots from the reserved transmission capacity, via which the data transmission between the units takes place.

It is now possible to assign a channel on the air interface every 20ms to a total of nx 320bit on n parallel time slots, ie for example that a data packet of 1300bit is distributed to 4 or 5 time slots and transmitted simultaneously.

The method can be used both for data transmission between a base station and a base station controller and between a base station controller and a transcoding and rate adaptation unit TRAU or between a transcoding unit (Transcoding and Rate Adaptation Unit TRAU) and a mobile switching center , Base station, base station control, transcoding and rate adaptation unit (TRAU) or mobile switching center in this case represent the different units of the radio communication system.

If more or less transmission capacity is required during the connection, for example due to a data rate adaptation (link adaptation) to changing conditions on the air interface, then additional time slots can be taken from the reserved transmission capacity or excess time slots into the reserved one

Transmission capacity can be released again. After the connection is ended, all time slots assigned to the connection are released and are available for other connections as part of the reserved transmission capacity.

Unused time slots are released, for example, in a time-controlled manner using two timers. The first timer controls the release during data rate adjustment (link adaptation). This release should be stopped slowly so that the connection quickly has additional capacity again when radio conditions improve, without having to request it again. The second timer controls the release after the connection is terminated. He should react very quickly. If the transmission capacity is requested by other connections, the time slots can be released immediately. LO ω t to HH

LΠ o LΠ o LΠ o LΠ

φ P LQ tr Ω 01 CQ 01 α Pi Pi rt <ε 01 Pi P. 3 03 03 PJ NUX 01 rsi Pi &<tr Ö ü P φ trj JP ^J * ö Ω 0 P ⁾ PO Φ H 0 rt Φ P- φ 0 Φ tr Φ P ⁾ PJ Ω P- Φ P φ P- P-

3 P: ^> P ¹ P ⁾ P- tr ≤ rt ü H 3 PJ li Hi Φ H Φ P £ ii. P- tr tr rt P ¹ PHP φ

P- LQ P- tr ¹ rt P φ P P- φ Ω N LQ N 0 'CQ P- <! rt Φ P- φ P): P LQ tr Pi rt φ td Φ PH P- φ PP ^* P <Φ P li rt α = Φ P- φ P- Ö 03 P- 03 P rt Φ P- P rt N 03 N Φ oi rt LQ LQ Φ P LQ Pi - tr P- 0 φ P- Ω Ω PPP% *

Φ s Φ Φ P ¹ S rt s ^> & Φ 03 ii 03 Φ Φ PP Pi ii φ tr tr tr r α - & LQ φ

P- P P- φ 01 P- φ Hi ≤ tr 3 $ i 03 tsi P- φ rt P): Φ Φ P- P- P CQ ii rt CQ φ P- rt to P- rt Φ ü P = Φ P - Φ Φ P 0 rt φ φ PS P- P ü φ ⁱ τj P 03 rt

Φ Ω P φ φ CQ Φ rt tr P- P li P- P ti P "ii 2 Φ rt LQ <tr i O LQ rt li

P - CQ, -. £! Φ P "LQ ü ü 03 Pi P. 03 LQ Pi P ⁾ P r ⁾ P- P ISI rr φ P- Φ tsi s ^> 03 ii P ⁾ φ N π. P ¹ P PJ rr Φ P Φ Φ Φ P ⁾ IQ φ • PH LQ φ ii PP φ Φ 03 Φ LQ

2! P Φ P- φ P. φ rt LQ - • P P P 03 P P LQ Pi Φ Pi tr Pi - * P- li rt Ω P

Φ P- Ω 3 01 P- P ≤ LQ s: 03 P φ <! P- P- P rr ii X P

LQ QJ rt Ω p- rt φ 01 PP 2 P- 03 03 P- Φ LQ <P tr P ⁾ o φ PPX 01 tr ¹ Φ Φ LQ

Φ Φ 03 Φ P - * φ P- LQ P- ü PJ 0 i H td 03 Φ Hi O tr P 3 Pi LQ 0 = Ω P- Ω P CQ

H Ω 01 LQ φ P- Φ Φ Pi P H- ¹ P. Hi ¹ 03 H rt P ⁾ P 01 P tr PW 01

Φ 3 ^* 01 Q- 3 P Φ Hl P 0 r tr Pi Φ Φ N P. $ P 01 P Φ Φ P rt

KSP ¹ Φ • ö N p. 2 tr tr - Pi Φ Ω ü P- P- PP Φ Φ N LQ rt φ P- P 3 K

O P- td Q- li Hi s ^» P Hi Φ Φ J Φ MX Φ P Φ Φ LQ P- 3 P ⁾ 03 li P rr Ω Hl Φ

P tr rt P PJ P- O P- P- P Pi ü P- Ω P 03 P rt rt - 01 Φ M O P J Ω

03 P- N ii PJ 3 P ü φ P ¹ rt 3 φ rt PXP Φ ω P = rt Ω Φ 3 3 03 X rt P ¹ Φ 01 PO IQ Q> p. LQ 3 li α LQ Φ P ö <! Ω tr li XP ⁾ - 3 03 φ

Φ CQ rt Ω tr Φ s: rt Φ> ^■ P- P- S 1 LQ s! P- 0 P "φ Pi Φ Φ tr P PA Φ

03 rt CQ Φ P- PP ⁾ ~ p- P rr 3 φ Φ tö N Φ φ Φ PP ¹ li φ Ω P Φ PPP ⁾ PXJ P- ^• - * P ¹ Φ α HP Hl LQ P- P li Φ ≤ P P- P P- »i X P- P- P- tr P ⁾

, -. rt H, Φ CQ J rt <Φ tr Φ P 01 Pi P- P- 03 03 Pi rr Pi Φ φ Ω Φ P

Iτj P- P. ii ⁾ rr tsj N Φ OJ rt Pi rr Φ P- 03 φ Φ rt φ N P- Φ P P- P> PJ HP

P ⁾ 0 H. P ¹ P> PPPPSP Φ φ - PP Ω P- Φ 3 Φ Φ P- Φ P Pi rt P rt PP Φ 03 rt LQ. 0 P- 03 LQ tr P ^ PPJ LQ Hl P- P- 03 Pi υi tr PJ Ω P- li 3 φ i tr Pi rt Pi WP Φ φ P- <<Φ P Φ φ 0 tr ¹ tr P ⁾

PPP ^* P> O P- P- φ P- Φ rt Φ Φ 0 PP li P> Φ Φ ü Ω PPP P- Φ tr o PPPPP Hi 01 <ü H • PH Φ LQ P ⁾ Pi tr p. * H tr P ii Ω 03 φ

03 P. Φ Ω Hi 01 φ 03 03 P Φ Pi P X Φ tr <rt Φ O tr o P-

01 P- rt tr PJ CQ rt i td rt <P = PP Φ 03 03 P Φ P ¹ P- Φ P 01 Φ 03 Pi rt P

* - 'P-. PPP ⁾ tr P> J Φ φ tr Φ P li P- P p- Ω P l P P- li φ Φ i 3

Φ S p. 01 P Q. P- 01 rt li P- Φ P 03 Φ Ω i ii 3 ^{^} Pi tr ü φ 03 P, li Φ Φ Φ

P- ii P- P- - Hi P- 3 P- P- tr PH • o td P- P ^J 03 Φ P P- Ω <! P- li tr φ er ti φ O Φ &. 01 O P- φ P- Ω Φ 3 P ⁾ PPO pr tr P- to rt Φ p.

03 td P ^* Q. P- HP CQ PPH Pi P- P - i P- P Hi LQ Pi PJ 0 = P- φ P- Φ Φ

P ⁾ PJ = td P tö P rt Pi P- φ Φ LQ H Hl PP ii P φ i Ω li ii J CQ P 3 & Φ PJ LQ PP Pi φ Φ P Φ P. X Φ P = P rt P Pi rt 3 P> Φ J P- LQ α Tt Φ li 01 rt <! P Φ IO P- P. 03 O P. tr in. P- Φ φ rt P

P. 01 P- P- Hi 3 P P- ⁾ P- O LQ HP rt Φ rt Φ 3 Φ Φ P P- Hi cn P ^> υ

P- 01 LQ Φ P ⁾ P 03 POP φ P ⁾ Φ Φ P 3 Φ HNP ¹ Ω QO rt P P- P- tr P- J 03 PP li LQ P- φ? PP ⁾ tr

0 r P 01 LQ 03 Hi P Φ MP PA M rt Φ P- rt PP ¹ Φ tr P rt Φ ^

03 J Φ L Φ W Φ 03 03

P- rt P- & CQ S - ~ PJ Φ PPP P- rt N • o rt ^► 0 φ PJ Φ PPP li 03 -> P- Q P- rt N Hi o rt φ P Pi Φ P "P"< P PJ ii P- LQ ≤ 3 M rt rt P ¹ CQ t

POJ Φ 3 "Ω P- i rt Φ i ii 1SJ φ P td Φ P- Hl φ Ό HH P- P- JJP Q. tr -> Ω O Hi N co P- PO P- i Ω P- 3 φ ⁾ P 'P ⁾ φ rt Ω

Φ P "Q- Φ P r ¹ Φ P Ω rt 3 Hl <rt P> P 'Pi P Φ 01 01 P ^■ ; LQ Ω Φ tr P-

CQ 03 li CQ Q ^J - CQ P ü tr Φ LQ Φ P): 03 Φ φ tr P φ 01 φ 03 PP 03

0 P. rt P- CQ tr Hl P i P): P co li rt 03 P H. Φ P φ P- P Φ <tr Ω tr S td Φ P> Φ φ rt rt φ rt P = φ Hl P. P- ö Φ PJ LQ P Φ Φ P 'φ P- PH, Φ td P- 1 HN tr r H. P = P ⁾ Hi tsi r P- P t_r PJ 03 p, P- Φ

1 φ rt H P 1 P- P φ φ <! LQ P P = p Φ Φ "X tr tr

Hl NX o li 03 Pi P P- li P- P Hi H P- ii P 03 P- PJ P ⁾ P- P-

P. Φ P φ i 01 rr P- LQ 1 Ω P 1 Φ 01 P- 1 Ό P P Φ Φ φ l 1 1 rt Φ Φ LQ Φ 1 rr 1 PJ 1 P H

03 1 1

LO U) to to H P "

LΠ o LΠ o σι o LΠ

N Pi tsi P P. tsi ^ 01 tr K td NP <! tr 3 α P- Pi S Pi Pi Pi tsi er O LQ 2 i Ω 01 φ Φ Φ i Φ φ φ Ω P ⁾⁾ 03 Φ PO P- Φ Φ PP ^J P- P- 0 Φ P ⁾ Φ P 0 Φ P- Φ 0 Φ Ht

P ¹ H P- 01 3 P- H tr P £ P LQ PP tr P ii ii φ rr ü P CQ P LQ ii P φ P tr li P P-

P rt * d rt PP "Pi • P ¹ φ i H ^ Ω Φ P ¹ ^ 01 φ tsi Hi P φ P- P 3

Φ si P- H IS! P- Φ P- rt P- PP Φ tr <! m P- tr s: P P> CQ 3 P ¹ N Pi 3

P Φ PP = Φ P ii rt co φ PPP i ^ PP φ P- Φ P Pi φ P- LQ P ¹ rt Hl Φ rt

P- Hi P P- Hi IS. P- tsi LQ rt P LQ Φ P- P pp P ¹ IQ P- P- P- φ CQ tsi P i • rsi rt O LQ rt o P- LQ Φ rr N rt φ φ 3 CQ 03 Hi Φ Ω φ Pi £ 03. 01 ^ Φ PP ¹ φ φ ii CQ li 01 3 P P- rt Φ PH φ • d Ω Φ P φ Φ Φ P- P- Φ li p- P ⁾ 3 P- Ω 3 rt P- PJ rt P- Φ P Φ tr ii ii P ^* rt NPP P- tr P, rt rt P rt LQ P> Ω P "P ⁾ rt M CQ 3 s Pi P- φ P- P = P- P 3 φ 03 φ Pi Φ tr td hl

CQ Φ rt p- P ¹ rt Φ P- Ω ti φ P- φ P φ φ P = LQ P- td ≤ Φ φ 01 P- φ P

Ω P- φ P- P- 01 Pi 01 'to Φ P 01 P 03 LQ Pi H 03 φ rt P- φ P- P Φ ii rt Pi tr PO r 0 Φ P- P ¹ PJ P- PJ 01 Φ • d P φ 03 O 01 PP, ZP P- P- P P-- Hi P-

H P P ö N P <! ii Φ P- p- rt Ω Φ 'P- P P- P ≥! Φ P, Ω tr Pi Φ Hl φ rt Φ Ω Φ φ

P- Pi PJ O P. rt 3 03 tT 3 φ LQ Ω φ PP Pi t Φ φ ii tr li 01 rr Φ rr P = N ii WP tsi φ Ω tr Φ P "tr P 3 - P P- P P- P s Pi 3 01 P φ

N P> li Φ tr P rt P ¹ PP tr Φ ii 03 Pi Φ 3 Φ P- rt Φ 01 Φ Φ P- P

Φ P P "P φ Φ Φ LQ N O P 03 £ Φ N Φ 03 rt rt Φ P 01 N 4 H Ω P s:

Pi P ⁾ P> li P = P- P- P Pi P- tr rt Φ P t Φ li 0 NP Pi rr ⁾ CQ tr LQ Φ

P Φ PP rr tr P rt Φ rr Φ PA P ⁾ P- Φ P- P- P P- Φ P Pi • tr P "rt P-

P- i tr 0 i Φ tr 01 ii Pi ii ti P ⁾ rt 03 <P- rt Φ Pi P »3 ii P- M Φ Φ P- 03 01

Ω Φ rt HP ⁾ li P ⁾ rt ⁾ Φ Φ s P P- Φ 0 P "03 ü φ P- Ω Φ rt P- LQ 0 φ ii Pi LQ rt Hi Φ Φ W td P ⁾ 0 ii Φ Ω P li Pi Pi rt 3 "Pi ti P rt S et ω Φ P Φ ii rt P LQ P ¹ i tsi PJ P" P Pi rt P 3 "PP Φ P- LQ PN Φ rt LQ • P-.

Φ P- PPJ - rt P ⁾ Hl PP 03 Φ Φ Φ Hi P ¹ LQ li Φ Φ P Φ P. Φ Φ φ φ

3 P- P P Φ LQ ≥i • li P- Hi P P P- O P- tr rr 3 P- P p- • xj ii

Φ rt Φ LQ P Φ P- P P- P Pi Hi 03 P ¹ rt P- Φ H, Φ Φ 3 rr P Φ φ Pi Pi tr 03 ü PP 3 Φ Pi φ P rt N Ω * • LQ N 03 Φ P- P- Φ 03 Φ t? PH PJ Φ

P, 03 P ⁾ α - 3 O p, P rt Φ Φ P ⁱ τj Φ Φ rt P- 03 PH Ω PP CQ P a.

Φ Φ tr P> Pi φ H Φ P φ P "rt LQ t Pi φ Φ Φ rt P- tr Φ Φ

N P- P- rr PJ Φ H tsi P LQ X 03 P> CO P ⁾ tsi 03 Φ tr H ii • φ N li Pi li cn PJ

P P rt φ P P P • P * - • rt Φ P- 03 P φ 03 P- <! ii P- P rt P- P

Φ Φ 03 P- P 01 LQ P- P Pi Hi ^f τ 03 IQ LQ P- α rt rt LQ H tr LQ Ω

P- rt 01 ti CQ Pi Φ Φ P- Hi P ⁾ 03 3 φ Φ Φ P ⁾ • N Φ P ⁾ P ⁾ P tr

P ö Φ tr Φ Pi φ S φ P- ii Φ X tr 0 Φ P- <! H li Pi Φ S LQ P P> ⁾ Φ P- J LQ Φ P- Φ li P Φ u 3 "Φ φ i PP φ rt tr P α - • P- PP ⁾ PP" ö

P rt P li 3 P rt P- Φ PP ⁾ c. P ⁾ rt P- rt rt Hl f Φ P- P, P- φ P tr pι =

Pi Φ Φ CQ CQ Pi P 3 Φ tr Pi P- P- PJ PP Ω Φ Pi CQ LQ tr P ⁾ t φ π Φ P- P Pi Ω Φ P- P P- tr φ P> LQ Φ Φ Ω P ^: Pi 3 "03 P- Φ P ⁾ P PJ ä» d

P. rt P- 01 rt P- P ^{^} φ tSJ P rt φ P rt φ ü H "H cj = P Φ Φ PP Φ Ω P Hi

P- P rr 01 φ P * P- φ Pi H Φ 3 Φ rt φ Hi tr P -: Φ P P tr 03 P

03 0 Hl • P- 01 tr P- P- rr P P P Φ li Φ Φ LQ P- 3 Φ P P. LQ Ω P

^ P ⁾ P- N rt rt P> rt S CQ ü Pi XP ¹ P ii i P P- P- 3- LQ

P - Ω td P Φ N P 03 P- rr J P- PJ rt 3 rt rr M Pi 3 P t i LQ P- Cß

Ω P 'P- P- Φ Pi * d Ω φ LQ φ P P- TJ σ 0 = ii P 3 φ φ Φ φ <Φ tr Hl Φ P tö rr P i rt tr P Φ P PJ O Φ P ⁾ LQ CQ P ⁾ IQ φ φ ii P- 3 Φ Hl ü PJ 03 φ Φ -> 03 03 P ¹ Φ 01 P φ Φ P ¹ H. rt P "φ LQ Φ P> ii rt 0 W li Hi

0 P ¹ N P> t_j. P ⁾ P- ii LQ P- φ P Φ P- P- P -S 3 P- <01 Pi P P- P "Φ

P ≥! Pi P LQ Φ Pi Φ rr 01 03 P Φ X Φ P Ω PP P- 0 = φ Φ Ω P ⁾ 01 P ⁾ X

P- 03 P> φ LQ φ -3 φ Ω tsi Hi φ X N 3 rt H tr LQ φ LQ ii li 3 "3 i rt Φ rt

01 Ω ii Φ li 3 ^ P. 3 "P ⁾ Φ Φ S - X 03 03 P ¹ P tr P ¹ PJ Φ O Φ

P- Pi ^{^} PJ PJ Pi P- ⁾ φ li * d P ¹⁾ P tr P- 0 = X Φ P- P P- P- P ¹ li p, rt φ P- ii li P Φ tsi P- H P - P ⁾ PP PJ Φ Pi P P> P Ω LQ P rt P- P- PP ⁾ ii φ Φ rt Hi 01 01 φ Ω CQ NN φ Hi PA ri P- P • d tr Pi M LQ <! Φ P- P rt LQ P- P- 3 ^* P Φ P- PP> φ φ φ PJ £ rt SP φ Φ Φ 03 Hl φ Φ LQ P- Φ rt Φ 01 P- rt P. P Pi> i PN φ - P- PP li P <

03 P- Φ P- P P- Φ Ω P ⁾ P- P ⁾ P- P- P- P. ü LQ Φ LQ Φ P-

Φ PP φ P P- rt 'Φ Φ Φ Φ Φ P- P rt & P ⁾ 03 P

P- Φ P rt rr fi P PJ: P

Mr.

should. Even when a connection is re-established, all assigned time slots are synchronized first. Only then does the actual data transfer take place. If a time slot loses its synchronicity with the remaining time slots during operation, it is re-synchronized. The service is then interrupted or can continue to run on the remaining time slots with low quality. When adjusting the rate of a service, the additional time slots are first synchronized before the rate is adjusted.

According to one embodiment of the invention, a connection is assigned a smaller number of time slots if the number of requested time slots is not available in the reserved transmission capacity. This procedure has the advantage that a connection can still be established or maintained in the event that there are no longer sufficient time slots in the reserved transmission capacity. The service transmitted via this connection is then available with lower performance (Quality of Service). If there are existing connections in the cell with lower priority than the new service to be set up, it is within the scope of the invention to release the time slots of the existing low-priority connections in favor of the new service (so-called service downgrade). Alternatively, low-priority connections can also be moved to neighboring cells (handover, cell reselection). This possibility also exists for the new service if a lower performance cannot be tolerated or if there are no other connections to downgrade in the cell.

The number of time slots allocated to a connection is preferably dynamically adapted to the requirements of the connection during the connection. The requirements for the connection can be changed by adapting the service, for example by changing the coding scheme (link adaptation) or by moving the mobile station, through which the LO ÜO to to HH

LΠ o LΠ o LΠ O LΠ

use as long as there is little traffic in the actual cell.

It is also expedient to reserve subsets of the reserved transmission capacity for different services, transmission routes and / or transmission methods or to define “soft” thresholds / barriers. This ensures that the utilization of the transmission route is evenly ensured for the different users and services Transmission paths include both the transmission via different base stations and the transmission over different carrier frequencies of one and the same base station, which can be carried out using time-division multiplexing, frequency division multiplexing or spreading code multiplexing the transmission of voice data as well as packet data according to different protocols, in particular the frame relay protocol and the internet protocol The different services include in particular voice, data and / or sig tionalisation.

If the transmission via a unit, e.g. For example, if a base station, a service, a transmission route or a transmission method are preferred, it is within the scope of the invention to provide the corresponding subset in a predetermined minimum size or to ensure, based on a suitable prioritization, that low-priority services in the event of a conflict, Transmission channels or transmission methods release the corresponding capacity.

In a network in which the proportions of the connections via the individual base stations, services, transmission paths and / or transmission methods fluctuate greatly, it is advantageous to dynamically change the size of the subsets of the reserved transmission capacity depending on the connection volume of the respective type. If the size of the subsets is dimensioned such that the sum of the subsets is less than the total reserved transmission capacity, it is achieved that even if one type of connection has exhausted the subsets of the transmission capacity reserved for it, connections of this type can still be established , using the excess of the reserved transmission capacity.

It is within the scope of the invention to assign a higher priority to a service, a transmission path or a transmission method. In this case, when a connection is established, the requirements for connections for the service, transmission path or transmission method with the increased priority are first met. The requirements for connections for services, transmission paths or transmission methods are then processed without increased priority. New connections with a higher priority preferably always cause the downgrade or the delay (queuing) or the handover / cell reselection of low-priority connections if the capacity available at the moment is not sufficient.

In a base station system with a base station and a base station controller, a capacity allocation unit is preferably used in the base station controller, which controls the course of the method and tries to optimally meet all quality of service requirements.

If a base station does not occupy the entire allocated transmission capacity, the remaining capacity is available for internal data exchange between the base station and the base station controller, e.g. for signaling, measurement data transmission and software download.

Exemplary embodiments of the invention are explained in more detail below with reference to the figures. Figure 1 shows a known radio communication system

FIG. 2 shows a radio communication system in which a base station controller controls three base stations and the data transmission between the base station controller and the base stations takes place using the method according to the invention.

FIG. 3 shows a radio communication system in which a base station controller controls a base station and in which the data transmission between the base station controller and the base station takes place according to the method according to the invention.

A base station controller BSC ^Λ controls three base stations BTS (see Figure 2). The base station controller BSC ^λ is connected to each of the base stations BTS ^X via transmission links US. The transmission links US are designed as PCM24 / 30 lines. Each of the base stations BTS ^λ is connected to the base station controller BSC ^Λ via two PCM24 / 30 lines US. The transmission via the PCM24 / 30 lines takes place via 16kbps time slots ZS.

Each of the base stations BTS comprises a central control unit (core unit) GORE. In addition, each of the base stations BTS ^λ includes carrier units CU that operate in different frequency windows. The outputs of the carrier units CU from one and the same base station BTS ^X are connected to a combiner C in which the signals from the different carrier units CU are passed to an antenna A. Mobile stations MS ^{λ are} supplied with signals via antenna A.

The base station controller BSC ^λ is connected on the one hand via a rate adjustment unit TRAU and a mobile switching center MSC ^Λ to a fixed network PSTN ^λ . On the other hand, the base station controller is BST via a packet data service node co LO t to HH

LΠ O LΠ o in O LΠ

• ⁱ iti = P. 03 tr * m 01 er J Φ Pi tr NI 03 to φ H PI 03 <J Hi rt NHH 01 TJ _ φ P- φ tr φ Φ rt Φ Φ N P- φ O P- Φ φ Φ PP Ω ⁾ P- PP Ω Φ P Φ PP ⁾ PJ P φ P- Φ 53 PP ⁾ P- P- • 01 P- P ii P- P P. P rt tr ii Φ LQ rt rt P {φ? α 03 li HP ≥: Φ rt H φ rt rt ¹ td 01 3 tr rt r LQ P- Φ P- tr Pi Φ P- 3 tr 53 φ Φ Φ LQ ii ii

Ω <03 rt P- Pi P- P 3 • rr p. Φ tö P 03 01 Φ 3 0 Φ φ H φ P- H P- Hi - 03 <!

TJ φ Ω HP ¹ φ OP φ P Φ _l. P- P ⁾⁾ Ω φ H PJ P- HP P- rt rt φ P = p ⁾ Φ P <! P- to H tr PJ CQ ti P LQ P co rt P- φ r CQ LQ - P- td rt Φ rt • tr PP "P- P- Φ P co tr LQ 03 Φ LQ J P- P ¹ 53 P- PP ¹ P tö P ¹ t rt P- Φ W li Ω φ P φ H LQ

P- P- P ii <03 P φ ü O 3 φ TJ 01 P P- tr P> φ o TJ P> TJ Ω rt S CQ rt er = tr P- 3 "x

Ω P ^' rr P φ Φ rt P> P φ P- TJ 01 LQ rt φ 03 P- φ Ω 03 li tr Ω. rt φ 2 P Ω co Q> N LQ CQ ii Φ Ω Φ PM rt N P- P- P Ω α P- O Φ Φ Φ CQ 00 P P- OP TJ

1 P Φ 01 φ tr P tö φ tr P LQ 01 5 J Pi Φ rt 03 LQ X 03 rt P li σ TJ £ P rt tr P ⁱ t

H P tr ii P- Φ Φ ii Φ φ P- rt φ 03 Φ Φ <03 O ö φ tr LQ P- Φ CQ

^ LQ tsi P ⁾ JP ii P- rt - tö P Φ ii P- p. P ⁾ td r rt 0 rt tr J PJ Pi P li TJ 01 p] P ¹ P

Ω CQ J P- Pi P 3 Φ Hl P- Pi OP TJ P ⁾ Φ <li P ⁾ 0 ii rt Φ PP 03 <! trj <! CQ

CO P = J φ PP P- ö co tr PP ö Hl r P- 0 LQ rr P "0 Φ P Pi Φ Φ [> Φ P l tr P- tsi HP LQ>h-> P ⁾ - Φ φ Φ Φ P ⁾ tsi P- ¹ li Φ P- r P l tsi ü ii TJ t Φ 03 P- rt LQ P Φ rr - P- ii P- P rt P ⁾ P 0 rt LQ 03 OO TJ td Φ 3 3 TJ fi r rt Φ tö Hl P Φ CQ 3 Φ 3 P φ Φ P Pi p Hl P ⁾ Ω 53 P- P- 53 P- O

TJ rt PJ: P Φ CO er P _^ J TJ 2 Φ tö PP ¹ 03 53 LQ p- 03 Φ o P ^ CQ φ r rr φ rt li

PJ ii P> rt P- Ω P ⁾ 01 li P- φ P. Φ 2 03 Φ Φ Φ 03 li Φ Φ α ü 03 rt i rt rr t P> tr P. PP P- O φ P <Co <P ⁾ rt H er P rr p ^j H rt Ω Φ i

Φ LQ tr N Φ 1 Ω ü p ^j LQ O - OP Φ Pi Φ - Φ tö Φ Pi 3 Φ tr P ¹ Φ PP rr Φ P ⁾ = P P- P Φ ^{^} Φ P] 01 Φ li P TJ P ⁾ P Φ PP P> P Ω P> P- PP ¹ rt PPO i P 3 LQ OP P- 01 H 5 LQ 01 Ω LQ Φ P Φ P- φ 03 TJ rt rt P- LQ rt

PJ LQ φ 3 Pi Pi P Pi Φ P ⁾ = φ <Φ rt i 2 φ ii • li PH P- tö Φ rt P> rt P- CQ 03 Φ rt -3 P- 53 Φ Φ Φ P> H LQ P - O LQ Φ Φ 1 3 PP 03 N CQ P Φ P ti P TJ 03 -

Φ Φ LQ P- P li Φ li tr <φ 01 P Φ PH tr ¹ Φ P Ω Pi P 03 P - Pi Ω Φ l rt

PH φ LQ P- Φ p- »i φ tr Φ φ P LQ i Φ LQ rt 3 P- 01 tr - P ¹⁾ PJ CQ Q φ 3 P <P- φ φ P>

Q><! CN Φ ü tö P- rt 0 = ii P> td φ cn Ω rt Ω to ö Φ o φ Φ Φ Φ ü P- Hi Φ 3 rt P ⁾ rt tö tΛ td rt tö Ω PPP "Pi? Tr P- CQ tr PPP Pi tr li HP ⁾ rt PP P- Φ • 01 P Pi tn Φ P. CQ P- Φ TJ CQ φ Φ tr i O ≥! φ • φ H tr P tr φ r P- P Φ Ω P- Ω O P- tö rt X P- p. JP ⁾ P

P. 01 Pi H φ Pi P- Hl 01 φ ii 01 1? H 01 LQ left - -—. φ - P 03 CQ rt 03 rr rt O φ α li Φ P P- P- Ω P 01 Φ Φ 03 J P P> P td φ 2 3 p. P "li P- p, Φ ii Pi P P rt φ tr φ rt P LQ P- P TJ P- CQ P- tr O er» P P> tSJ P cn P-

P> P "φ Φ PP Pi P- li Pi P> Φ CQ rt P ⁾ 03 rt φ tsi rt tr LQ CQ Φ Ω r

LQ. 03 tsi tö P rt Ω P P- r Φ rt <! 03 r 03 tr rt φ P "53 Φ r CQ P- P- _^ - _* . _* > Φ ps Φ φ P> LQ Φ α Φ rt H li P- OP ⁾ J Φ PPJ <! CQ rt Ω Φ

P co rt ii P- 03 li ö NP ⁾ OH 3 Φ li rt Φ φ Hl ω φ CQ 03 CQ P P-

0 tsi <rr P- tsi 01 p- O O Φ LQ PA P LQ rr P- Φ <! P- li H Ω CQ li rr Ω 2 P P

53 P ¹ Pi PJ P- 01 03 53 Ω Φ P. Pi PPP ⁾ 03 Φ Φ P Ω φ PP P> td Ω tsi 3 PJ tr Pi Φ

Φ Φ p- φ Ω 03 P- tr Φ Φ PJ 03 03 P Φ tr ii Φ P 3 trj CQ φ P- rr P ¹ Hi 3 φ li P <i tr rt 03 P- t JHH tsi LQ P ⁾ rt Φ Φ 3 LQ Φ 5 P- rr P- P- P Pi ⁱ P rt P ⁾ Ω φ Φ co 01 tsi Φ 3 "<! PA P P- TJ 2J rt rt O rt -> P- α

Φ ö Pi φ P- rt tr Pi P- PJ 3 X P- P Φ Φ P> Pi rt P> tö ii 01 Φ PMP ¹ Φ P>

P co PJ φ P rt P- Φ rt P Φ HP ⁾ rt Φ ii J rt X CΩ Φ P -3 Ω P ¹ 03 Φ 1 rt

- TJ rr li NOP P- 01 O - Φ J): ü Hi P ⁾ Pi Φ φ Ω P ¹ P ⁾ φ tr rt 03 P li t Φ ii Φ Φ P Ω Ω tr i 01 P ⁾ rt PPN φ P " rt - P> Ω i P ¹ φ rt P ⁾ P ⁾ P

01 p ⁾ PN Φ i tr P "Φ φ ti co P P- φ P- 3 rr Pi P- tr Pi P- φ _^ - .. rt r Hi o Ω - P tsa P φ Φ TJ HH P- N LQ P- CQ rt φ JN CQ φ rt σ P Hi φ Φ Φ tr LQ co ii P P- ii Φ <! Rt P Φ tr für!! P r P - PP tsi ⁾ Φ P - P 03

P- Pi Pi φ tö rr O p- PJ: rt tö P ⁾ rt 0 Φ LQ P φ r ii Φ P ⁾ rt

01 p ⁾ P- 53 PJ H tö TJ N Pi Φ rt Φ CO Pi ü 03 Pi α P Φ rt JP Φ P ii tr PP r rt φ P- P CO PJ Ω Φ CQ Φ p, P- Ω P- Φ tsi P- PJ 03 Hi m Φ PJ PP P> J Φ

Φ φ 03 - 01 2 Φ ü rt P- - Φ PP Φ rt rr P = 2 H Λ tsi Pi LQ tr H ¹ P> rt

Φ P P = 03 P- to Φ - P P r li Φ Φ p- 1 Φ P P- PJ Hl 03 N

P- r Φ Pi 53 01 Φ> P- <! td P N = Φ 1 P P H 0 rt LQ Φ tö 1 1

P 0 φ P φ φ 1 P P- PJ 53 LQ P 1 P- Φ P-. 1 Φ P CQ Hi

1 ii Φ ii ii ω Φ Ω 1 O CQ 1 P- li φ 01 Pi 1

P oi Φ 1 1 P 1 left 1

ÜO LO to to H H

Lπ o LΠ o LΠ O LΠ

2 Ω LQ P td Φ H 3 W r CQ Φ 03 Pi td O tsi tr Pi X 53 LQ P- Φ LQ ii WN Pi <Pi N co α Φ Φ PJ P- P Φ Φ Φ Φ ii rt P- φ HP φ Φ P ⁾ Φ P- Φ P- P Φ P Φ P- P Φ φ P ⁾ Φ

H p, tr 03 P P rt li Φ Φ φ Hl P-. 03 ii P P P li O φ rt P li φ LQ P H rt P-

Φ Φ P- φ Pi Pi P <! P- P P- P Φ Hi P Pi Pi li ü Hl 2 LQ er ii φ 3 Φ rt

P = P- P- P 03 TJ P- Φ P ⁾ P. P- P Φ TJ P Φ rt P ¹ Φ Pi 03 Φ O P- tr 0 Pi P- P 03 er 03 P 03 PPP rt Φ φ p- ti P ⁾ &. P tsi P Pi Φ ii Φ P Ω li er tö P Φ li φ rt Ω

Φ rt tr Φ rt P φ Φ ii Φ P t φ Φ φ P ⁾ P- rt P- Φ 3 ^ P P- CQ Pi P- Pi ii rt Φ tr li φ P- P ⁾ tr 3 α P ö rt P - P φ r P 03 PPP rt Φ rt P ¹ Ω PP Φ P- P ¹ i P- P rt tr J Pi P ⁾ rt LQ rt 03 P Φ 03 φ - 3 03 - • P 53 Φ <P P-

Φ Φ rt φ P- o tsi rr P- rt Pi 03 tr P- P- P ⁾ P- rt LQ P- rt Φ rt Φ rt

P- ü Φ ii O 3 53 Φ Φ Φ P- .—. tö P> P- ISI LQ 53 t Ω LQ tr 03 PJ Φ H • p. Φ 03 tsi

P p ⁾ PP 3 φ PPP φ Ω CO rt Ω 53 Φ P- P ⁾ P "P Φ 53 rt rt P- tr Pi tr

Φ ii tsi 03 P P- <03 i O Ω Φ tr H rt O P- P- - P- P Φ P- ö 3 "tsi rr. -. Φ 03 P rt O rr P- PA HPP Pi Φ Pi Φ HO Φ P- tr PP ⁾ 0 = co tr "Ω P rt P- Φ P ¹ tv Φ PJ Φ 03 P- tsi PP P- 03 π Pi td P 3 Φ Pi rt p-

P Φ P ⁾ rt Φ XPPPP TJ 03 r PP Pi Pi P ⁾ Φ 03 P "φ CQ P- P Φ φ <!

Hi P- ii ii PJ 3 O 03 P ⁾ PO Φ 03 P- P Φ Φ Φ P- 2 Ω <! PPP, location P p. P> Φ rt φ rr rt tsi PPP φ P): P Φ TJ <H P- P- CQ 3 "φ i LQ Pi φ P

03 LQ P- ii P- PP Φ Φ P- P- Pi Φ P- rt P- P> Φ Φ PP LQ - P ⁾ = ii φ P- P

Ω Φ φ Φ P 0 03 P rt rt Φ p. P ti Ω TJ 03 p. φ Φ H rt tr H φ Φ H tr ii P. PPP Hi tsi P ⁾ = - - ii Φ Φ P ¹ P "P 03 er tsi i 0 = <j M P- P- P PA cn

P p- LQ 03 P =. -. Φ rt P P- ti P- rt PP P- P ⁾ LQ W 0 PP si P 01 O tr

P- Ω P td 03 tr 03 P- 03 Ω P Ω X P P tr td Φ Φ P P Pi P φ rt Pi tr rt tr P P- tö 'S! i Φ rti O tr tr P- tr 3 er LQ PP li H LQ P 53. Φ P- TJ rt rt P- P Co 03 P ii CQ P tö φ Φ Φ φ Φ P- P rt P- Φ Pi P Φ LQ Φ 03

03 Φ rt tr Ω rt P <J Ω rt td P- P- 03 3- OP <Hl P li φ Pi LQ P- li -3 ü rt rr Φ - Φ LQ P- 3 "Φ 03 rr 53 tsi ii P tr ¹ LQ 0 Φ LQ li P CQ 01 o = P- 03 PJ

Φ • »P- - 3 01 P P- TJ φ φ CQ P- CQ P ü Φ td ii J P W φ Ω P

Ω rr. tr LQ P- P ¹ P- P- TJ P- P- tr φ P LQ P »i PN Ω PP Φ tr

P ^{1 i} Φ Φ rt P Φ φ Ω rt rr φ P- tr P tsi P Φ rt P tr Hl LQ ii td Φ PH

Φ P> H, -, ö P- P- Ω NP li P ¹ _. Φ 03 PP φ φ P Hl LQ LQ tr Φ Ω 3

CQ - Ω P- P 01 TJ Φ LQ 03 ii Ω 0 tr rt P- LQ tsi Φ Φ φ PJ <! co ⁾ U PS ^ω _. 03 O φ Φ TJ t 03 tö -3 P Φ 3 "φ Φ Pi Φ rr P ⁾ ii tr Hl PO ö 03 Ω

Ω ii P- CQ Φ φ PJ φ P- P rr P- P ⁾ ω P tr P 0 = P = P & - tr

03 Φ td tö φ P P- CQ P- Ω P- P- rr J 53 Ω P M P li 3- N P: Φ

P P- t PJ PJ 03 r P P- 03 tr 3 rt LQ rt P ⁾ "Pi P P- ii 0 N PJ M er P

P ⁾ Φ P 03 03 P CQ P- 01 Φ rt O tsi rr tö P ⁾ Φ <ω LQ rt P Φ tr co Φ Pi

Ω P P- P-. -. TJ TJ Φ 01 Φ Φ Φ TJ rt P- Pi O Φ - P- P * Ω li tr 3 Ω P- CQ 03 01 TJ ü P- rt P- P- LQ P- p. rr P> P P P Pi rt CO rt

P- r 01 03 P- o Φ rt P ⁾ PPM Φ tsi P> O Φ ti 3 P 5 φ ω <! α li s:

Pi rt ω - rt rt φ ü Ω rt P- P- Φ PP _^ P Φ P- tSJ Pi tö P- li Ω O P> Φ

Φ • P ⁾ P ⁾ p- rt tr tö P- Pi P. Ω P P- LQ Pi P rt φ P> φ tr PP LQ H.

3 Φ Ω rt rt φ Φ TJ O φ Φ tr Φ rt Φ P- Pi 03 tö φ Φ Pi

P- α O p- P- PPP li ii Φ ii 03 53 <! Pi ti tr rt P> P- 53 P ⁾ P- tsi r P Φ

Ω P P- to O O J O Hl P Ω P- 0 Φ CQ 0 03 3 03 φ 03 rt Φ φ P

CO Φ Φ td P P P- rr Pö t i tö <tr φ ii 03 tr Ω P- 01 P- P- N P- H 0

2 ü - LQ Φ Pi Φ p] Φ ⁾ PA Φ M 03 LQ N Φ tr rr rt rt 03 Φ rt rt Pi

1 P] tö Cd ^• - Φ li CQ P 03 O li P- Φ Φ cd P 3 P ¹ P ⁾ 03 P 01 ii Φ P>

CQ 2 P, i P. H 3 - rt P- P tr rt PP Φ LQ P- P rt Pi rt Ω PJ H LQ rt 0 P): ii CQ CQ LO co TJ - • ii 03 Hl P- N - 0 rt φ PA rt P- P- P- P ⁾ tsi tr LQ Φ

P> er LQ φ -. - • - Ω <! PJ p 03 P- P Φ 3 H o ON φ O φ rt co φ P ¹ LQ

P P- Φ P- - - CQ O tr P. P ¹ rt LQ Pi P 3 P- li n. Φ Pi P P- P- P Φ φ

Pi P ¹ HP ≥5 3 Φ P ⁾ Φ JPPN φ Φ Φ 0. P- P i NO PJ rt - P- P p ⁾ 03 Φ p] PP 3 rt PP rt li P CQ 1 P r P φ P- tö PPPN rt

H rt P- li 3 P Hi N <! P P- P ⁾ LQ CQ i »i tst LQ p] LQ 03 Φ CQ PJ

Pi ⁾ PP ⁾ = Hi Pi PJ tr P Φ CO O rt Hi 53 ~ rt ω CQ Φ CO Φ 03 Φ P 0 PP ⁾ rt tr l pi 01 o 3 ii H rt P P- tsi ii Φ • Ω 3 - tr rt P- LQ IV

P- φ 01 φ 03 3 3 Φ Φ 03 O P Φ ii Pi - N 0- Φ P tSJ 53 CQ Φ

0 O P- 03 P- rt J P- 1 P 1 P N P- 1 φ P PA p. P φ co φ 1 rt

3 P rt rt PP ⁾ rt 1 P 1 tr 3 1 0 P- Φ ii 1 Φ 1 1 PJ 1 1 1 1

LO LO to to P> H

LΠ o LΠ o LΠ o in

Speech data which are supplied to the Geran base station controller GBSC by the rate adaptation unit TRAU 'are in 16 kbps time slots. Packet data that are fed to the Geran- base station controller GBSC via the G interface are divided into radio blocks in the packet data control unit PCU ^λ , the size of which depends on the coding depth used in the transmission. A radio block can contain 160 to 1300 bits. Circuit-switched data that is fed to the common platform CP via the I _U (CS) interface from the third-generation 3G CN communication system, and packet-switched data that is fed to the common platform via the I _u (PS) interface from the third-party communication network Generation 3G CN are supplied to the packet data control unit PCU ¹ and there are also divided into radio blocks of different sizes.

When a connection is established between the base station controller BSC2 ^x and the base station BTS2, one or more time slots ZS * are assigned to the connection by the capacity allocation unit of the geran base station controller GBSC. The number of assigned time slots ZS ^λ depends on the type of data transmitted and thus the size of the radio blocks and / or the distance of the mobile station MSi involved in the connection from the base station BTS ^λ '. If a radio block to be transmitted contains more than 320 bits, the maximum capacity of an δkbps time slot, the connection is assigned several time slots. These time slots can be arranged on different lines of the transmission link or spread over time.

The time slots ZS are assigned dynamically when the connection is established by a signaling message, for example by channel_activation (service type, TRX number, time slot number, resource list). If the time slots ZS ^{X are} on different physical links,

only three 16kbps time slots needed. The superfluous two time slots are released back into the reserved transmission capacity and are available to other connections.

The packet data control unit PCU ¹ in FIG. 3 can also be integrated into the base station BTS '' instead of in the base station control BSC '. Then the segmentation of the radio or radio bio for packet data no longer takes place in the base station controller BSC ^■ but only in the base station BTS ' ¹ , ie also that the frame relay, ATM or IP data are transmitted via Gb and Iu are forwarded by the BSC Basistationssteuerung 'to the base station BTS' ^■ must and that the base station BTS ^'1 in their central unit (core unit) c0re ^x has a packet data interface.

In this case, the capacity allocation unit RP in the base station unit BSC 'can assign a variable number of time slots to the frame relay, ATM or IP data from the set of managed time slots, which depends on how many time slots are required for the voice services ,

Claims

claims

1. A method for data transmission in a radio communication system comprising different units, in which the data transmission between two units of the radio communication system takes place over a transmission path on which a predetermined transmission capacity in the form of a set of time slots is reserved,

- In which, when establishing a connection for voice or data transmission, the connection is assigned one or more time slots from the reserved transmission capacity, via which the data transmission takes place between the units, the number of time slots allocated to the connection depends on a service transmitted over the connection,

- In which, after the connection is terminated, the time slots assigned to the connection are released and are again available as part of the reserved transmission capacity.

2. The method according to claim 1, wherein the transmission link is designed as a line, radio link, light guide, power line communication and / or satellite connection.

3. The method according to claim 1 or 2,

in which, when the connection between a mobile station and the radio communication system is established, an estimate is made of how many time slots are to be assigned to the connection,

- this estimate depends on the distance of the mobile station from a base station measured by the lead time (timing advance), this estimate depends on the reception level (RXLEV) or signal-to-noise ratio of the access (Channel_Request), - This estimate also takes into account the capacity requirement of the last connection of the same subscriber and the elapsed time since the last access.

4. The method according to any one of claims 1 to 3, in which the time slots which are assigned to the connection are numbered consecutively.

5. The method of claim 4, wherein on a multiplexed channel with several participants, all participants have the same time slot numbering on all time slots.

6. The method of claim 4 or 5, wherein the sending unit segments larger data packets according to the numbering on the time slots and the received unit assembles these data packets accordingly.

7. The method according to any one of claims 4 to 6, wherein the numbering in the time slots is also transmitted.

8. The method according to any one of claims 1 to 7, in which associated time slots are identified by means of an unambiguous identification feature.

9. The method according to any one of claims 1 to 8, wherein a time slot is declared as the main time slot and this main time slot has the smallest number.

10. The method according to claim 9, wherein the relevant inband signaling of the connection takes place predominantly on the main time slot.

11. The method according to any one of claims 1 to 10,

- In which time information is transmitted in each of the time slots, from which the time position of the respective Time slot transmitted data segments can be derived in relation to the original data.

12. The method according to any one of claims 1 to 11, in which the time slots are synchronized independently of one another in their time position.

13. The method according to claim 11, in which the time position of the time slots is continuously readjusted by means of the transmitted time information.

14. The method according to any one of claims 1 to 13, in which in the event of a time slot failure or loss of synchronism of a time slot, the data transmission is continued on the remaining time slots.

15. The method according to any one of claims 1 to 14, wherein the connection is assigned a smaller number of time slots if the number of requested time slots is not available in the reserved transmission capacity.

16. The method according to any one of claims 1 to 15,

- in which connections with lower priority and connections with higher priority are defined,

- In the case of connections with lower priority, release time slots for a connection with higher priority if the number of requested time slots for a connection with higher priority is not available in the reserved transmission capacity.

17. The method as claimed in claim 16, in which low-priority connections are shifted to other cells if the number of requested time slots for a higher-priority connection is not available in the reserved transmission capacity.

18. The method according to any one of claims 1 to 17, in which a connection is shifted to another cell with free transmission capacity if the number of requested time slots of this service is not available in the reserved transmission capacity of the original cell.

19. The method according to any one of claims 1 to 18, wherein during the connection, the number of assigned time slots is dynamically adapted to the requirements of the connection.

20. The method according to claim 19,

- After the connection is established, a periodic check is carried out to determine whether the number of assigned time slots corresponds to the current requirements of the connection, and in the event that the number of assigned time slots is less than the current requirement of the connection, the connection additional time slots are allocated from the reserved transmission capacity,

- In the event that the number of assigned time slots is greater than the current requirement of the connection, the connection assigned time slots that are not required are released.

21. The method according to any one of claims 1 to 20,

- in which the base station controller controls several base stations,

- in which a subset of the specified transmission capacity is reserved for each base station, from which time slots are allocated for connections via the respective base station.

22. The method according to any one of claims 1 to 21, in which subsets of the reserved transmission capacity are reserved for different services, transmission paths and / or transmission methods.

23. The method according to claim 9 or 22, in which at least one base station, a service, a transmission path or a transmission method is reserved a subset of the reserved transmission capacity, which has a predetermined minimum size.

24. The method according to claim 21 or 22, in which the size of the subsets is changed dynamically as a function of the connection volume.

25. The method of claim 23 or 24, wherein a base station, a service, a transmission path or a transmission method uses the reserved but free transmission capacity of another base station, another service, another transmission path or a different transmission method, if necessary, this transmission - However, the supply capacity is available again when required.

26. The method according to any one of claims 22 to 25, wherein the size of the subsets is dimensioned such that the sum of the subsets is smaller than the total reserved transmission capacity.

27. The method according to claim 22, in which at least one service, transmission path or transmission method is assigned an increased priority,

- in which when a connection is first established, the requirements for connections for the at least one service,

Transmission path or transmission method with increased priority are met and then the requirements of connections for services, transmission paths or transmission methods are processed without increased priority and / or

- In the case of a connection establishment and scarce free transmission capacity, the requirements of connections for the at least one service, transmission path or transmission method with increased priority are met by providing existing connections of lower priority with transmission capacity.

28. Method according to one of the preceding claims, in which unused reserved transmission capacity is used for signaling, software download and other internal data traffic between the base stations and the controller.

29. The method according to any one of claims 1 to 28, wherein the units of the radio communication system between which the data transmission takes place, a base station and a base station controller, a base station controller and a transcoding unit (Transcoding and Rate Adaptation Unit) and / or one Transcoding and rate adaptation unit and a mobile switching center.

30. Base station system with a base station and a base station controller, in which the base station controller has a capacity allocation unit, which is designed such that the sequence of a method according to one of claims 1 to 29 is controlled therein.

31. Base station system according to claim 30, in which the capacity allocation unit generates statistics about the utilization of the reserved transmission capacity, the number of successful and failed connection setups or connection modifications and forwards these to an operation and maintenance center.

32. Radio communication system with at least one base station, at least one base station controller, at least one

Mobile switching center, at least one transcoding unit (Transcoding and Rate Adaptation Unit TRAU) and at least one packet data node, which is designed such that the execution of a method according to one of claims 1 to 30 on at least one of the interfaces between the mobile switching center and the transcoding unit (Transcoding and Rate Adaptation Unit), between base station and base station controller, between base station controller and transcoding and rate adaptation unit and / or between mobile switching center and packet data node.