
Литература / UMTS-Report
.pdf
UMTS 30.06 version 3.0.0 |
551 |
|
|
|
|
|
|
|
|
TR 101 146 V3.0.0 (1997-12) |
||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Figure 2.3 Part of a hierarchical cell structures (HCS) environment
The ASD approach can be further extended when considering hierarchical cell structures (HCS). Different services classes which are associated with different bearer classes can be provided in different cell layers. This allows for an additional means of optimization of the network structure. By setting out from the measurement results of the quality parameters addressed before, the allocation of users to the different hierarchies in the HCS environment is done. The HCA based resource allocation will then be done within each cell layer.
In Figure 2.3, a part of a HCS environment is depicted. The lowest hierarchy is presented by a network of macro cells which are assumed to be hexagonal. Within the macro cells, Manhattan grid like micro cellular structures are located. Within buildings, pico cells can be used. Furthermore, special small macro cells are used to provide service to e.g. high speed trains or motorways. The ASD approach supports seamless handover between different cell layers and within the cell layers. The handover is based on the measurement results of the aforementioned quality parameters.
The ASD approach allows the utilization of different services with varying QoS criteria by various users when simultaneously maintaining a high spectral efficiency. Also, different services with different QoS criteria can be used by a particular user with high spectral efficiency.
3. Examples of mapping of bearer services on physical channels
3.1 Overview
In the case of WB-TDMA/CDMA, the total number of available basic physical channels per TDMA frame is given by the maximum number of time slots which is 8 and the maximum number of CDMA codes per time slot which is 8 in case the different codes within one time slot are allocated to different users in the uplink and which is 12 in the downlink and 9 in case the different codes within one time slot are allocated to one and the same user in the upand downlink. The total number of basic physical
UMTS 30.06 version 3.0.0 |
552 |
TR 101 146 V3.0.0 (1997-12) |
channels can be achieved by different combinations of numbers of codes and numbers of time slots when taking into account the maximum numbers mentioned before.
The service classes given in the following represent only a selection of all possibilities which are conceivable. Further adaptations of the services can be made based on the aforementioned environmental conditions and actual network capabilities.
3.2 Low user bit rate services
3.2.1 Speech service
The speech service with a user data rate of 8 kbit/s is transmitted by using the spread speech/data bursts of FMA1. In macro cellular environments, the burst 1 is used whereas in micro and pico cellular environments, the burst type 2 is used. To provide an 8 kbit/s service, 150 user bits per four frames of length 4.615 ms have to be transmitted over the air interface. This block size of 150 user bits is regarded as the basic input block size for the speech service in what follows. In layer 2, up to 5 % (7 to 8 bits) overhead can be added for signaling purposes.
In this section, three different possibilities of service mapping for the speech service are given. This mapping can be used in different environments and different transmission conditions.







UMTS 30.06 version 3.0.0 |
559 |
TR 101 146 V3.0.0 (1997-12) |
3.3.2 50% speech + 50% UDD 384
Assume that one Erl is related to a simultaneous connection consisting of speech and UDD 384. In this case, between 1 and 2 Erl can be offered per carrier. Thus, a maximum of 2 simultaneous connections are supported per carrier. This is also the case when each user simultaneously entertains a speech and a UDD 384 connection.
Assume that a user only uses one type of service, be it speech or UDD 384. In this case between 1 and 2 speech users can coexist with between 1 and 2 UDD384 users.
Figure 3.7 illustrates a possible implementation of the service mix for the case of UDD 384 packets containing 12N3600 bits each.
The service mix is based on the speech service described in Figure 3.3. The UDD 384 service uses 12 blocks each with a size of 3600 bits and a coding rate of 1/3. After additition of the layer 2 overhead and puncturing the 6528 bits are mapped onto 3264 symbols interleaved and distributed over 24 TDMA frames. In this case, 2 Erl of (50% speech + 50% UDD 384) service mix can be supported per carrier. In the following, one Erl of this service mix will be described by using Figure 3.7.
Figure 3.7 shows six consecutive speech PDU's of 150 bits each and twelve consecutive UDD 384 PDU's containing 3600 bits each. All these PDU's must be distributed and transmitted in 24 successive TDMA frames as shown in Figure 3.7.
With the considered speech service one slot of every second TDMA frame must be used. In our case slot #8 of the odd numbered TDMA frames is allocated to speech transmission. To support UDD 384, slots #9…#16, #33…#40, and #57…#64 of each TDMA frame are used for UDD 384 related traffic.
After allocating further resources to a second Erl of the (50% speech + 50% UDD 384) service mix, still 15 slots of each odd numbered and 16 slots of each even numbered TDMA frame are unallocated. In these slots, up to 31 Erl of extra speech service could be provided.
L2 |
|
|
...PDU |
|
... |
|
|
|
|
|
|
|
|
|
...PDU |
|
... |
|
|
|
|
|
|
|
|
|||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||||||||||||
L1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||||||||||||||||||
1 |
|
|
6 |
|
|
|
1 |
|
|
|
|
12 |
|
|
|
|
|
|
|
|
||||||||||||||||||
|
150 bits |
x |
|
|
|
|
150 bits |
x |
|
3600 bits |
|
x |
|
|
|
3600 bits |
|
x |
|
|
coding rate |
|||||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1/3 |
||
|
450 bits |
3.x |
|
... |
|
450 bits |
3.x |
|
10800 bits |
3.x |
|
... |
10800 |
bits |
3.x |
|||||||||||||||||||||||
|
|
|
|
|
|
|
puncturing |
|||||||||||||||||||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||
|
|
272 bits |
|
|
|
|
|
|
272 bits |
|
|
6528 bits |
|
|
|
|
6528 bits |
|
|
|
|
modulation |
||||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
(QPSK) |
|
136 symbols |
|
|
136 symbols |
|
3264 symbols |
|
|
3264 symbols |
|
||||||||||||||||||||||||||||
|
|
|
|
|
|
|
|
interleaving |
||||||||||||||||||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
... |
|
|
|
|
|
|
|
|
|
... |
|
|
|
|
|||||
|
1 |
|
3 |
4 |
|
|
1 |
|
2 |
3 |
4 |
|
1 |
2 |
3 |
4 |
24 |
|
1 |
2 |
3 |
|
24 |
|
|
code |
8 |
|
... |
|
|
||
|
|
|
|
|
1 1 2 |
5 |
8 |
|
Frame 0 |
Frame 23 time |
|
Figure 3.7 50% speech + 50% UDD 384 |
