GSM, GPRS, EDGE Radio Interface: Maria Stella Iacobucci

Rio De Janeiro, October 2005
FPLBRA1TIM
Maria Stella Iacobucci
GSM, GPRS, EDGE radio interface
GSM/GPRS/EDGE Radio Interface
FPLHEL1TIM
Rio De Janeiro,
October 2005

2
Special thanks to TILAB, TIM and TILS colleagues for
having provided some of the slides contained in this
presentation
FPLHEL1TIM
Rio De Janeiro,
October 2005

3
Divertissement
FPLHEL1TIM
Rio De Janeiro,
October 2005

4
Why radiomobile services?
To spread out to mobile users quality and capacity of
telecommunication services generally available to
fixed users
To use TLC services wherever through a wireless
terminal and to move during a connection
FPLHEL1TIM
Rio De Janeiro,
October 2005

5
Architectural and procedural requirements of a
radiomobile cellular system
RADIO ACCESS:
propagation
Cellular coverage
Frequency reuse

MOBILITY MANAGEMENT:
User localization
Handover

SECURITY
Access control
Cryptography
FPLHEL1TIM
Rio De Janeiro,
October 2005

6
Radiomobile systems
Connect mobile users to mobile and/or fixed users through the radio
resource, independently from the user position
FPLHEL1TIM
Rio De Janeiro,
October 2005

7
Radiomobile systems
The adoption of a unique illumination point is impossible because:
The used powers would be too high (MW)
the physical resources that could be simultaneously activated would
not be sufficient
FPLHEL1TIM
Rio De Janeiro,
October 2005

8
Radiomobile systems
The ground coverage is realized through many radio base stations
that illuminate contiguous zones that realize service continuity
FPLHEL1TIM
Rio De Janeiro,
October 2005

9
Cellular coverage (pictorial)
Oil on Canvas 1995 by Stephen Linhart (New York)
FPLHEL1TIM
Rio De Janeiro,
October 2005

10
Main GSM radio parameters
Access FDMA/TDMA/FDD
Channel spacing 200 kHz
N
o
TSs/carrier 8
Modulation GMSK (BT = 0.3)
TCH/F - Gross bit rate 22.8 kbit/s
Modulating bit rate
~ 270.8333 kbps (1625/6 kbps)
CS-Data rates 2.4, 4.8, 9.6, 14.4 kbps (per TS)

Uplink
(MHz)
Downlink
(MHz)
Duplex spacing
(MHz)
Bandwidth
(MHz)
P-GSM 900 890 915 935 960 DL = UL + 45 25
E-GSM 900 880 915 925 960 DL = UL + 45 35
GSM 900
R-GSM 900 876 915 921 960 DL = UL + 45 39
DCS 1800 1710 1785 1805 1880 DL = UL + 95 75
PCS 1900 1850 1910 1930 1990 DL = UL + 80 60
GSM 450 450,4 457,6 460,4 467,6 DL = UL + 10 7,2
GSM 400
GSM 480 478,8 486 488,8 496 DL = UL + 10 7,2
GSM 700 GSM 750 747 762 777 792 DL = UL + 30 15
GSM 850 824 849 869 894 DL = UL + 45 25

FPLHEL1TIM
Rio De Janeiro,
October 2005

11
Cellular coverage
Given the available resources (voice channels), the
maximum number of users for a given service quality
can be found with the traffic theory
For example, by using an hypothetic cell with 1000
telephonic channels, the maximum number of
achievable users would be 40000
FPLHEL1TIM
Rio De Janeiro,
October 2005

12
Cellular coverage
In order to increase the number of radio channels, the
frequency reuse is adopted
The same radio channels are used to serve different
areas
The reuse areas must be as far as the iso-channel
interference can be neglected
FPLHEL1TIM
Rio De Janeiro,
October 2005

13
Cellular coverage
FPLHEL1TIM
Rio De Janeiro,
October 2005

14
The cluster
The reuse areas must be as far as the iso-channel
interference can be neglected
The set of cells that can use all the available
frequencies is called cluster
1
8
6
7
2
3
4
9
5
Example of 9 cells cluster
FPLHEL1TIM
Rio De Janeiro,
October 2005

15
1
8
6
7
2
3
4
9
5
1
8
6
7
2
3
4
9
5
8
6
7
3
4
9
5
1
8
7
2
3
9
1
8
6
7
2
3
4
9
5
1
8
6
7
2
3
9
7
7
5
1
2
6 4
9
5
1
8
6
2
3
4
9
5
3
4 6
8
5
Cellular network
The cellular coverage can be obtained by repeating the cluster in the
space
FPLHEL1TIM
Rio De Janeiro,
October 2005

16
Goals
Transmission quality (coverage, performances)
Capacity (available channels)
The frequency reuse produces an increase of the interference
level
In order to increase the system capacity it is necessary to
increase the number of BTS, by reusing the emitted powers
with capillary coverage and link better quality
The main parameter for the performances characterization is the
ratio
Power signal t Interferen
Power signal Useful
I
C
=
FPLHEL1TIM
Rio De Janeiro,
October 2005

17

R
4 2
2
16 R
G G P
C
B m m
t

=
Useful signal
The most unfavorable
condition is when
the MT moves near the
hexagon extremity
FPLHEL1TIM
Rio De Janeiro,
October 2005

18
4
6
1
2
2
1
) 16 (

=
|
.
|
\
|
=
k
B m m
k d
) G G (P
I
t
4
omni
6
1
|
.
|
\
|
=
|
.
|
\
|
R
D
I
C
If dk =D (reuse distance)
C/I computation in the omni directional case
| |
R
D
I
C
1
8
6
7
2
3
4
9
5
1
8
6
7
2
3
4
9
5
1
8
6
7
2
3
4
9
5
D
FPLHEL1TIM
Rio De Janeiro,
October 2005

19
Reuse distance
Cluster with 7 cells
7
3
1
6
2
5
4
7
3
1
6
2
5
4
7
3
1
6
2
5
4 7 1
6
2
5
7
3
1
6
2
5
4
7
3
1 2
4
3 4
i=1
j=2
\(i
2
+j
2
+ij)=\7
FPLHEL1TIM
Rio De Janeiro,
October 2005

20
Reuse distance
Cluster with 21 cells
\7
\21
14
8
1
16
10
9
15
3
19
6
7
5
21
7
3
13
6
20
5
4 12 19
11
7
5
4
18
1
6
2
17
4
7
3
1 2
4
3 2
i=1
j=4
FPLHEL1TIM
Rio De Janeiro,
October 2005

21
Choice of the cluster dimension
By increasing the cluster dimension, the transmission quality
increases

An higher number of BS is required (higher cost), each with a lower
number of channels
The cluster dimension must therefore be the lowest that is necessary
for a given C/I

TACS (C/I)
min
18 dB cluster with 21 cells
GSM (C/I)
min
9 dB cluster with 9 cells
| | |
I
C
R
D
Dim
cluster) (
FPLHEL1TIM
Rio De Janeiro,
October 2005

22
Strategies to augment capacity
Sectorization
Cell splitting (tilting)
Micro cells
Underlay-overlay techniques
GSM 1800
FPLHEL1TIM
Rio De Janeiro,
October 2005

23
Coverage structures
Omnidirectional coverage
Directional coverage
Clover configuration
FPLHEL1TIM
Rio De Janeiro,
October 2005

24
4
2
1
2
2
1
) 16 (

=
|
.
|
\
|
=
k
B m m
k d
) G G (P
I
t
4
2
1
|
.
|
\
|
=
|
.
|
\
|
R
D
I
C
sett.
ni sett.
I
C
I
C
om
3
|
.
|
\
|
=
|
.
|
\
|
C/I calculation in the sectorial case
If d
k
=D (reuse distance)
1
8
6
7
2
3
4
9
5
1
8
6
7
2
3
4
9
5
1
8
6
7
2
3
4
9
5
D
D
FPLHEL1TIM
Rio De Janeiro,
October 2005

25
Is used when cells available channels can not be increased
If the cell is divided into 4 cells, the traffic will be quadrupled
After n split T
n
= T
0
(4)
n

2
1
4
3
3
4
2
1
Cell splitting
FPLHEL1TIM
Rio De Janeiro,
October 2005

26
Micro cells
Micro cells can be used to serve hot spot locations, that are
coverage-limited zones but with high required capacity
Possibility to satisfy high traffic requirements in very localized
zones

GSM900 Loss (dB)=132.8+38log(d[Km])
GSM1800 Loss (dB)=142.9+38log(d[Km])
FPLHEL1TIM
Rio De Janeiro,
October 2005

27
Overlay/underlay technique (I)
The total assigned radio bandwidth is divided into two channel
blocks
The first uses a canonic cluster (underlay cells )
The second uses cells having a lower area (overlay cells ),
which allows, with the same C/I, a cluster of lower dimension
and therefore a lower normalized distance
Overlay cells share with the underlay:
Sites
Antenna systems
Control channels
hand-over control devices
FPLHEL1TIM
Rio De Janeiro,
October 2005

28
Overlay/underlay tecnique (II)
underlay cells overlay cells
Overlay cells allow an higher frequency reuse and therefore an
higher number of available channels
The traffic lost from the overlay cells, if in congestion, is offered as
overflow traffic to the underlay
FPLHEL1TIM
Rio De Janeiro,
October 2005

29
1
1
2
2
3
3
4
4
5
5
6
7
Different propagation characteristics:
depend on the BS position,
antennas high, terrain characteristics, etc.
Cells dimensions are different
Non uniform traffic and
users distribution
Each cell needs a different
number of carriers
1
1
2
2
3
3
4
4
5
5
6
7
7
(real)
(Theoric)
6
Radio cells coverage
FPLHEL1TIM
Rio De Janeiro,
October 2005

30
Real coverage
FPLHEL1TIM
Rio De Janeiro,
October 2005

31
The GSM cell
The GSM cell can be represented as a traditional telephone system
characterized by a certain resource configuration and performances
which are function of the available capacity and offered load
performances
(loss)
GSM cell
Offered load
Number of carriers
Number of signalling channels
Which model to use
for the radio resource
dimensioning?
FPLHEL1TIM
Rio De Janeiro,
October 2005

32
Erlang-B formula
The Erlang-B formula represents (historically) the first used model
to dimension the GSM cell resources
The model is based on a mono-dimensional Markov chain
which describes the resource occupation modalities of the offered load
Define:

N number of channels in the cell

arrival frequency of voice calls (Poisson process)

t average duration of voice calls
FPLHEL1TIM
Rio De Janeiro,
October 2005

33
Erlang-B formula
A telephone system constituted by N resources can be analized through the
Erlang model where the generic state is described by the number of
occupied channels, that is by the number of users that are in the system
t
1
=
Calls frequency of dead
(service times with exponential distribution and parameter )
The dead frequency is proportional to the number of connected users

(i-1) i N
2 3
(N-1)
Blocking state
1 0

2 3 i-1 i

N-1 N
FPLHEL1TIM
Rio De Janeiro,
October 2005

34
Loss of a cell with N
channels and an erlang
offered load of A
The Erlang-B formula
The Erlang-B formula allows to evaluate the performances of a
GSM cell (loss) equipped with N time slot and an offered load of

A = /
( )
=
=
+ + + + +
=
N
i
i
N
N
N
i
A
N
A
N
A A A
A
N
A
N B
0
3 2
!
!
!
...
! 3 ! 2
1
!
The loss B(N) goes to zero when N increases
The loss B(N) goes to one when A increases
FPLHEL1TIM
Rio De Janeiro,
October 2005

35
The Erlang-B formula
The Erlang-B formula is used in GSM following different modalities
Performance
evaluation
Offered load
estimate
Resource
dimensioning
Erlang-B
Erlang-B
(inverse)
Offered load Loss (call & traffic congestion) Numebr of carries
Erlang-B
(inverse)
Offered load
Number of carriers
Offered load
Signalling channels possible configurations
Required loss
Passed traffic
Number of carriers
iterative use of
the Erlang-B
formula
FPLHEL1TIM
Rio De Janeiro,
October 2005

36
Erlang-B: some application examples
30 TCH
10 Erlang off.
B = 0
30 TCH
20 Erlang off.
B = 0.85%
30 TCH
30 Erlang off.
B = 13.25%
30 TCH
40 Erlang off.
B = 29.93%
50 Erlang off.
B = 0.1%
71 TCH
50 Erlang off.
B = 2%
61 TCH
50 Erlang off.
B = 10%
51 TCH
50 Erlang off.
B = 30%
37 TCH
40 TCH
10 Erlang ps.
10 Erlang off.
B = 0
40 TCH
25 Erlang ps.
25.0 Erlang off.
B = 0.14%
40 TCH
35 Erlang ps.
39.0 Erlang off.
B = 10.3%
40 TCH
39 Erlang ps.
76.2 Erlang off.
B = 48.8%
Performance evaluation
Dimensioninig
Offered load estimate
FPLHEL1TIM
Rio De Janeiro,
October 2005

37
The multiserivice Erlang formula
The Erlang-B can be applied to a single service
The coexistence of single rate and dual rate GSM terminals and
the fact that cells can handle both full rate
and half rate voice coding, bring to the use of the
Erlang-B formula for a multiservice traffic model
FPLHEL1TIM
Rio De Janeiro,
October 2005

38
.
.
.

B
1
B
2
B
3
B
4
B
n
The multi service Erlang formula
Multiservice Erlang

Capacity C
TOT
(number of channels)
.
.
1
, t
1
, C
1
2
, t
2
, C
2
3
, t
3
, C
3
4
, t
4
, C
4
N
, t
N
, C
N
Traffic load of the i-th service: A
i
=
i
t
i

Required capacity of a connection: C
i
Calls arrival frequency
Average service time
The Markov chain used to evaluate performances is N-dimensional
the generic state is described by an N-ple of variables which express
the number of users of each service
TOT
N
i
i i
C C n s
=1
N users can be admitted to the
system if

FPLHEL1TIM
Rio De Janeiro,
October 2005

39
1
1
1
C
TOT
/3
1
Assume:

C
1
= 3, C
2
= 1 and C
TOT
multiple of three

The Markov chain assumes the following form
Blocking states for
both traffic types
Blocking states for
traffic 1
1
C
TOT
/3,0
C
TOT
/3-1,1 C
TOT
/3-1,2 C
TOT
/3-1,3
0,C
TOT
1,C
TOT
-3

1,0 1,1 1,2 1,3 1,4
0,1 0,2 0,3 0,4 0,0
C
TOT
/3-1,0
2
2
2
3
2
4
2
2
2
2
3
2
4
2
3
2
2
2
2
FPLHEL1TIM
Rio De Janeiro,
October 2005

40
Application to the GSM case with attivation of dual rate resource

SR

DR
t
SR
= t
DR
= t C
SR
= 2 C
DR
= 1 N
TCH
= 3
DR
DR
DR
DR
DR
DR
DR
DR
DR
DR
DR
DR
2

3

4

5

6

2

3

4

SR
SR
SR
SR
SR
SR
SR
SR
SR
3

2

Blocking states
for both traffic
types

Blocking states
for single rate traffic
TCH DR SR
N U U s + 2 2
Generic state admission
condition
Number of SR
users
Number of DR
users

0,5
3,0
1,0 1,1 1,2 1,3 1,4
2,2 2,1 2,0
0,0 0,1 0,2 0,3 0,4 0,6
FPLHEL1TIM
Rio De Janeiro,
October 2005

41
The use of multi service Erlang formula for a GSM cell performance evaluation
implies some assumptions
An half rate channel is assigned if exists a half time slot which
has remained free afted the other half occupied from a
conversation
When an half rate call terminates, an other half rate call
occupies the same time slot if it has to be filled
Each mobile terminal asks for the traffic channel dependig on its
own characteristics, that is a half rate source if is a dual rate
terminal and a full rate source if is a single rate terminal
The cell assigns the resource in order to minimizes the whole
occupation
FPLHEL1TIM
Rio De Janeiro,
October 2005

42
The multi service Erlang formula: some application examples
30 TCH
4 Erl. off. SR
6 Elr. off. DR
B
TOT
= 0
B
SR
= 0
B
DR
= 0
30 TCH
8 Erl. off. SR
12 Erl. off. DR
B = 0
B
SR
= 0
B
DR
= 0
30 TCH
12 Erl. off. SR
18 Erl. off. DR
B = 0.72%
B
SR
= 1.09%
B
DR
= 0.48%
30 TCH
16 Erl. off. SR
24 Erl. off. DR
B = 7.76%
B
SR
= 11.06%
B
DR
= 5.4%
Performances evaluation
20 Erl. off. SR
30 Erl. off. DR
B
TOT
= 0.1%
51 TCH
20 Erl. off. SR
30 Erl. off. DR
B
TOT
= 2%
43 TCH
20 Erl. off. SR
30 Erl. off. DR
B
TOT
= 10%
36 TCH
20 Erl. off. SR
30 Erl. off. DR
B
TOT
= 30%
25 TCH
Dimensioning
Consider that dual rate terminals are the 60% of the total:
FPLHEL1TIM
Rio De Janeiro,
October 2005

43
Antennas of BS GSM
FPLHEL1TIM
Rio De Janeiro,
October 2005

44
P
in
= P
r
+P
0

P
t
=q P
o

q

antenna efficiency
p power density (W/m
2
)

Electrical parameters
P
in

P
0

P
t

G(u,|)
p (u,|)
Gmax
p
max

P
r
,
( )
2
0 4 /
) , (
) , (
r P
p
G
t
| u
= | u
FPLHEL1TIM
Rio De Janeiro,
October 2005

45
Gain and radiation diagram
The radiation diagram is G(u,|)/Gmax
Very often it is sufficient to represent the antenna irradiation in a vertical
and horizontal plane
vertical diagram (dB)
-25
-20
-15
-10
-5
0
180
-170
-160
-150
-140
-130
-120
-110
-100
-90
-80
-70
-60
-50
-40
-30
-20
-10
0
10
20
30
40
50
60
70
80
90
100
110
120
130
140
150
160
170
horizontal diagram (dB)
-25
-20
-15
-10
-5
0
180
-170
-160
-150
-140
-130
-120
-110
-100
-90
-80
-70
-60
-50
-40
-30
-20
-10
0
10
20
30
40
50
60
70
80
90
100
110
120
130
140
150
160
170
Example: sectorial antenna
FPLHEL1TIM
Rio De Janeiro,
October 2005

46
Antennas tilt
tilt angle
tilt angle
Vertical diagram
Horizontal diagram
FPLHEL1TIM
Rio De Janeiro,
October 2005

47
Diversity techniques
Create, at the reception side, two radio-electric paths
sufficiently non correlated
By combining the two paths a better signal is obtained
The ratio between the combined signal and the higher single
signal is called improvement factor
FPLHEL1TIM
Rio De Janeiro,
October 2005

48
Space diversity
In presence of multiple reflections the signals that arrive to
spatially separated antennas are sufficiently uncorrelated
The antennas must be horizontally spaced of 15 20
5 m 6,6 m at 900 MHz
2.5 m 3,3 m at 1800 MHz
The attended improvement factor is of 5 dB
5m (900MHz)
Rx 1 Rx 2
2,3 m
0,38 m
FPLHEL1TIM
Rio De Janeiro,
October 2005

49
Safety volume
The safety volume is the portion of space out of which are respected the
electromagnetic field exposition limits
People cannot be into the safety volume

FPLHEL1TIM
Rio De Janeiro,
October 2005

50
Used to improve the coverage in shadow zones and with low traffic
Repeaters
Service area
Pick-up Antenna
Service Area Antenna
FPLHEL1TIM
Rio De Janeiro,
October 2005

51
Fiber optic repeaters
BTS
O
E
E
O
RF-Rx
RF-Tx
Service area
Fiber optic repeaters are connected with the BTS through a
physical (electro-optical optic) connection
FPLHEL1TIM
Rio De Janeiro,
October 2005

52
Coverage
Powers must be controlled to minimize interferences, and to
assure a good signal level
Radio BTS antennas must be installed such that there are
not obstacles which limit the coverage
Antennas must be installed by respecting electromagnetic
limits.
FPLHEL1TIM
Rio De Janeiro,
October 2005

53
GSM network architecture
BSC
BSC
MSC
VLR
MSC/VLR area
GMSC
MSC
MSC
HLR HLR HLR
BSC
BSC area
Other Networks
BTS
MS cell
FPLHEL1TIM
Rio De Janeiro,
October 2005

54
Network elements: Mobile Station
MS=ME+SIM
MS=Mobile station
ME=Mobile Equipment
SIM= Subscriber Identity Module
Principal functions
radio transmission
Control channels supervision
Cell selection
downlink parameters measurements (BER, received power)
and transmission to the BTS
Execution of access, authentication, hand-over procedures
FPLHEL1TIM
Rio De Janeiro,
October 2005

55
GSM numeration and identity (I)
MSISDN (Mobile Station ISDN Number)
Is the mobile subscriber number
CC | NDC | SN
CC Country Code;
NDC National Destination Code;
SN Subscriber Number
IMSI (International Mobile Subscriber Identity)
Identifies permanently the SIM in the radiomobile network
Is in the HLR and in the SIM and is transmitted rarely
MCC | MNC | MSISDN
MCC Mobile Country Code; identifies a nation
MNC Mobile Network Code; identifies a PLMN in this nation
MSIN Mobile Subscriber Identification Number identifies the
subscriber
FPLHEL1TIM
Rio De Janeiro,
October 2005

56
Numeration and identity in GSM (II)
TMSI (Temporary Mobile Subscriber Identity)
Temporary identity, alternative to the IMSI and given on
localization area basis
IMEI International Mobile Equipment Identity
Univocally identifies the mobile terminal with information
on the type and production establishment
FPLHEL1TIM
Rio De Janeiro,
October 2005

57
Base Station Subsystem (BSS)
BSS=1 BSC + 1 ore more BTS
BSC: Base Station Controller
BTS: Base Transceiver Station
The BTS covers a cell and includes one or more BTX, each
associated with a carrier (8 TDMA channels)
FPLHEL1TIM
Rio De Janeiro,
October 2005

58
Base Transceiver Station (BTS)
Executes the following functions:
Radio Transmission
Measures the up-link performances and transmits to
the BSC
Free channels supervision
Timing advance calculation
Execution of procedures (paging, broadcasting of
cell parameters)

FPLHEL1TIM
Rio De Janeiro,
October 2005

59
Base Station Controller BSC
Typical functions
Control of the BTS included in the BSS
Connection of the traffic channels between BSC and MSC
Radio channel management (allocation and release)
Intra BSC (inter BTSs) hand-over
Optional functions
Power control
Pre-elaboration of measurements
Voice transcoding from radio interface coding to standard PCM
Such function is demanded to a dedicated entity named TRC
FPLHEL1TIM
Rio De Janeiro,
October 2005

60
Mobile Switching Center MSC
Central office for switching and call control from and to GSM
users
Has interfaces with
BSS, MSC, VLR, HLR
Other networks (PSTN, ISDN,..).
Principal functions
Call handling (from and to GSM users)
Mobility handling (inter work with VLR and HLR)
Paging
Intra MSC (inter BSSs) Hand-Over
Inter MSC Hand-Over
toll-ticket generation
The VLR is typically associated to the MSC
FPLHEL1TIM
Rio De Janeiro,
October 2005

61
Visitor Location Register VLR
Data base associated to the MSC, with information on the visitors in the
MSC area
Semi-permanent data (moved from the HLR)
MSISDN, IMSI
Priority class
Service profile
Temporary data
TMSI
LAI (Location Area Identifier)
Authentication and ciphering parameters
FPLHEL1TIM
Rio De Janeiro,
October 2005

62
Home Location Register HLR
Contains semi-permanent and temporary data
semi-permanent data
Identify the subscriber, IMSI and MSISDN;
Subscriber base and supplementary services
temporary data
Identifies the VLR where the MS is currently registered
The state, authentication key, TMSI and MSRN.
the AUC and EIR are associated to the HLR
FPLHEL1TIM
Rio De Janeiro,
October 2005

63
AUC, EIR & OMC
AUC: AUthentication Centre
Generates parameters for user authentication and traffic
ciphering, sent to the HLR and under require to the VLR
The EIR is a database which allows to the network to
verify if the Mobile Equipment (through the IMEI) is
authorized for the network access
Operation & Maintenance Centre OMC
Allows supervision and control of MSC, BSS, HLR, VLR
entities

FPLHEL1TIM
Rio De Janeiro,
October 2005

64
Handover
The hand-over procedure
Rapidly discriminates the cell crossing
Switches the conversation on a channel of the new
cell (if available)
Guaranties the minimum C/I levels specified in
phase of frequency planning

FPLHEL1TIM
Rio De Janeiro,
October 2005

65
BTS2
BTS1
Cell 1
Cell 2
Handover
Traffic channels
Adiacent cells channels
FPLHEL1TIM
Rio De Janeiro,
October 2005

66
Parameters used in handover
Power level in the Uplink and Downlink channel
BER on UL and DL
Base-mobile distance (estimated from the BTS)
Power level relative to adjacent cells
Such measures are elaborated and compared to the relative
handover thresholds; on such basis is written an handover
list
FPLHEL1TIM
Rio De Janeiro,
October 2005

67
Signaling beacon channels
BTS
Downlink beacon channel Uplink beacon channel
MS
MS
CELL
CODE
# cella
LAI # LA
PAGING # user
LA
UPDATE
# user # LA
OUTGOING
CALL # user
# destination
Message ID Field 1 Field 2 Message ID Field 1 Field 2
FPLHEL1TIM
Rio De Janeiro,
October 2005

68
Location Area
Location area
Is a group of BTS where the VLR localizes the MS
for the incoming calls
The area managed from the same VLR can include
more than one Location Area
Location Area # i
Location Area # j
FPLHEL1TIM
Rio De Janeiro,
October 2005

69
Location Area Updating (I)
On the beacon in downlink the location area code is
transmitted
The mobile compares the received code with the memorized
one
If the code has varied the mobile communicates to the SRB
the actual location are (through the uplink control channel)
If the new location area belongs to the same VLR, nothing is
forwarded to the HLR
If the new location area belongs to another VLR, the old VLR
communicate to the HLR to update the list and to order to
the old VLR to delete the user

FPLHEL1TIM
Rio De Janeiro,
October 2005

70
Forced Location Area Updating
old LA# i
new LA#j
LA Updatingl
old LA# i
new LA#i
no action
old LA# i
new LA#i
no action
FPLHEL1TIM
Rio De Janeiro,
October 2005

71
MSRN Mobile Station Roaming Number
Is a number belonging to the numeration plane of the visited
MSC and assigned to a mobile station when registered to a
certain VLR
L'MSRN is backward transmitted to the VLR and then to the
MSC to route the call to the visited MSC
FPLHEL1TIM
Rio De Janeiro,
October 2005

Fixed-Mobile call
MSC
GMSC
HLR
PSTN
BTS
BSC
BTS
BTS
BTS
BSC
LAi
LAj
VLR
VLR
2
MSISDN
3
1
Asks for MSRN (uses IMSI)
MSRN
4
MSRN
5
6
: Send Routing Information
2
3
: Provide Roaming Number
FPLHEL1TIM
Rio De Janeiro,
October 2005

73
Confidential nature
The client is identified from IMSI and Ki key, memorized in:
SIM (MS side)
HLR (network side)
The authentication key Ki is never sent on the radio interface
IMSI is substituted, in the LA, from a temporary identity called
TMSI which is transmitted to the MS
TMSI substituted IMSI in the LA and goes with LA#
When VLR changes the network can request IMSI
FPLHEL1TIM
Rio De Janeiro,
October 2005

74
Authentication (I)
AUC, by using Ki and the casual number RAND, generates,
through A3 and A8 algorithms:
SRES=A3(RAND,Ki) Signed Response
Kc= A8(RAND,Ki) ciphering keys
Through subsequent applications of the algorithm with
different casual numbers, the triplets sent from AUC to VLR
are obtained:
[RAND(128 bit), SRES(32bit), Kc(64bit)]
FPLHEL1TIM
Rio De Janeiro,
October 2005

75
Authentication (II)
RAND is sent to the MS
The MS calculates SRES which is transmitted to the VLR
and then to the MS
If SRES=SRES (which is memorized to the VLR), the
authentication is complete
FPLHEL1TIM
Rio De Janeiro,
October 2005

76
Authentication(III)
IMSI
Ki
MS
IMSI
[RAND,
SRES, Kc]
IMSI
[RAND,
SRES, Kc]
IMSI
Ki
VLR
HLR
AUC
A3 | A8
Ki RAND
SRES
Kc
[RAND, SRES, Kc] [RAND, SRES, Kc]
=
A3 | A8
RAND
Ki
RAND
Kc
OK
SRES
SRES
BS
FPLHEL1TIM
Rio De Janeiro,
October 2005

77
Encryption (I)
Is applied on the useful data block (114 bit) contained in the
burst
The A5 algorithm generates a ciphering sequence, different
burst to burst, through the Kc key (64 bit) and the frame number
FN (22 bit)
The ciphering sequence is added in XOR to the informative part
of the bursts and then is transmitted
In Rx the message is deciphered adding in XOR the received
sequence and the ciphering the reconstructed sequence
FPLHEL1TIM
Rio De Janeiro,
October 2005

78
Encryption (II)
A8
Ki
Kc
RAND
SIM-AUC
BTS
A5
Kc
Ciphering
sequence
(114 bit)
MS
+
TDMA FN
Message
(114 bit)
A5
Kc
Ciphering
sequence
(114 bit)
+
TDMA FN
Ciphered
message
(114 bit)
Deciphered
message
(114 bit)
FPLHEL1TIM
Rio De Janeiro,
October 2005

79
User Data Transmission
Because the GSM system was born for the voice service, to each user is
associated a portion of the radio interface the TCH - for the whole call
duration
Two types of TCH are defined:
TCH/F (Traffic Channel Full Rate) allows the transmission of the
voice coded at 13 kb/s or data at 12.6 and 3.6 kb/s
TCH/H (Traffic Channel Half Rate) allows the transmission of the
voice coded at 7 kb/s or data at 6 and 3.6 kb/s
FPLHEL1TIM
Rio De Janeiro,
October 2005

80
Signaling
Signaling associated to a communication
Each traffic channel is always associated to a channel at low bit rate used for
the signaling transport: the SACCH (Slow Associated Control Channel)
In order to execute urgent procedures, like the call set-up and call release,
the authentication and the handover, a TCH named FACCH (Fast
Associated Control Channel) is used
Non associated signaling
Is used to carry network management information, like the location updating
procedure. For that scope a low bit rate channel is used, the SDCCH
(Stand alone Dedicated Control Channel)

FPLHEL1TIM
Rio De Janeiro,
October 2005

81
Common channels
FCCH (Frequency Correction Channel) and SCH
(Synchronization Channel)
Allows the mobile to synchronize with the BTS
BCCH (Broadcast Control Channel)
Brings the system information, i.e. the network to which
the cell belongs
PAGCH (Paging and Access Grant Channel)
RACH (Random Access Channel)

FPLHEL1TIM
Rio De Janeiro,
October 2005

82
Channels of the radio interface: procedure examples
Location Updating (GSM 3.12)
Channel Request (RACH)
Channel Assignment (AGCH)
Request per Location Updating (SDCCH)
Authentication Request (SDCCH)
Authentication Response (SDCCH)
Ciphering Command (SDCCH)
Ciphering Complete (da adesso la cifratura in atto)
(SDCCH)
Conferma della location updating, includendo la
assegnazione opzionale della TMSI (SDCCH)
Ack della nuova location e del TMSI (SDCCH)
Channel release dalla rete (SDCCH)
MS
Base Station
FPLHEL1TIM
Rio De Janeiro,
October 2005

83
Mobile-Originated call
Channel Request (RACH)
Channel Assignment (AGCH)
Call establishment Request (SDCCH)
Authentication Request (SDCCH)
Authentication Response (SDCCH)
Ciphering Command (SDCCH)
Ciphering Complete (da adesso la cifratura in atto) (SDCCH)
Setup message (indicante il numero desiderato) (SDCCH)
Call Proceeding (la rete instrada verso il numero desiderato)
Assignment di un traffic channel (SDCCH)
Assignment complete (FACCH)
Alerting (il numero chiamato non occupato (ringing)) (FACCH)
Connect (il chiamato risponde) (FACCH)
Connect Ack (FACCH)
Fase di conversazione (TCH)
MS
Base Station
FPLHEL1TIM
Rio De Janeiro,
October 2005

84
Uplink Downlink
/ PCH + BCCH
system information paging
RACH
random access
AGCH
assignment of dedicated control channel
SDCCH
SDCCH
signalling procedure
TCH + SACCH
voice / data traffic or
(FACCH)
measurements
TCH + SACCH
voice / data traffic or
(FACCH)
measurements
Logical channels usage
FPLHEL1TIM
Rio De Janeiro,
October 2005

85
Frame structure in downlink Frame structure in uplink
FPLHEL1TIM
Rio De Janeiro,
October 2005

86
Multiframes structures
FPLHEL1TIM
Rio De Janeiro,
October 2005

87
8.25
TAIL BITS
GUARD
PERIOD
STEALING FLAGS
TRAINING SEQUENCE
3 57 1 26 1 57 3
CODED
INFORMATION/SIGNALLING
1 TIME SLOT = 156,25 PERIODI DI BIT (15/26 ~ 0.577 ms)
Normal Burst structure
FPLHEL1TIM
Rio De Janeiro,
October 2005

88
TAIL BITS
EXTENDED TAIL
BITS
SYNCHRONIZATION SEQUENCE
8 41 36
68.25
EXTENDED
GUARD PERIOD
3
CODED SIGNALLING
INFORMATION
1 TIME SLOT = 156,25 PERIODI DI BIT (15/26 ~ 0.577 ms)
Access Burst structure
FPLHEL1TIM
Rio De Janeiro,
October 2005

89
Mobile 1
Mobile 2
Mobile 3
Mobile 8
TDMA Frame (4.6 ms)
Time slot: 577 s
Signal burst: 546 s
TDMA frame
FPLHEL1TIM
Rio De Janeiro,
October 2005

90
0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7
5 6 7 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 1 2 3 4
Reception frame
Transmission frame
Other stations measurements
Transmission and reception
FPLHEL1TIM
Rio De Janeiro,
October 2005

91
Timing advance
When the MS is near to the BS its transmission is delayed of three time
slots
When a propagation delay has to be taken into account, the
transmission has to be anticipated (timing advance) respect to the
nominal period of three time slots
The timing advance allows the burst to arrive at the BTS in the correct
time window
FPLHEL1TIM
Rio De Janeiro,
October 2005

92
Power control
The link quality is considered good if:
P
r
=P
rif
The excess power contributes to increment the interference level
The power control varies the mobile station and BTS emitted
power in order to use the lower power that guaranties link
Is actuated at steps of 2 dB
in an interval of 20-30 dB for the MS
in an interval of about 30 dB for the BTS
The Power Control in GPRS is more complicate than in GSM because there
is not a continuous bidirectional connection
FPLHEL1TIM
Rio De Janeiro,
October 2005

93
Ideal Power Control
R
r
r
M
B
R
P
T
P
M
P
R
P
RIF
(a)
(a)
(b)
(b)
FPLHEL1TIM
Rio De Janeiro,
October 2005

94
Step Power Control
R
P
T
r
P
R
P
RIF
FPLHEL1TIM
Rio De Janeiro,
October 2005

95
Discontinuous transmission (DTX)
It is not transmitted any signal when nothing has to be transmitted
Lower interference
Higher system capacity
Lower quality
When the user is speaking the voice signal is coded at 13kbit/s
When the user is not speaking the noise characteristics are analyzed and
the parameters are transmitted on the SACCH at 500bit/s and are
updated two times per second
At the reception side such comfort noise is reproduced to maintain the
sensation of connection continuity
FPLHEL1TIM
Rio De Janeiro,
October 2005

96
Discontinuous reception (sleep mode)
Allows the reduction of mobile energy consumption by
periodically switching on and off the MS receiver (in idle mode)
The paging channel is divided into sub-channels whose
organization is described in the BCCH
Paging messages for a given sub-channel are transmitted on a
specific sub-channel (known on IMSI basis)
The mobile station is activated only in correspondence of such sub-
channels (with lower energy consumption)
FPLHEL1TIM
Rio De Janeiro,
October 2005

97
Frequency Hopping
During the same connection the carrier is cyclically varied by
selecting an hopping frequency code
The carrier
Remains the same during the transmission of an entire burst
Changes in the transmission of the subsequent burst
Such frequency diversity guaranties a quality that is uniform for all
the connections
FPLHEL1TIM
Rio De Janeiro,
October 2005

98
Frequency Hopping
f
6

f
3

f
4

f
5

f
2

f
1

f
0

f
7

Frame 1 Frame 2 Frame 3
t
s0
t
s1
t
s2
t
s3
t
s4
t
s5
t
s6
t
s7
t
s0
t
s1
t
s2
t
s3
t
s4
t
s5
t
s6
t
s7

FPLHEL1TIM
Rio De Janeiro,
October 2005

99
GSM radio chain
Source
Channel
Encoder
Interleaver

Ciphering
Propagation channel
Output bits
GSM
Modulator
(BB + RF)
Reordering
&
Partitioning

Transmitter
Burst
Formatter &
Multiplexer
RF, IF Filters
Coherent
Demodulation &
BB Filters
Synchronization
Viterbi Equalizer
GSM BB Demodulator
De-interleaver
De-partition/reordering
Channel Decoder
Burst
De-Multiplexer
& De-Formatter
Deciphering
FPLHEL1TIM
Rio De Janeiro,
October 2005

100
VOICE
CODER
(13 Kbit/s)
CONVOLUTIONAL
CODE
( R = 1/2, LC = 5 )
ADDITION
OF
4 TAIL BITS
53 189 37
8
50
(CLASS 1A)
132
(CLASS 1B)
CHANNEL ENCODER
260 bits
(20 ms)
456
(22.8 kbit/s)
78
(CLASS 2)

REORDERING
185
BLOCK
CODE
(53,50)
TCH/FS channel coding
FPLHEL1TIM
Rio De Janeiro,
October 2005

101
Voice coding Full Rate (FR)
1
10
-1
10
-3
-5 0
C / I (dB)
Class 2 bit
10
-2
5 10 15 20 25
Class 1 bit
BER
FPLHEL1TIM
Rio De Janeiro,
October 2005

102
Class 1
Class 2
Class 1a Class 1b
22 17 73
211
Coded bits
Class 2
228 bit
Parity bits
Voice coding Half Rate (HR)
22
Tail bits
17
3 73 6 17
FPLHEL1TIM
Rio De Janeiro,
October 2005

103
260 bit 260 bit
456 bit
Voice coder: 260 bits in blocks of 20 ms (13 kbit/s) MS - TRAU
Channel coding: 456 bit in blocks of 20 ms (22.8 kbit/s) MS - BTS
Interleaving: 8 blocks of 57 bits (22.8 kbit/s) MS-BTS
Voice coding and interleaving
57 bit 57 bit 57 bit 57 bit 57 bit 57 bit 57 bit 57 bit
Sub-block
FPLHEL1TIM
Rio De Janeiro,
October 2005

104
Signal burst formatting ( voice service)
The sub-blocks are organized in frames, each of 4,6 ms
Each frame contains 16 sub-blocks, belonging to three different blocks following a
diagonal interleaving scheme
The burst structure of 0.577 ms is shown (in the control channels the 8 blocks of 57
bits are distributed in 4 bursts)
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
57
bit
Frame 4.6 ms
57
bit
block A
57
bit
block B
57
bit
block C
8.25
Tail Bits
Guard
time
Signaling
indicators
Midamble (for the synchronization
and channel estimate)
3 57 bit 1 26 1
57 bit 3
FPLHEL1TIM
Rio De Janeiro,
October 2005

105
GSM data channels
In the GSM system data transmission speeds in the TCH/F (gross
speed at 22,8 kbit/s):
data at 9,6 kbit/s (TCH/F9.6)
data at 2,4 kbit/s or at lower speeds (TCH/F2.4)
Even data transmission speeds in the TCH/H (gross speed at 11,4
kbit/s):
data at 2,4 kbit/s or at lower speeds (TCH/H 2.4)
FPLHEL1TIM
Rio De Janeiro,
October 2005

106
184 bit
456 bit
The signaling message is divided into blocks of 184 bit
Each block is coded (including parity, tail and coded bit) to reach 456 bit (22.8 kbit/s);
40 parity bits are with a Fire code and 4 bit at 0 are added bit before applying the
convolutional code (R = 1/2 and K = 5), non punctured.
Signalling messages coding and interleaving
Interleaving (block rectangular interleaver): 8 blocks of 57 bits (22.8 kbit/s); MS-BTS
57 bit 57 bit 57 bit 57 bit 57 bit 57 bit 57 bit 57 bit
FPLHEL1TIM
Rio De Janeiro,
October 2005

107
MSK without Gaussian filtering
Q
I
1 0
MSK constellation
1 bit per symbol
time
-1
0
1
1 1
1
t 3/2 t t
t
-1
0
( ) ( ) ( ) t t f A t s
c m
t + = 2 cos
( ) ( )
u + =
i
i
iT t k t
0

0
t
( ) t u
T -T
FPLHEL1TIM
Rio De Janeiro,
October 2005

108
GMSK: MSK with Gaussian filtering
Q
I
1 0
GMSK constellation
1 bit per symbol
( ) ( ) ( ) t t f A t s
c m
t + = 2 cos
( ) ( )
u + =
i
i
iT t k t
0

Figure from:
Mouly, Pautet: The GSM System for Mobile
Communications
FPLHEL1TIM
Rio De Janeiro,
October 2005

109
GMSK: considerations
The presence of the Gaussian filter allows to have smaller modulated
signal spectrum
In the time domain, the signal do not depend on one only bit (presence
of ISI)
At the receiver site the Viterbi algorithm minimizes the ISI
Figure from:
Mouly, Pautet: The GSM System for
Mobile Communications
FPLHEL1TIM
Rio De Janeiro,
October 2005

110
Evolution
GSM
HSCSD
GPRS
EDGE
UMTS
NO
UMTS
FPLHEL1TIM
Rio De Janeiro,
October 2005

111
GPRS main features
Sharing of radio resources between GPRS and GSM
An MS may be assigned multiple timeslots inside a TDMA
frame
Multiplexing of MSs on the same timeslot
Flexible channel allocation mechanism
Half or full duplex operations
FPLHEL1TIM
Rio De Janeiro,
October 2005

112
GSM/GPRS network architecture
GGSN
MSC/VLR
SGSN
HLR
BSC
Abis
PCU
Gb
Gn
Other packet networks
(i.e. Internet) Gi
Gs
Gr
A
GMSC
Other networks
Other GPRS
networks
Gp
GGSN
Um
FPLHEL1TIM
Rio De Janeiro,
October 2005

PH User Data
BH Info Field BCS BH Info Field BCS BH Info Field BCS
Primary Block
Following Blocks ...
FH Information Field FCS
Normal Burst Normal Burst Normal Burst Normal Burst
Packet (NL PDU)
Frame
(LLC PDU)
Blocks
FH = Frame Header
FCS = Frame Check Sequence
Network layer
SNDCP layer
LLC layer
RLC/MAC layer
Physical layer
BH = Block Header
BCS = Block Check Sequence
data compr./decompr.
segmentation/assembly (not shown)
encryption/decryption
channel coding (FEC)
interleaving
burst formatting
Data Flow
FPLHEL1TIM
Rio De Janeiro,
October 2005

114
Downlink frame structure Uplink frame structure
Example of radio block
FPLHEL1TIM
Rio De Janeiro,
October 2005

115
Radio Blocks
The radio block is the GPRS main element, which can be retransmitted
The retransmission protocol is window based, and a selective
retransmission of errored received radio blocks is performed
The window is composed of 64 radio blocks
FPLHEL1TIM
Rio De Janeiro,
October 2005

116
Data Block
Control Block
RLC/MAC Control Block
Radio block
MAC Hdr
Control Header
(optional)
RLC/MAC Signalling
MAC Header
RLC Data Block
Radio block
RLC Header RLC Data
USF S/P RRBP
Payload
Type
MAC Hdr
Spare bits
(if any)
GPRS Downlink Radio Blocks
USF: Uplink State Flag

FPLHEL1TIM
Rio De Janeiro,
October 2005

117
Data Block
RLC Data Block
Radio block
RLC Header RLC Data
Control Block
RLC/MAC Control Block
Radio block
MAC Hdr
MAC Hdr RLC/MAC Signalling
MAC Header
R
Countdown
value
Payload
Type
SI
MAC Header
R spare
Payload
Type
Spare bits
(if any)
GPRS Uplink Radio Blocks
FPLHEL1TIM
Rio De Janeiro,
October 2005

118
USF Uplink State Flag
S/P: indicates if RRRBP is valid
RRBP: indicates the period when the MS,
addressed from TFI, sends in uplink a
Packet Control Ack or another message
on PACCH
FBI (Final Block Indicator) indicates the last
RLC data block of the current TBF
TFI (Temporary Flow Identity) indicates the
TBF
PR Power Reduction
BSN Block Sequence Number indicates the
RLC data block sequence number inside
a TBF
FS Final Segment indicates the final segment
of an RLC/MAC control message

FPLHEL1TIM
Rio De Janeiro,
October 2005

119
SI: indicates if the window can move
forward
Contdown value: is transmitted in uplink
and is used to calculate the number of
RLC data blocks left in the current TBF
Payload type: individuates an RLC Data
block or MAC/Control Block and, in this
case, if there is the Control Header
TI indicates if there is a field for TLLI
E (Extension) indicates the presence of
an optional subsequent byte in the RLC
header
M (More) indicates if there are bytes for
another LL-PDU which follows the one
inside the RLC data block
FPLHEL1TIM
Rio De Janeiro,
October 2005

120
Modulo-128 numbering of the RLC Data Blocks within one TBF
Sending window of 64 blocks, then waiting for
acknowledgement (ACK/NACK)
Each temporary ACK/NACK acknowledges a given number of
blocks, thus moving the beginning of the sending window.
Erroneous blocks are indicated through a bitmap. In an
ACK/NACK there is no change in the current channel
assignment
The network can allocate additional/de-allocate resources to
the MS (Packet Uplink/Downlink Assignment, Packet Timeslot
Reconfigure messages)
A final ACK/NACK is sent to acknowledge all the blocks within
a TBF
Selective ARQ
FPLHEL1TIM
Rio De Janeiro,
October 2005

121
GPRS coding parameters
Scheme
Code
rate
Payload
(bits)
BCS
(bits)
Coded
bits
Tail
bits
Punctured
bits
Data rate
(kbps)
CS-1 1/2 181 40 456 4 0 9.05
CS-2 ~ 2/3 268 16 588 4 132 13.4
CS-3 ~ 3/4 312 16 676 4 220 15.6
CS-4 1 428 16 456 - - 21.4
Pre-coded
USF (bits)
3
6
6
12
FPLHEL1TIM
Rio De Janeiro,
October 2005

122
Scheme Maximum net payload
(bytes)
Maximum net
RLC/MAC data rate
(kbps)
Nominal data rate
(kbps)
Application data
rate (kbps)
CS-1 20 8 9.05 7.7
CS-2 30 12 13.4 11.5
CS-3 36 14.4 15.6 13.8
CS-4 50 20 21.4 19.2

GPRS data rates
FPLHEL1TIM
Rio De Janeiro,
October 2005

123
The reference performance shall be:

for packet data channels (PDCH): BLER s 10%
for up-link state flag (USF): BLER s 1%
for packet random access channel (PRACH): BLER s 15%

GPRS specified radio performance
FPLHEL1TIM
Rio De Janeiro,
October 2005

124
Four coding schemes (CS) for data traffic with increasing channel
rates
CS-1 mandatory for BTSs
CS-1, CS-2, CS-3 and CS-4 mandatory for MSs
Coding scheme CS-1 is also used for signalling
Two types of channel coding for PRACH
Coding Schemes
FPLHEL1TIM
Rio De Janeiro,
October 2005

125
USF precoding
4 tail bits
rate 1/2 convolutional coding
puncturing
456 bits
USF BC
S
Payload
Radio Block Structure
FPLHEL1TIM
Rio De Janeiro,
October 2005

126
224 bits
456 bits
BC
S
Header & Data
181 40
USF
3
4 tail bits
Coding Scheme CS-1
FPLHEL1TIM
Rio De Janeiro,
October 2005

127
USF precoding
4 tail bits
Puncturing (132 bits)
444
Punctured bits
588 1 2 16 17 18 20 21 22
first last
(except 12 specific bits)
15 587 23 19
287 bits
268 16
Header, Data & Spare BCS USF
3
1
2
576
12
588 bits
456 bits
Coding Scheme CS-2
FPLHEL1TIM
Rio De Janeiro,
October 2005

128
USF precoding
4 tail bits
rate 1/2 convolutional
coding
Puncturing (220 bits)
676 bits
Punctured bits
331 bits
312 16
Header, Data & Spare BCS USF
3
12
16 22 28 670 672 673 674 675 676 1 2
first last
15 17 21 23 27 29 669 671
664
456 bits 12 444
Coding Scheme CS-3
FPLHEL1TIM
Rio De Janeiro,
October 2005

129
USF precoding
no other coding
447 bits
BCS
428 16
Header, Data & Spare USF
3
456 bits 12 444
Coding Scheme CS-4
FPLHEL1TIM
Rio De Janeiro,
October 2005

130
Codeword (456 bits)
Reordering
& Partitioning
0 1 2 3 4 5 6 7
57 57 57 57 57 57 57 57
0 4
1 5
2 6
3 7
57 bits 57 bits
Normal Burst
Training sequence
Training sequence
Training sequence
Training sequence
Block Rectangular Interleaving
FPLHEL1TIM
Rio De Janeiro,
October 2005

131
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
1.1
1.2
1.3
1.4
1.5
1.6
1.7
1.8
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
C/I [dB]
T
h
r
o
u
g
h
p
u
t

[
k
B
y
t
e
s
/
s
]
CS1
CS2
CS3
CS4

BLER=10%
Throughput (saturation) vs. C/I (TU50 ideal FH)
RLC/MAC Performance (I)
FPLHEL1TIM
Rio De Janeiro,
October 2005

132
0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
0 2 4 6 8 10 12 14 16 18 20 22 24 26
C/I [dB]
T
h
r
o
u
g
h
p
u
t

[
k
B
y
t
e
s
/
s
]
CS1
CS2
CS3
CS4
RLC/MAC Performance (II)
Throughput (saturation) vs. C/I (TU3 no FH)
FPLHEL1TIM
Rio De Janeiro,
October 2005

133
Coding scheme CS-1 gives the largest throughput for low C/I
values compared with the other coding schemes (TU50 ideal
FH)
Coding schemes CS-2 and CS-3 show similar performance
Coding scheme CS-4 is applicable for high C/I values only in
case of TU50 ideal FH and shows the best performance without
frequency hopping (TU3 no FH)
By adapting the coding scheme to the channel conditions, it is
possible to optimize the performance
RLC/MAC Performance (III)
FPLHEL1TIM
Rio De Janeiro,
October 2005

134
Class A: the MS is allowed to make and/or receive
calls on both circuit and packet switched services
simultaneously
Class B: the MS can make and/or receive calls on
either of the two services sequentially but not
simultaneously
Class C: the MS can make and/or receive calls on
either of the two manually selected services
Types of Terminals
FPLHEL1TIM
Rio De Janeiro,
October 2005

135

T
ra
=2
DL 0 1 2 3 4 5 6 7
UL 5 6 7 0 1 2 3 4

T
tb
=1

T
ra
=2
DL 0 1 2 3 4 5 6 7
UL 5 6 7 0 1 2 3 4

T
tb
=1

Example of 4 + 1 configuration
Example of 3 + 2 configuration
Terminal Capability
FPLHEL1TIM
Rio De Janeiro,
October 2005

136
GPRS logical channels
Packet Common Control Channel (PCCCH):
PRACH: random access (uplink)
PPCH: paging (downlink)
PAGCH: access grant (downlink)
PNCH: PTM-M notification (downlink)

Packet Broadcast Control Channel (PBCCH) (downlink)
Packet Traffic Channels:
PDTCH: data traffic

Packet Dedicated Control Channels:
PACCH: associated control
PTCCH/U: timing advance estimation (uplink))
PTCCH/D: timing advance information (downlink)
FPLHEL1TIM
Rio De Janeiro,
October 2005

137
Coexistence GSM/GPRS
When no signaling channels are dedicated to GPRS; the MSs decodes
the GSM CCCH and the GPRS information are sent on BCCH
The GSM BCCH indicates the support of GPRS in the cell and the
existence of PBCCH, by individuating the physical channels into which is
mapped
On such channel are mapped even the downlink PCCCH
- Eventually the PBCCH indicates even if there are other PDCH where is
mapped the PCCCH
In uplink, USF=FREE indicates the PRACH over the next radio block

FPLHEL1TIM
Rio De Janeiro,
October 2005

138
GPRS channels management
Dynamic channels can be managed with two strategies:
Load Supervision: the percentage of available data
channels (PDCH) is monitored and the number of
dynamic PDCH is consequently changed
Dynamic Allocation: the physical channels not used for
circuit switching are released (fast release) when a voice
call arrives
FPLHEL1TIM
Rio De Janeiro,
October 2005

139
RLC function
Transfer of LLC PDUs between LLC layer and MAC function
Segmentation and re-assembly of LLC PDUs into/from RLC data
blocks
Segmentation and re-assembly of RLC/MAC control messages
into/from RLC/MAC control blocks
Selective retransmission of RLC data blocks
MAC function
Procedures for reception of PBCCH and PCCCH
Provision of Temporary Block Flows (TBFs) that allow the transfer
of signalling and user data between the network and a mobile station
Management of the shared transmission resources, the control of
which resides on the network side
RLC/MAC Layer
FPLHEL1TIM
Rio De Janeiro,
October 2005

140
Data Block
Packet Uplink Ack/Nack
Data Block (last)
Access and Assignment
MS Network
PDTCH
PACCH
PDTCH
Packet Uplink Assignment (polling)
PACCH
Packet Control Acknowledgement
PACCH
Data Block
PDTCH
Data Block
PDTCH
Data Block (last in send window)
PDTCH
Data Block
PDTCH
Data Block
PDTCH
Data Block
PDTCH
Data Block
PDTCH
Packet Uplink Ack/Nack (final, polling)
PACCH
Packet Channel Request (or Channel Request)
Packet Uplink Assignment (or Immediate Assignment)
Packet Resource Request
Packet Uplink Assignment
Network
PRACH (or RACH)
PAGCH (or AGCH)
MS
(Optional)
(Optional)
Access
Uplink data transfer
Packet Control Acknowledgement PACCH
Uplink Transmission
FPLHEL1TIM
Rio De Janeiro,
October 2005

141
Dynamic Allocation:
the MS transmits its radio blocks on the assigned
time slots with the assigned USF
Fixed Allocation:
fixed uplink resource allocation to the MS based
on a bitmap indicating the assigned blocks per
time slot
No need to monitor the downlink for the USF
Extended Dynamic Allocation:
monitoring of the USF without transmitting and
receiving simultaneously
Uplink Resource Allocation
FPLHEL1TIM
Rio De Janeiro,
October 2005

142
TDMA fr. 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51
Block B0 B1 B2 X B3 B4 B5 X B6 B7 B8 X B9 B10 B11 X
TS
0 downlink FREE FREE FREE FREE FREE FREE FREE FREE FREE FREE FREE FREE
uplink
1 downlink R1 R1 R1 R2 R2 R2 R2 R2 R1 R1 R3 R3
uplink
2 downlink R1 R1 R1 R1 R1
uplink
3 downlink R1 R1 R1 R1 R1
uplink
4 downlink
uplink
5 downlink
uplink
6 downlink
uplink
7 downlink
uplink
Dynamic Allocation
FPLHEL1TIM
Rio De Janeiro,
October 2005

143
Frame Block Slot #0 Slot #1 Slot #2 Slot #3 Slot #4 Slot #5 Slot #6 Slot #7
1000 B0 uplink PRACH open open open open open open open
downlink
1004 B1 uplink open open open open open open open open
downlink
1008 B2 uplink open open open open open open open open
downlink Fixed Assignment
downlink
1017 B4 uplink "00" "00" "00" "00" "00" "00" "00" Request
downlink
1021 B5 uplink "00" "00" "00" "00" "00" "00" "00" "00"
downlink
1026 B6 uplink PRACH "00" "00" "00" "00" "00"
downlink Fixed Assignment
1030 B7 uplink "00" "00" "00" "00" "00" "00"
downlink Packet Ack/Nack
1034 B8 uplink "00" "00" "00" "00" "00" "00" "00" "00"
downlink
1039 B9 uplink PRACH "00" "00" "00" "00" "00" "00" "00"
downlink
1043 B10 uplink "00" "00" "00" "00" "00" "00"
1047 B11 uplink "00" "00" "00" "00" "00" "00" "00" "00"
downlink
downlink
1056 B1 uplink "01" "01" "01" "01" "01" Request
1060 B2 uplink "01" "01" "01" "01" "01" "01" "01" "01"
downlink
Fixed Allocation
FPLHEL1TIM
Rio De Janeiro,
October 2005

144
Paging
MS Network
Packet Paging Response (LLC frame)
PDTCH
Packet Channel Request (or Channel Request)
Packet Uplink Assignment (or Immediate Assignment)
PRACH (or RACH)
PAGCH (or AGCH)
PPCH (or PCH)
Packet Paging Request (or Paging Request) Data Block
Packet Downlink Ack/Nack
Paging and Assignment
MS Network
PDTCH
PACCH
Packet Downlink Assignment (polling)
PACCH
PACCH
PACCH
Packet Downlink Ack/Nack (final)
Data Block
PDTCH
Data Block
PDTCH
Data Block (polling)
PDTCH
Data Block
PDTCH
Data Block
PDTCH
Data Block
PDTCH
Data Block
PDTCH
Data Block
PDTCH
Data Block (last, polling)
PDTCH
MS Network
Packet Downlink Assignment
PACCH or
PCCCH or
CCCH
Downlink data transfer
Packet Resource Request
Packet Uplink Assignment
(Optional)
(Optional)
PACCH
(Optional)
Downlink Transmission
FPLHEL1TIM
Rio De Janeiro,
October 2005

145
During uplink transfer, the MS continuously monitors its PACCH,
so it can recognize a Packet Downlink Assignment for the
downlink or a Packet Timeslot Reconfigure for the uplink and
downlink
During downlink transfer, an MS may request resources in the
Packet Downlink Ack/Nack sent to the network

Thus, simultaneous packet transfers
in the two links are possible (according with the MS multislot capability)

Simultaneous UL And DL Transmission
FPLHEL1TIM
Rio De Janeiro,
October 2005

146
Resource reallocation
During the transfer, the network can reallocate the
resources through a Packet Uplink Assignment sent in
downlink, over the associated signaling channel PACCH
The MS forwards an ack for the correct message reception
through a Packet Control Assignment, sent over the PACCH
in UL, in the radio block period reserved to the MS through
the field RRBP contained in the Packet Uplink Assignment
FPLHEL1TIM
Rio De Janeiro,
October 2005

147
Resource release
The procedure for resource release is generally initiated from the MS, with the
cowntdown procedure of the last sent blocks
The network sends the Packet Uplink Final Ack over the PACCH, in order to
inform the MS of the radio blocks correct reception
The MS sends a Packet Control Acknowledgement in the uplink reserved block,
then releases the TBF, which is also released from the network
The PDCH, the USF and the TFI can therefore be assigned to other MS
In the case of a fast release required from the network which implies the TBF
release, the MS sends a new Packet Channel Request in order to send the RLC
Data Block which are not already sent
FPLHEL1TIM
Rio De Janeiro,
October 2005

148
PDCH Fast release
The fast release procedure can be initiated when:
The assignments to the PDCH are concluded
Individual notify to each mobile which has an assignment to the
PDCH (over PACCH)
Broadcast notify, over each PDCH to be released
FPLHEL1TIM
Rio De Janeiro,
October 2005

149
Timing Advance
Initial TA estimation: the estimate is based on the Access Burst sent in
correspondence of the Packet Channel Request, both in the random
access and paging phases. In the corresponding Packet
Uplink/Downlink Assignment the TA value is sent
Continuous TA update: the procedure is used in packet transfer mode
to continuously update the TA value, with a periodicity of about 2s.
FPLHEL1TIM
Rio De Janeiro,
October 2005

150
http://www.3gamericas.org/English/Statistics/gsm_evolution/edge_launches.cfm

FPLHEL1TIM
Rio De Janeiro,
October 2005

151
EDGE (Enhanced Data rates for Global Evolution)

Operates over the same bandwidth of GSM/GPRS (900 - 1800
1900 MHz)

Allows the introduction of new services that require high bit rates

The maximum data rate is about 60 kbps per slot and depends on
the radio conditions (C/I)

Allows to increase the data rate by using new modulation/coding
scheme

FPLHEL1TIM
Rio De Janeiro,
October 2005

152
EDGE
EDGE is considered as an evolution of GSM/GPRS: the goal
the increase of bit rate through a better spectral efficiency
EDGE adopts the 8 PSK modulation (3 bit per symbol); this
allows to reach 812.5 kbit/s over the radio interface with the
same symbol rate of 270.83 kbit/s;
EDGE defines 9 modulation and coding schemes MCS, from
8.8 kbit/s per Time Slot (MCS-1 with GMSK modulaiton), to
59.2 kbit/s per Time Slot (MCS-9 with 8PSK modulation)
FPLHEL1TIM
Rio De Janeiro,
October 2005

153
EDGE European positioning

urban area
GSM/GPRS

GSM/GPRS

GSM/GPRS

GSM/GPRS

GSM/GPRS

GSM/GPRS

UMTS

UMTS

UMTS
Handover from UMTS
to GSM for coverage
reasons

EDGE EDGE
rural area

EDGE

EDGE

EDGE

EDGE
FPLHEL1TIM
Rio De Janeiro,
October 2005

154
GERAN reference architecture

GSM/UMTS
Core Network
GERAN
Gb
A
Iu
MS
Um
Iur-g
BSC
BTS
BTS
BSS
BSS
MS
Iur-g
UTRAN
RNC
FPLHEL1TIM
Rio De Janeiro,
October 2005

155
From GPRS to EGPRS

EGPRS requires:
new terminals
HW/SW upgrade on BSS (EDGE Transceiver Unit, A-bis interface
dimensioning, BSC/PCU HW/SW upgrade) depending on the
Vendor implementation
Gn
Other
PLMNs
VLR
Gb
Gi
Gr
A-bis
Gs
Gp
Gd
BTS
BSC
MSC
SMS-C HLR
External
data
network
SGSN GGSN
GGSN
PCU
Um
EDGE
TRU
FPLHEL1TIM
Rio De Janeiro,
October 2005

156
EDGE
Moreover
Adoption of the Link Adaption functionality, which, in relation to
the radio channel quality, allows to vary the coding scheme and
modulation (MCS), even for eventual packet retransmissions;
Adoption of the Incremental Redundancy functionality, that is
the software recombination of the wrong received blocks, in order to
increase the codes error correction capacity;
EDGE shares radio systems and the core of GPRS network
GPRS and EDGE services are multiplated over the same Time Slot
GPRS RLC/MAC protocols have been enriched for the EDGE
service, in order to allow the increase of user performances
FPLHEL1TIM
Rio De Janeiro,
October 2005

157
EDGE service requirements
Service Data rate per slot Peack Data Rate Mobile Speed
EGPRS
ECSD 32 T
48 kb/s
43.2 kb/s
28.8 kb/s
18 kb/s
32 kb/s
384 kbit/s (8 slot)
64 kbit/s (2 slot)
144 kbit/s (8 slot)
3 - 100 km/h
3 - 100 km/h
100- 250 km/h
ECSD 43.2 NT
ECSD 28.8 NT/T
Three kind of services
EGPRS: EDGE GPRS
ECSD NT: EDGE Circuit Switched Data - Non Transparent
ECSD T: EDGE Circuit Switched Data Transparent
The peak data rate is of 64 kbit/s for the ECSD (Enhanced CSD
Circuit Switched Data) because the limitation in core networks (A
interface, with link at 64 kbit/s)
FPLHEL1TIM
Rio De Janeiro,
October 2005

158
time
0 t
t t
Q
I
(0,1,0)
(0,0,0) (0,1,1)
(1,1,1)
(1,1,0)
(1,0,0)
(1,0,1)
(0,0,1)
8 PSK modulation
phase shift:
-V
0
V
111 011 010 000
Without Gaussian filter
( ) ( ) ( ) t t f A t s
c m
t + = 2 cos
FPLHEL1TIM
Rio De Janeiro,
October 2005

159
Decision region
FPLHEL1TIM
Rio De Janeiro,
October 2005

160
The rotation of 3t /8 is necessary
to avoid the zero crossing
I
1/8 t
3/8 t 5/8 t
7/8 t
9/8 t
11/8 t
13/8 t
15/8 t ( ) ( ) ( ) t t f A t s
c m
t + = 2 cos
The EDGE modulation: 8 PSK
The points of the constellation are the vectors ends
The presence of a Gaussian filter allows to have a narrower modulated signal
spectrum
In order to obtain a better signal efficiency, some ISI must be taken into account

( ) ( )
u + =
i
i
iT t k t
0

FPLHEL1TIM
Rio De Janeiro,
October 2005

161
Channel coding
-Channel coding adds redundancy and
memory to the information such to reveal
and/or correct errors
-For example, for each k information bits n
coded bits are generated
-The code rate is R
c
=k/n

0 2
4 6 8 10 12 14 16
10
-12
10
-10
10
-8
10
-6
10
-4
10
-2
E
b
/n
o
dB
P
e

uncoded
coded
0 2 4 6 8 10 12 14 16
10
-12
10
-10
10
-8
10
-6
10
-4
10
-2
E
b
/n
0
dB
P
e

coded
uncoded
k/n=1/2
k/n=1/3
FPLHEL1TIM
Rio De Janeiro,
October 2005

162
Modulation and coding schemes
8PSK modulation increases data
and voice capacity
The free resources can be used for
voice and data
FPLHEL1TIM
Rio De Janeiro,
October 2005

163
EDGE Throughput
FPLHEL1TIM
Rio De Janeiro,
October 2005

164
LLC, LLC/MAC, phy
FH Information field FCS
BH Info field
LLC layer
Frame (LL PDU)
BH Info field BH Info field RLC/MAC layer
Block
Channel coding
Reordering & partitoning
Interleaving
Burst formatting
Physical layer
20 ms
FPLHEL1TIM
Rio De Janeiro,
October 2005

165
RLC/MAC Block per EGPRS data
E FBI BCS TB 37
MAC
Header
MCS-3
EGPRS RLC Data Unit EGPRS RLC Data Block
RLC/MAC Block for data transmission for EGPRS (DL)
MAC
Header
MCS-9 E FBI BCS TB 37 37 E FBI BCS TB 37 37
EGPRS RLC Data Block 1 EGPRS RLC Data Block 2
RLC/MAC Block for data transmission for EGPRS (DL)
Coding and
puncturing processes
are applied to the
syngol red boxes
A Family
MCS-6
MAC
Header
E FBI BCS TB 37 37
Basic Unit
FPLHEL1TIM
Rio De Janeiro,
October 2005

166
RLC
Data
Unit
Basic
Unit
Payload in an
RLC/MAC
Block for data
transmission
(4 bursts, 20
mS)
37
37 37
37 37 37 37
MCS-
3
MCS-
6
MCS-
9
Family
A
34+
3
34+
3
34+
3
34 34 34 34
MCS-
3
MCS-
6
MCS-
8
Family A Padding
28
28 28
28 28 28 28
MCS-
2
MCS-
5
MCS-
7
Family
B
22
22 22
MCS-
1
MCS-
4
Family
C
3 Bytes of Padding
3+3 Bytes of Padding
The passage among MCS
belonging to the same
family do not needs
resegmentation
FPLHEL1TIM
Rio De Janeiro,
October 2005

167
EGPRS Modulation & Coding Schemes
MCS choice: For initial transmissions, any MCS
can be selected based on the current link quality.
In case of retransmissions, the MCS is selected
within the same Family on the basis of the
adopted automatic repeat request mechanism.
28 28 28 28
Family B
MCS-7
MCS-5
MCS-2
Octets
MCS-3
Family A 37 37 37 37
MCS-6
MCS-9
Octets
22 22
Family C
MCS-4
MCS-1
Octets
Family
A
padding
34 34 34 34
MCS-8
Octets
34+3 34+3
MCS-6
Octets
MCS-3
FPLHEL1TIM
Rio De Janeiro,
October 2005

168
EGPRS RLC/MAC block for data transfer
RLC/MAC block
RLC data block 1 RLC data block 2 (conditional*)
E
FB
I/TI
EGPRS RLC data unit
RLC/MAC
header
* for MCS-7 MCS-9
Size (bytes)
Downlink Uplink
header type 1: MCS-7 MCS-9
5 5.75
3.5 4.625
3.875 3.875

Size (bytes)
MCS-1 22
MCS-2 28
MCS-3 37
MCS-4 44
MCS-5 56
MCS-6 74
MCS-7 56
MCS-8 68
MCS-9 74

FPLHEL1TIM
Rio De Janeiro,
October 2005

169
EGPRS MCS
Family
RLC Payload
Basic Unit size
(bytes)
Modulation
& Coding
Scheme
RLC Payload
Basic Units per
RLC data unit
RLC Data Units per
RLC/MAC Data
Block (20 mS)
Total number of RLC
payload Basic Units
per RLC/MAC Data
Block
MCS-9 2 2 4
MCS-6 2 1 2
MCS-3 1 1 1
34 MCS-8 2 2 4
MCS-6 2 1 2
MCS-3 1 1 1
MCS-7 2 2 4
MCS-5 2 1 2
MCS-2 1 1 1
MCS-4 2 1 2
MCS-1 1 1 1
A 37
A Padding
34 + 3 Padding
B 28
C 22
FPLHEL1TIM
Rio De Janeiro,
October 2005

170
EGPRS MCS
Basic
Units
Bytes bit
MCS-9 37 4 148 1184 59200
MCS-6 37 2 74 592 29600
MCS-3 37 1 37 296 14800
MCS-8 34 4 136 1088 54400
MCS-6 34 (+3 Padding) 2 68 544 27200
MCS-3 34 (+3 Padding) 1 34 272 13600
MCS-7 28 4 112 896 44800
MCS-5 28 2 56 448 22400
MCS-2 28 1 28 224 11200
MCS-4 22 2 44 352 17600
MCS-1 22 1 22 176 8800
RLC
throughput
(bit/S)
In a RLC/MAC Data Block (4 bursts, 20 ms):
Family MCS
RLC Payload Basic Unit
size (Bytes)
A
A Padding
B
C
FPLHEL1TIM
Rio De Janeiro,
October 2005

171
EGPRS MCS
MCS-9 A 59.2 57.3
MCS-8 A Padding 54.4 52.6
MCS-7 B 44.8 43.3
MCS-6 A 29.6 28.6
MCS-5 B 22.4 21.7
MCS-4 C 17.6 17.0
MCS-3 A 14.8 14.3
MCS-2 B 11.2 10.8
MCS-1 C 8.8 8.5
Application data rate (Kbps) @
IP packet size = 1500 bytes
8-PSK
GMSK
RLC throughput (bit/S) Family MCS Modulation
FPLHEL1TIM
Rio De Janeiro,
October 2005

172
EGPRS: MCS-1 DL

Block
code
Rate 1/3
convolutional
Puncturing P1 or P2 Puncturing
Rate 1/3 convolutional
coding
588 bits
USF
RLC/MAC
header
RLC Data = 22 bytes = 176 bits TB
12 bits 108 bits
196 bits
372 bits 68 bits 12 bits 4 Extra SF
456 bits
36 bits
BCS HCS E FBI
3 bits
Interleaving
FPLHEL1TIM
Rio De Janeiro,
October 2005

173
EGPRS: MCS-2 DL

Block
code
Rate 1/3
convolutional
Puncturing P1 or P2 Puncturing
coding
732 bits
USF
RLC/MAC
header
12 bits 108 bits
244 bits
456 bits
36 bits
BCS HCS E FBI
3 bits
Interleaving
FPLHEL1TIM
Rio De Janeiro,
October 2005

174
EGPRS: MCS-3 DL

Block
code
Rate 1/3
convolutional
Puncturing P1 or P2 or P3 Puncturing
coding
948 bits
USF
RLC/MAC
header
12 bits 108 bits
316 bits
456 bits
36 bits
BCS HCS E FBI
3 bits
*
RLC Data: 37 bytes or (34 + 3) bytes
34 bytes +3-byte padding for MCS-8 retransmission
*
Interleaving
FPLHEL1TIM
Rio De Janeiro,
October 2005

175
EGPRS: MCS-4 DL

Block
code
Rate 1/3
convolutional
coding
1116 bits
USF
RLC/MAC
header
12 bits 108 bits
372 bits
456 bits
36 bits
BCS HCS E FBI
3 bits
Interleaving
FPLHEL1TIM
Rio De Janeiro,
October 2005

176
EGPRS: MCS-5 DL

Interleaving Interleaving
Block
code
Rate 1/3
convolutional
Puncturing P1 or P2 + 1 spare bit
coding
1404 bits
USF
RLC/MAC
header
36 bits 99 bits
468 bits
1392 bits
33 bits
BCS HCS E FBI
3 bits
FPLHEL1TIM
Rio De Janeiro,
October 2005

177
EGPRS: MCS-6 DL

Block
code
Rate 1/3
convolutional
Puncturing P1 or P2 + 1 spare bit
coding
1836 bits
USF
RLC/MAC
header
RLC Data
*
= 74 bytes = 592 bits TB
36 bits 99 bits
612 bits
1392 bits
33 bits
BCS HCS E FBI
3 bits
*
RLC Data: 74 bytes or (68 + 6) bytes
68 bytes +6-byte padding for MCS-8 retransmission
FPLHEL1TIM
Rio De Janeiro,
October 2005

178
EGPRS: MCS-7 DL

Rate 1/3
convolutional
Interleaving
Puncturing P1 or P2 or P3
1392 bits
coding
Block
code
coding
1404 bits 36 bits 135 bits
468 bits 45 bits
TB BCS USF
RLC/MAC
header
HCS RLC Data = 56 bytes = 448 bits E FBI
3 bits
TB BCS RLC Data = 56 bytes = 448 bits E FBI
468 bits
1404 bits
612 bits
Interleaving
FPLHEL1TIM
Rio De Janeiro,
October 2005

179
EGPRS: MCS-8 DL

Rate 1/3
convolutional
Puncturing P1 or P2 or P3 Puncturing Puncturing P1 or P2 or P3
36 bits 124 bits 8 Extra SF
1392 bits
coding
Block
code
coding
564 bits 45 bits
TB BCS USF
RLC/MAC
header
3 bits
564 bits
1692 bits
612 bits 612 bits
FPLHEL1TIM
Rio De Janeiro,
October 2005

180
EGPRS: MCS-9 DL

Rate 1/3
convolutional
Puncturing P1 or P2 or P3 Puncturing Puncturing P1 or P2 or P3
36 bits 124 bits 8 Extra SF
1392 bits
coding
Block
code
coding
612 bits 45 bits
TB BCS USF
RLC/MAC
header
3 bits
612 bits
1836 bits
612 bits 612 bits
FPLHEL1TIM
Rio De Janeiro,
October 2005

181
MCS coding - downlink
For each MCS scheme, 12 parity bits for the BCS field are
computed, 6 Tail Bit are added and a convolutional coding of
rate 1/3 is used with different puncturing schemes
The coding and puncturing scheme is indicated in the CPS field
of the RLC/MAC header
Observe that, in case of retransmission, the same MCS can be
used, but with different puncturing scheme in order to take
advantage of the soft decoding (Incremental Redundancy)
FPLHEL1TIM
Rio De Janeiro,
October 2005

182
Link Adaptation
Modulation and Coding scheme are chosen (MCS) in function of
periodic measurements of radio link quality
Two Link Adaptation algorithms:
predictive: the algorithm estimates radio performances of the MCS
in use and of all the other available, and chooses the best for the
next transmission
incremental: the algorithm estimates radio performances of the
MCS in use and, basing on that, chooses the best for the next
transmission
FPLHEL1TIM
Rio De Janeiro,
October 2005

183
Link Adaptation (LA)
1. First transmission of an RLC Data Block:
1. Choice of the MCS basing on the radio measurements
(MEAN_BEP e CV_BEP)
2. Without radio measurements (first radio blocks): Default
MCS

2. Retransmissions of an RLC Data Block:
1. The same as above, with the further constraint of
remaining in the same family
New: In the GPRS it is not possible to retransmit with a CS
different from the one used in the first transmission
FPLHEL1TIM
Rio De Janeiro,
October 2005

184
Link Adaptation (LA)
Re-segmentation
-Coding&puncturing
-Interleaving
-transmission
-reception
-Deinterleaving
-decoding
MCS-6
37 37
37 37
!!! NOT OK !!!
MCS-3 37
MCS-3 37
37
37
Higher
protection
New: In the GPRS it is not possible to retransmit with a CS
different from the one used in the first transmission
FPLHEL1TIM
Rio De Janeiro,
October 2005

185
Incremental Redundancy (IR)
First transmission of an RLC Data Block :
like LA

Retransmissions of an RLC Data Block :
Re-segmentation is not allowed for a certain number of
transmissions
After that, it is possible to switch from an MCS which
carries two RLC Data Blocks to the corresponding MCS
which carries one RLC data block
FPLHEL1TIM
Rio De Janeiro,
October 2005

186
Incremental Redundancy (IR)
MCS-6
Joined
decoding
37 37
37 37
!!! NOT OK !!!
37 37
!!! NOT OK !!!
37 37
!!! NOT OK !!!
Ridondanza incrementale:
Lo stesso blocco viene
ritrasmesso esattamente il
numero di volte necessario.
The MT stores the soft
information relatied to the
different block transmissions
Resegmentation
Forbidden!
37 37
-Coding&puncturing
-Interleaving
-transmission
-reception
-Deinterleaving
-decoding

FPLHEL1TIM
Rio De Janeiro,
October 2005

187
Incremental Redundancy
Allows the sw recombination of
retransmissions to decode an
errored radio block
Initially uses the MCS9 coding
scheme, independently from the
actual radio link quality
In case of non correct reception,
the same MCS is retransmitted end
soft decodings are combined
Without IR
With IR
FPLHEL1TIM
Rio De Janeiro,
October 2005

188
But
The BTS need new transceivers, therefore new hardware (8PSK
modulators) and software (to realize modulation and coding schemes);
For the BSC/PCU (Packet Control Unit) new Hardware (processors) and
software (for RLC/MAC protocols) is needed;
On the A-bis it is necessary to allocate more circuits (limited at 16
kb/s) for each traffic channel;
to obtain the same BER, EDGE needs an higher C/I respect to the GSM;
the smaller cells dimensions imply new sites;
New terminals are needed;
EDGE
FPLHEL1TIM
Rio De Janeiro,
October 2005

189
Finally, EDGE
offers an migration path from GPRS to UMTS;
only a transceiver unit must be added to each cell;
the BSC and BTS updating software can be remote loaded;
the higher level protocols (GGSN, SGSN) remain the same as
GPRS;
can be gradually introduced in the GPRS network
EDGE
FPLHEL1TIM
Rio De Janeiro,
October 2005

190
Dual Transfer Mode: what is it?
Supports combinational services on GSM/GPRS/EDGE networks
A combinational service implies two contemporaneous connections: a circuit switched connection
where the voice is transmitted, and a packet switched connection to send and receive MMS,
videoclip, etc
Needs class A terminals
Class A terminaIs necessitate of a double Rx/Tx chain
To avoid the double Rx/Tx chain, the Time slots for voice and data must be on the same carrier

FPLHEL1TIM
Rio De Janeiro,
October 2005

191
DTM terminals
FPLHEL1TIM
Rio De Janeiro,
October 2005

192
Voice coder
DTM terminals must have the HR AMR voice coder
A DTM terminal surely supports FR (mandatory) and HR AMR; the support of
other available codes (EFR/HR/FR AMR) is optional in 3GPP specifications
FPLHEL1TIM
Rio De Janeiro,
October 2005

193
Mobility handling: GPRS
3GPP 23.060
Idle
Ready
Standby
GPRS
attach
GPRS detach or stand by
timer expired
Timer expired
Transmission
failure
Packets transmission
or paging
Standby
timer
expired
Available user data only in HLR
The Mobile reads the BCCH
The mobile effectuates PLMN selection and cell
(re)selection
The mobile is not reacheble
The mobile can transmit or receive data (active
context)
SGSN knows the mobile position at cell level
The mobile reads the BCCH and the PCH
The mobile notifies the network in case of cell
change (Cell Update)
SGSN knows the mobile position at routing area level
The mobile effectuates cell (re)selection
The mobile reads BCCH and AGCH
In case of change of routing area the mobile informates
SGSN
FPLHEL1TIM
Rio De Janeiro,
October 2005

194
The terminal has
radio resources
allocated for data
transfer.
PCU, SGSN, HLR
know the position at
cell level; the MSC
at LA level
Radio Resource (RR) states of a DTM (Rel.6) terminal
Classe B
Classe A (DTM)
BSC and MSC
know the
terminal
position at cell
level and have
an active
signaling
connection to
maintain a
voice
communication
Dual
transfer
Dedicated
CS idle/Packet
transfer
CS Idle/
Packet idle
Packet release
Packet request
RR establishment
RR
release
PDCH assignment
TBF(s)
release
Packet access
RR release
RR establishment
The terminal is not attached and the network
has no infos on the terminal position, which
do not effectuates MM procedures and is not
reacheble with GPRS paging
The terminal can effectuate PS and CS traffic
FPLHEL1TIM
Rio De Janeiro,
October 2005

195
GPRS Paging coordination
Three paging modes for CS and PS domains:
Network Operation Mode (NOM) I: paging for CS services is sent on the
GPRS paging channel (PCH o PPCH) or on a traffic GPRS channel (PACCH)
if the terminal is in packet transfer mode
Requires the activation of Gs interface through which the paging sent to MSC/VLR
reaches the SGSN
Network Operation Mode (NOM) II: the paging for both domains are sent on
the paging channel for the CS domain (TIM choice)
Network Operation Mode (NOM) III: the network sends the paging for CS
services on PCH and the paging for PS services on PPCH (or PCH if there is
not PPCH)
FPLHEL1TIM
Rio De Janeiro,
October 2005

196
DTM Paging coordination
The BSS must be able to contemporary handle the radio resources for both CS
and PS domains, independently from the adopted NOM
This is possible by using the IMSI, which is common to both domains
The IMSI is sent to the BSS from the MSC or from the SGSN; in such way the
paging is always sent on the signaling channel monitored from the MS DTM:
On the PACCH for a CS paging when the MS is in Packet Transfer Mode
On the FACCH for a PS paging when the MS is in CS Dedicated Mode
The introduction of the BSS paging coordination (or IMSI coordination) allows all
the MS non DTM to be reached from a CS paging during a data session, even in
NOM II and without Gs interface

FPLHEL1TIM
Rio De Janeiro,
October 2005

197
Handover in DTM
The handover for CS domain and cell change for PS domain must be contemporary done
The decision of changing the serving cell is always taken form the network by evaluating
only the CS connection
Internal Handover:
Is done on cells belonging to the same BSC
If the MS was in DTM, the network sends on the signaling channel dedicated to the voice the DTM message
information containing the infos to continue the PS traffic on the new cell
The mobile executes a cell and/or RA update
If a PS connection was active, an access to the target cell is performed
External Handover:
The target BSS must receive:
The IMSI of DTM MS
Infos on the nature of packet resources of the serving cell, in order that the CS resource be compatible with the PS
resources of the new cell
Notifications to the inter-MSC handover procedures and inter-SGSN handover procedures
which handle even DTM terminals
FPLHEL1TIM
Rio De Janeiro,
October 2005

198

GSM, GPRS, EDGE Radio Interface: Maria Stella Iacobucci

Transféré par

Informations du document

Description originale:

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

GSM, GPRS, EDGE Radio Interface: Maria Stella Iacobucci

Transféré par

Droits d'auteur :

Formats disponibles

Rio De Janeiro, October 2005

Vous aimerez peut-être aussi