RE56 33 GSM TDMA Engineering

GSM TDMA engineering
RE56 Spring 2006 Alexandre CAMINADA UTBM Computer Science Department
What is TDMA engineering ?
TDMA communications systems are based on temporal division of frequency use The capacity of TDMA depends on the number of frequency and time-slots available for communications For a given capacity, the communications quality (voice transmission) and the real throughput (data transmission) depend on the management of interference between base stations If BS use different frequency there is no interference, and the network efficiency is good If the number of frequency is limited, lower than the required capacity, the BS must share
frequency, and then frequency reuse bring in the same time a better capacity and a worst quality due to interference between frequency which are reused several times
TDMA engineering aims at managing the frequency reuse between BS to increase the capacity and the quality in the same time
Alexandre CAMINADA, UTBM
2 - 2006
Contents
1. Spectrum
2. 3.
use
Frequency assignment Frequency hopping
3 - 2006
Frequency Division Multiple Access (FDMA)

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping
1G analogue systems Plus: easy to do Minus: interference, fading

ec Sp m tr u
Communication 1 Communication 2 Communication 3
Time
4 - 2006
Frequency-Time DMA (F-TDMA)
2G numerical systems: GSM, DECT, D-AMPS Plus: gain in capacity Minus: synchronisation, fading
ec Sp m tr u
Communication 1 Communication 2 Communication 3
Time
5 - 2006
Slow Frequency Hopping F-TDMA

GSM Plus: gain in interference, gain in fading Minus: complex to evaluate

Communication 1
r ect Sp
um
Communication 2 Communication 3
Time
6 - 2006
Spectrum reuse in mobile networks
7 - 2006
Interference brings by spectrum reuse

Reuse is depending on system ability for interference management It is not possible to use the same frequency in adjacent cells: co-channel interference between 2 mobiles Interference is C/(I+N), where C, power of expected signal I, set of interference, often limited to co-channel N, white noise, where N << I
Co-channel interference Signals are strong source of interference on the cell borders
8 - 2006
Downlink interference formulation
Let Pei,j the emitted power from BS j to MS i, and Li,j the global loss from BS j to MS i Then Ci, j Pei , j Li , j
intra i
i ' i , i 'C0
Pei ', j Li , j
et
inter i
j ' j , j 'BS
Ptoti , j ' Li , j ' , orthogonality factor
C /I
i, j
tot i
i ' i , i 'C0
Pei , j Li , j Pei ', j Li , j
j ' j , j 'BS
Ptoti , j ' Li , j '
With TDMA, cells circuits are rightly orthogonal (=0) then there is no intra-cell interference
BSk+1
Iinter
Li,k+1
Iintra
Li,0
BS0
Li,k
Li,1
Iinter
BSk
Iinter
BS1
9 - 2006
Distance of reuse between cells
Lower required C/I means shorter reuse distance and higher capacity Analogue system: C/I 18 dB GSM: C/I 9dB Reuse separation distance ranges from 4 to 6 times the cell radius (W.C.Y. LEE) f1 f1
D R
R: cell radius D: frequency reuse distance
D R Seuil
10 - 2006
Frequency reuse pattern between cells

K=3

Frequency reuse pattern (k=3, 7, 12) Hypothesis Regular network (grid) Regular traffic demand Regular propagation Graph-coloring problem Advantages Easy to do No propagation model Inherent problem High traffic demand requires small patterns Small patterns produce interference
3
7
2 1
4
3 2 1
K=7
2 2 7
7
7 3 1 6 4
4
3 4 5
1 5 7
2 3 1 6 5 4
11 - 2006
The big problem of real cell coverage
Nominal cell boundaries
Radio link
Transmitter T-antenna Propagation & Environmental effects R-antenna Receiver The cell
Frequency Distance Weather Obstacle dependent
Coverage: Blue: field strength > -100 Yellow: field strength > -90
12 - 2006
The big problem of real cell coverage
Theory
Reality
13 - 2006
The real networks are far from theory The model is built on ideal scenario
Regular plane surface: uniform propagation (no obstacles) Each station located at a node on a regular grid No vacancy on node All stations parameters settings identical (omni directional
diagram) Each station has a regular traffic Co-channel interference is only considered (no adjacent interference)
14 - 2006
Contents
1.
Spectrum use
2. Frequency
3.
assignment
Frequency hopping
15 - 2006
The theoretical basis of frequency assignment
Definition: frequency reuse consists in using the same frequency channel on areas that are separated enough to avoid co-channel interference problems It is a graph colouring problem: the frequency are assigned to cells as the colours are assigned to areas This concept is fundamental to get the gap between low bandwidth and high capacity one need to catch a lot of customers
16 - 2006
Cells are overlapping each others
Cell overlap is measured from Propagation simulation Field and neighbor measurement reports On one pixel, currently are 40 to 70 significant signals 6 or 7 good signals are needed (HO) Others are multiple radio interference: I = I1+I2++In
Good signals
Best server
Interference
17 - 2006
Carrier-to-Interference matrix computation
CIM [i,j] = surface with single radio interference between stations i (carrier) and j (interference) at all C/I level Computed from cell overlap Pixels restricted to single radio interference
Interference from B Cover from A
Pixel
CIM [A,B]
C/I
18 - 2006
OM [i,j] = surface with single radio interference between stations i (carrier) and j (interference) for a given C/I compatibility threshold for co-channel and adjacent channel Computed from C/I matrix Threshold per cell, per channel, per network layer.
Pixel Pixel
OM [A,B]
C/I
Threshold
19 - 2006
Co-channel and adjacent channel interference rating for cell pairs are specified in terms of affected areas Specification are cell planned ; it supposes that TRX in a cell use the same technology and the same transmission power, and emit from the same antenna ; or several cells have to be defined Stations A A B C D 0,18 0,12 0,15 0
B 0,30 0,12
D 0,25 0,15
0,12 0 0,34 0,08
20 - 2006
Matrix of channel separations between cells
Additional separations required for engineering constraints Co-station separation: 3 channels (>= 3) Co-site separation: 2 channels (>= 2) ; A and C are co-located SM [i,j] = channel separation requirement between frequency assigned to stations i and j to avoid any interference from j on i Computed from overlapping matrix for (i,j) where i j
Stations A A B Etc. 0,12 0 B 0,30 0,12 C D 0,25 0,15 Stations A B C D A 3 1 2 2 B 2 3 0 0 C 2 0 3 1 D 2 0 2 3
21 - 2006
Major FAP problems for operators
Assigning frequency to cell is computing a frequency plan following one of the problems below
Problem 1: Minimize Spectrum FAP
A number of frequencies is available for the network Objective is to minimize the number of frequencies used while satisfying all compatibility constraints and demand constraints
Problem 2: Minimum Span FAP

Span of an assignment is the difference between the largest channel used and the smallest channel used Objective is to minimize the span needed to satisfy all EMC and demand constraints
Problem 3: Minimize Interference FAP

Finite, fixed number of frequencies available for the network Objective is to satisfy all demands constraints (its increases the reuse factor!) and to minimize some measure of interference (e.g. EMC constraints violation) with the given frequencies
22 - 2006
Evaluating the quality of frequency plan

Interference Computation
Networks stations Frequency plan Cell coverage
23 - 2006
Evaluating the quality of frequency plan
Radio interference C/I+N ; N<<I (carrier/interference+noise) Surface-based or traffic-based criteria Co-channel, adjacent channel and multiple interference are considered
C / I (i, j, k , p)
I
j j
k ,p
-4 dB
Radio interference are analyzed continuously
14 dB 15 dB > 50 dB
24 - 2006
Communications quality thresholds
C/I thresholds depend on the engineering on frequency planning Most of the time radio interference are considered around 14 dB on non hopping
network
Several FP evaluation are available on one pixel C/I worst case on the pixel; non hopping C/I mean value on the pixel; average of all frequencies; band base hopping C/I worst case among the best frequency per cell; BCCH C/I minimum threshold depends on channel separation between communications Co-channel 1st adjacent C/I = 9 dB C/I = -9 dB 2nd adjacent 3rd adjacent C/I = - 41dB C/I = - 49 dB
25 - 2006
Contents
1. 2.
Spectrum use Frequency assignment
3. Frequency
hopping
26 - 2006
Why Frequency Hopping?
Frequency Hopping stands for the dynamic changing of frequency during communications On each hop, only a burst of information is transmitted on one frequency The transmitter and the receiver must have the foreknowledge of the correct sequence of
frequency changes
Advantages on jamming The jamming frequency is not always the same, sometime jamming sometime not Spread Spectrum ability (FH-SS): the total transmission, viewed over a long period such 1 sec,
appears to occupy the entire bandwidth (spreading of spectrum)
We are not trying to eliminate interference with channelization, interference levels will rise
gradually with the number of mobiles
Advantage on multi-path fading Deep fades tend to be frequency selective If the hops are separated by a given distance (coherence bandwidth = 600 KHz at 900 MHz), two
successive hops are not faded
The average fade on the whole frequency range is much less: equivalent of about 2-3 dB instead
of 20 dB
27 - 2006
Family of Frequency Hopping
Slow Frequency Hopping (SFH): GSM

Speed: 1733 times per second (at every burst) Base band hopping: few frequency are used Synthesized hopping: all spectrum can be used
Fast Frequency Hopping (FFH): military system

A burst is a very few bits: frequency hopping each n electric symbols
(eventually n=1) where 1 electric symbol = 1, 2 or 4 bits
The length of the burst must be lower than the propagation time from the
transmitter to the receiver (typically 10-100 microseconds)
The time the jammer detects the signal, the transmitter has already shifted to a
new frequency
The sequences are randomized
28 - 2006
SFH Base band hopping
0.577ms
TRX2 (f2)
f2
f2
f2
f2
f2
TRX1 (f1)
f1 f1 f0 1 2 3 4 5 6 7
f1 f0
f1
f1
TRX0 (f0)
f0 0
f0
f0
time
TDMA frame 4.62 ms
Base band hopping
29 - 2006
SFH Synthesized hopping
0.577ms
TRX2 (f1,f2)
f2
f1
f2
TRX1 (f1,f2)
f1
f1
f2
f2
f1
f1
TRX0 (f0)
f0 0
f0 1 2 3 4 5 6 7
f0
f0
f0
f0
time
TDMA frame 4.62 ms Synthesized hopping
30 - 2006
SFH Synthesized hopping

cy en qu
Power
F re
Interference threshold
Carrier Interferer 1, low power Interferer 2, high power
Time
31 - 2006
SFH Synthesized hopping parameters
Implementing synthesized frequency hopping allows the planner to assign much more frequency than TRX Gain in frequency diversity (quality of radio path is frequency dependent) Gain in interference diversity (successive bursts suffer from varying sources of
interference)
In TU50, diversity gains are low
New parameters: MAL, HSN and MAIO Size of Mobile Allocation Lists (number of frequency channels) per station Frequency to assign to Mobile Allocation Lists per station Hopping Sequence Number to assign to stations or sites (station versus site driven) Mobile Allocation Index Offset to assign to TRX New evaluation criteria: FER Frame Erasure Rate: number of erased vocal frame, that is after FEC application
32 - 2006
SFH Frequency diversity gains
Gain at 2% FER from random hopping in test conditions (Ref: GSM, GPRS and EDGE performance, WILEY, 2002)
33 - 2006
Synthesized hopping Parameters setting SITE DRIVEN

3 BCCH = 3 channels MAL TCH = 1 for all stations Size of MAL: greater than the number of TRX TCH on the site

STATION DRIVEN
3 BCCH = 3 channels MAL TCH = 1 per station Size of MAL: greater than the number of TRX TCH on the station
BCCH 1
BCCH 1
1 MAL TCH
BCCH 3 BCCH 2
3 MAL TCH
BCCH 3 BCCH 2
34 - 2006
Synthesized hopping Parameters setting

Let MAL = N frequencies (<= 62), FH is done on regular or pseudo-randomized cycle on N HSN features (BS level) Frequency involved in hopping are numerated from 0 to N-1 HSN in [1..(N-1)] Normalized algorithm A(FN, HSN) = sequence of numbers in [0..(N-1)], where FN is
the Frame Number (coded on 22 bits) inside the Hyper-Frame (3h30 of transmission)
One HSN per BS, and the BS and its MS are following the same sequence MAIO features (TRX level) MAIO is an index on sequences MAIO is in [0..(N-1)] One MAIO per TRX The MS computes the frequency to use adding MAIO (modulo N) to the current
frequency number
Two different MAIO on the same HSN define two orthogonal sequences
35 - 2006
Synthesized hopping Reuse Pattern
Characteristics of FP for synthesized hopping

Pattern 1.1 or 1.3 are sufficient to start Easy to add capacity: new TRX or new sites BCCH does not jump i.e. frequency plan is needed for BCCH assignment
Study for Optimized Fractional Reuse

Adaptation of MAL and frequency groups to condition of interference when
there is saturation on FER indicator
Some problems occur

Interference are much more difficult to identify Station configurations need retunes (cf. next slide)
36 - 2006
Synthesized hopping Interfering cells

Non hopping Cell are interfering continuously But interfering powers: low Synthesized hopping Cell are interfering with intermittence But interfering powers: high (HO areas) NB: further interfering cells (second circle
of neighbours) are still present but also intermittently and with a higher loss => not a problem
37 - 2006
SFH Quality thresholds in FER
FER evaluation with synthesized hopping: thresholds to 4% and 7% C/I mean: 12 dB on base band hopping network C/I mean: 8 dB on synthesized hopping network on theoretical conditions SFH quality measurement is complex Traffic load is needed Go from C/I to FER needs to estimate error corrections process between BER and FER NB: BER is calculated before the decoding with no gain from FH, so the BER is the same for all
hopping configuration
Simulated quality tables are required SFH gain is strong for TU3 and week for TU50 because of the natural diversity of the channel (fast variations)
At C/I = 9 dB TU3 TU50
FER without SFH 21% 6%
FER with SFH 3% 3%

38 - 2006
SFH FER(C/I) estimation
TU3 full hopping link with 6 interferers for different loads in the case of power control (Ref: GSM, GPRS and EDGE performance, WILEY, 2002)
39 - 2006

RE56 33 GSM TDMA Engineering

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

RE56 33 GSM TDMA Engineering

Uploaded by

Copyright:

Available Formats

GSM TDMA engineering

RE56 Spring 2006 Alexandre CAMINADA UTBM Computer Science Department

What is TDMA engineering ?

Frequency assignment Frequency hopping

Alexandre CAMINADA, UTBM

Frequency Division Multiple Access (FDMA)

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

1G analogue systems Plus: easy to do Minus: interference, fading

Communication 1 Communication 2 Communication 3

Alexandre CAMINADA, UTBM

Frequency-Time DMA (F-TDMA)

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Communication 1 Communication 2 Communication 3

Slow Frequency Hopping F-TDMA

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

GSM Plus: gain in interference, gain in fading Minus: complex to evaluate

Spectrum reuse in mobile networks

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Alexandre CAMINADA, UTBM

Interference brings by spectrum reuse

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Alexandre CAMINADA, UTBM

Downlink interference formulation

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Ptoti , j ' Li , j ' , orthogonality factor

Pei , j Li , j Pei ', j Li , j

Ptoti , j ' Li , j '

Distance of reuse between cells

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Alexandre CAMINADA, UTBM

Frequency reuse pattern between cells

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Alexandre CAMINADA, UTBM

The big problem of real cell coverage

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Nominal cell boundaries

Frequency Distance Weather Obstacle dependent

The big problem of real cell coverage

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Alexandre CAMINADA, UTBM

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Alexandre CAMINADA, UTBM

The theoretical basis of frequency assignment

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Alexandre CAMINADA, UTBM

Cells are overlapping each others

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Alexandre CAMINADA, UTBM

Carrier-to-Interference matrix computation

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Alexandre CAMINADA, UTBM

Carrier-to-Interference matrix computation

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Carrier-to-Interference matrix computation

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

0,12 0 0,34 0,08

Matrix of channel separations between cells

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Alexandre CAMINADA, UTBM

Major FAP problems for operators

1/ Spectrum use 2/ Frequency assignment 3/ Frequency hopping

Problem 2: Minimum Span FAP

Problem 3: Minimize Interference FAP