Professional Documents
Culture Documents
W CDMA Lectures
W CDMA Lectures
Literature
The Course book: WCDMA for UMTS. Radio Access For
Third Generation Mobile Communications. Edited by:
H.Holma, A. Toskala. 2000, John Wiley&Sons. 322 pp.
Also good reading:
UMTS Networks. Architecture, Mobility and Services. H.
Kaarinen et.al.. 2001,John Wiley&Sons. 302 pp.
Radio Network Planning and Optimisation for UMTS.
J.Laiho. et. al.. 2002. John Wiley&Sons. 484 pp.
The UMTS Network and Radio Access Technology. J.P.
Castro. 2001,John Wiley&Sons. 354 pp.
Specifications http://www.3gpp.org/
Multipath propagation
Link budget: to determine the expected signal level at a a given distance from
transmitter.
Covering area, Battery life
Fading Channel
Small-scale Fading
(Rayleigh, Rician)
Large-scale Fading
Path loss
Oscillation around
signal mean
Frequency selective
Fading
Flat Fading
Slow Fading
Fast Fading
(Short term/multipath)
Channel Bandwidth
Impact of wide bandwidth
The number of taps increases.
New tap amplitude statistics are
needed.
tx
rx
h( , t ) = hk e j 2 k t ( k )
fast fading generator
noise
source
noise
source
90
k =0
a1s
A1
a2s
fast
fading
generator
A2
aNs
fast
fading
generator
AN
-70
-80
-90
dB
-100
-110
-120
1600
1560
1520
1480
1440
1400
1360
1320
1280
1240
1200
1160
1120
1080
1040
1000
960
920
880
840
800
760
720
680
640
600
560
520
480
440
-140
400
-130
viive (ns)
am
plitudi (dB)
-80
-90
-100
-110
-120
-130
0
20
40
60
80
100
matka (m)
120
140
160
180
200
i
1
0
i/s
Pim/dB 2.5
class
Typical urban
i
1
0
i/s
Pim/dB 3.0
class
Rural area
i
1
0
i/s
Pim/dB 0
Rice
2
0.3
0
class
3
1.0
3.0
class
4
1.6
5.0
class
5
5.0
2.0
class
6
6.6
4.0
class
2
0.2
0
class
3
0.5
2.0
class
4
1.6
6.0
class
5
2.3
8.0
class
6
5.0
10.0
class
2
0.1
4.0
class
3
0.2
8.0
class
4
5
6
0.3
0.4
0.5
12.0 16.0 20.0
class class class
tap coefficient
distributions
6 s
t
f
Satellite cells
suburban,
rural macrocells
urban,
microcells
indoor,
picocells
Switching
Network
Mobile Stations
Fixed
Network
Base Stations
Problems
Interference due to the cellular structure, inter- and intra-cell interference
Mobility handling
Cell based radio resource scarcity
Interference
Intra-cell Interference
l
Inter-cell Interference
Reducing cell size: in smaller cells the frequency is used more efficiently.
Multilayer network design: macro-, micro-, pico-cells
P = E b Pb
I nW
Ij W=(n-1)P
P
Eb Rb
CIR =
=
(I j + I n + N 0 ) I 0 W
Cell breathing
30
Reasons
25
N = 40
N = 50
N = 60
N = 70
N = 80
20
15
10
s,i
P [dBm]
Outcome
10
0
200
400
600
Distance from BS [m]
800
1000
Mobility
Mobility provides the possibility of being reachable anywhere and any time for
the end-user
The mobility is provided through:
Handover: gurantees that whenever the mobile is moving from one BS
area/cell to another, the signal is handed over to the target BS.
When there is no continuous active radio link between mobile and BS the mobility
is supported by:
Location update: user registers in the network that it can be found in given
area. Mobile always initiates the location update procedure.
Paging: indication to the user about the the need for transaction. Paging
procedure is always initiated by the network.
Cellular generations
1G Systems: NMT, AMPS, TACS.
3G
2G Systems: GSM, DAMPS,
- Seamless Roaming
- Service Concepts & Models
IS-136, IS-95,PDC.
- Global Radio Access
- Global Solution
3G Systems:
2G
WCDMA
- Advanced Mobility (Roaming)
(UMTS,UTRA
- More Services (Data Presence)
- More Global solution
FDD+TDD)
cdma2000
1G
EDGE
- Basic Mobility
- Basic Services
- Incompatible
1980
1990
2000
Well specified system with major interfaces open and standardised. The
specifications generated should be valid world-wide.
Added value to the GSM. However, in the beginning the system must be
backward compatible at least with GSM and ISDN.
Multimedia and all of its components must be supported throughout the system
The radio access of the 3G must provide wideband capacity be generic enough
in order to become available world-wide. The term wideband was adopted to
reflect the capacity requirements between 2G narrowband capacity and the
broadband capacity of the fixed communications media.
The services for end-users must be independent from radio access technology
details an the network infrastructure must not limit the services to be
generated. That is, the technology platform is one issue and the services using
the platform are totally another issue.
connection everywhere
interconnection between networks
billing and accounting functions for all various
interest
security
Network management is cost efficient and
spectrum efficient manner
global standards
public and private networks
ubiquitous services
terminal mobility
personal mobility
service mobility
System providers:
Business information:
mobile office,
virtual workshop.
Special services:
tele-medicine,
security monitoring,
instant help line,
personal administration.
Communication services:
video telephony,
video conference,
personal location.
Business and financial services
virtual banking,
on-line billing.
3G technical requirements
Bit Rate:
Rural outdoor 144 kbps (500 km/h).
Suburban outdoor 384 kbps (120 km/h) .
Indoor 2 Mbps (10 km/h).
Some teleservices are standardised because that interworking with other systems have been
recognised as a requirement.
TE
TAF
MT
UE
UE: User Equipment
MT: Mobile Termination
TE: Terminal Equipment
TAF: Teminal Adaption Function
PLMN
possible
transit
network
Terminating
network
TE
Definitions (1)
Basic telecommunication service : this term is used as a common reference to both bearer services
and teleservices.
Bearer service : is a type of telecommunication service that provides the capability of transmission of
signals between access points.
Call : a logical association between several users (this could be connection oriented or connection
less).
Connection : is a communication channel between two or more end-points (e.g. terminal, server etc.).
Multimedia service : Multimedia services are services that handle several types of media. For some
services, synchronisation between the media is necessary (e.g. synchronised audio and video). A
multimedia service may involve multiple parties, multiple connections, and the addition or deletion of
resources and users within a single call.
Quality of Service : the collective effect of service performances which determine the degree of
satisfaction of a user of a service. It is characterised by the combined aspects of performance factors
applicable to all services, such as;
Definitions (2)
Service Capabilities: Bearers defined by parameters, and/or mechanisms needed to realise services.
These are within networks and under network control.
Service Capability Feature: Functionality offered by service capabilities that are accessible via the
standardised application interface
Teleservice; is a type of telecommunication service that provides the complete capability, including
terminal equipment functions, for communication between users according to standardised protocols
and transmission capabilities established by agreement between operators.
Bearer Services
Bearer services provide the capability for information transfer between access
points and involve only low layer functions.
The user may choose any set of high layer protocols for his communication.
A communication link between access points provides a general service for
information transport.
The communication link may span over different networks.
Bearer services are characterised by a set of end-to-end characteristics with
requirements on QoS. QoS is the end-to-end quality of a requested service as
perceived by the customer.
Requirements on the Bearer Services
Information transfer:
Traffic type: quaranteed/constant bit rate, non-quaranteed/dynamic variable bit rate, real
time dynamic variable bit rate with a minimum guaranteed bit rate.
Information quality
Maximum transfer delay: Transfer delay is the time between the request to
transfer the information at one access point to its delivery at the other access
point.
Bit error ratio: The ratio between incorrect and total transferred information
bits.
Data rate: The data rate is the amount of data transferred between the two
access points in a given period of time.
Conversational
voice and video
Voice messaging
E-commerce,
Error
WWW browsing,
Telnet,
intolerant interactive games
Streaming audio
and video
Conversational
Interactive
Streaming
(delay <<1 sec) (delay approx.1 sec) (delay <10 sec)
Fax
E-mail arrival
notification
Background
(delay >10 sec)
QoS requirements
Real Time (Constant Delay)
Operating
BER/Max Transfer Delay
BER/Max Transfer Delay
environment
Max Transfer Delay less than 400 ms
Max Transfer Delay 1200 ms or more
Satellite
(Note 2)
(Terminal
relative speed to BER 10-3 - 10-7
(Note 1)
BER = 10-5 to 10-8
ground up to
1000 km/h for
plane)
Max Transfer Delay 20 - 300 ms
Max Transfer Delay 150 ms or more
Rural outdoor
(Note 2)
(Terminal
relative speed to BER 10-3 - 10-7
BER = 10-5 to 10-8
ground up to 500 (Note 1)
km/h) (Note 3)
Max Transfer Delay 150 ms or more
Urban/ Suburban Max Transfer Delay 20 - 300 ms
(Note 2)
outdoor
BER
10-3
10-7
(Terminal
BER = 10-5 to 10-8
relative speed to (Note 1)
ground up to 120
km/h)
Max Transfer Delay 20 - 300 ms
Max Transfer Delay 150 ms or more
Indoor/ Low
(Note 2)
range outdoor
BER
10-3
10-7
(Terminal
BER = 10-5 to 10-8
relative speed to (Note 1)
ground up to 10
km/h)
NOTE 1; There is likely to be a compromise between BER and delay.
NOTE 2; The Max Transfer Delay should be here regarded as the target value for 95% of the data.
NOTE 3; The value of 500 km/h as the maximum speed to be supported in the rural outdoor environment
was selected in order to provide service on high speed vehicles (e.g. trains). This is not meant
to be the typical value for this environment (250 km/h is more typical).
Audio
Application
Degree of
symmetry
Data rate
Conversational
voice
Two-way
4-25 kb/s
Video
Videophone
Two-way
32-384
kb/s
Data
Telemetry
- two-way
control
Interactive games
Telnet
Two-way
<28.8
kb/s
Data
Data
Two-way
Two-way
(asymmetri
c)
< 1 KB
< 1 KB
Delay
Variation
within a
call
Information
loss
<150 msec
preferred
<400 msec limit
Note 1
< 150 msec
preferred
<400 msec limit
Lip-synch : < 100
msec
< 250 msec
< 1 msec
< 3% FER
< 1% FER
N.A
Zero
N.A
N.A
Zero
Zero
Audio
Application
Voice messaging
Degree of
symmetry
Data rate
Primarily
one-way
One-way
Delay
Delay
Variation
< 1 msec
4-13 kb/s
Information loss
< 3% FER
< 2 sec for
record
Data
Web-browsing
Primarily
one-way
N.A
- HTML
Data
Data
Zero
Transaction
services high
priority e.g. ecommerce, ATM
Two-way
Primarily
(server access)
One-way
< 4 sec
N.A
Zero
< 4 sec
N.A
Zero
Application
Degree of
symmetry
Data rate
Audio
High quality
streaming audio
Primarily
one-way
32-128
kb/s
Video
One-way
One-way
32-384
kb/s
Data
Bulk data
transfer/retrieval
Primarily
one-way
One-way
Delay
Delay
Variation
< 10 sec
< 1 msec
< 10 sec
< 10 sec
Information loss
< 1% FER
< 1% FER
N.A
Zero
Data
Still image
One-way
Data
Telemetry
One-way
- monitoring
<28.8
kb/s
< 10 sec
N.A
Zero
< 10 sec
N.A
Zero
Teleservices
When applications use the generic service capability features, these applications
become independent of (portable over) underlying service capabilities.
Execution environment
The execution environment is a set of standardised capabilities that shall allow the
support of home environment/serving network (HE/SN) specific services (i.e. both
applications, teleservices and supplementary services). The execution environment
shall be distributed between the IC card, terminal and network nodes
Building blocks of execution environment:
A standardised content description language for support of HE/SN specific user interfaces
(both for information output and user input).
A standardised procedural language for
support of HE/SN specific scripts. This
language shall be common to all types of
platforms.
The scripts could be used for e.g. improving
the user interface, adding new features to the
terminal like the latest version of a codec,
controlling the execution of a service.
Execution Environment
Service
Logic 1
Mobility
Man.
Service
Logic 2
Call /Session
Control
Terminal/IC card
Service
Logic N
Bearer
Control
Tele services:
Speech.
Emergency call.
Short Message Service.
Cell Broadcast service CBS.
Bearer Services:
Information quality
attributes.
Service capabilities:
Mobile Service Execution
Environment.
Location Services.
SIM application toolkit.
Circuit-switched data.
Packet-switched data.
Defined by their attributes:
Information transfer
attributes.
Supplementary services:
Regulation
Legal-administrative aspects:
Spectrum allocation.
Technical standardisation.
Economic-political aspects:
The spectrum made available such
that:
System providers and users are
satisfied.
Spectrum efficiently used.
Technical-engineering
factors
Regulation
Legal-administrative
factors
Economic-political
factors
3G Spectrum
ITU
EUROPE
JAPAN
USA
IMT200
GSM1800
IMT200
PHS
IMT2000
PCS
MSS
IMT2000
MSS
MSS
IMT200
MSS
MSS
IMT200
MSS
MSS
MSS
MHz
1900
2000
2100
In Europe:
WCDMA-FDD 2110-2170 MHz downlink. 1920-1980 MHz uplink,
WCDMA-TDD 1900-1920 and 2020-2025.
2200
EU projects
RACE I
basic studies
1988
RACE II
ATDMA
CODIT
1992
ACTS/FRAMES
FMA1:WTDMA
FMA2:WCDMA
1995
1997
1998
ETSI decision
WCDMA for
FDD operation
WCDMA
The basic system features
considered
Wideband CDMA
operation with 5 MHz,
Physical layer flexibility for
integration of all data rates
on a single carrier,
Frequency reuse 1.
WB-TDMA/CDMA
The basic system features considered
Equalisation with training sequences in
TDMA bursts,
Interference averaging with frequence
hopping,
Link adaptation,
Two basic burst types,
Low reuse size.
WB-TDMA/CDMA
OFDMA
Frequency hopping,
Inter-cell interference cancellation,
Support of adaptive antennas
Operation in TDD mode,
Dynamic Channel Allocation.
ETSI
T1P1
ARIB
TTA
3GPP
TTC
CWTS
3GPP evolvement
Different switching systems can be
combined with different radio access
parts.
Release 99:
strong GSM presence:
Backward compatibility with GSM,
Interoperation between UMTS and
GSM.
Va ria n t
Ra d io a c c e s s
3 G (US )
WCDMA, EDGE, IS 4 1
IS - 9 5 , GS M19 0 0 ,
CDMA2 0 0 0
TDMA
3 G (Eu ro p e )
2 G Ba s is
WCDMA, GS M, ED
Ad va n c e d GS M NGS M9 0 0 /18 0 0
a n d p a c ke t c o re
3 G (J a p a n )
UTRAN
Release 4:
Separation of user data flows and control mechanisms,
Narrowband TDD with 1.28 Mchips/s,
Position location functionality.
S witc h in g
Release 5:
End-to-end packet switched cellular network using IP,
Downlink data rate more than 10 Mbits/s.
GERAN.
WCDMA
Ad va n c e d GS M NP DC
a n d p a c ke t c o re
IMT200
TDMA
Single Carrier
Multi-Carrier
CDMA
Multi-Carrier
Direct Spread
3.84 Mcps
3.6864 Mcps
TDD
3.84 Mcps
1.28 Mcps
2G (GSM) vs 3G (WCDMA)
Carrier spacing
Frequency reuse factor
Power control frequency
Quality control
Frequency diversity
Packet data
Dowlink transmit
diversity.
WCDMA
GSM
5 MHz
1
1500 Hz
Radio resource management
algorithms
5 MHz bandwidth gives multipath
diversity with RAKE receiver
Load based packet scheduling
200 kHz
1-18
2 Hz or lower
Network planning
(Frequency planning)
Frequency hopping
Evolution types
Technical Evolution
2G
Network Evolution
3G
Service Evolution
Evolution contains not only technical evolution but also expansion to network
architecture and services.
Technical evolution: how network elements are developed and with witch
technology.
Network evolution: in result of network element evolutions the general
functionality of the network is changing.
et
k
c
Pa
100k
64k
t
cui
r
i
C
10k
E
D
G
E
HSCSDG
P
14.4
R
S
9.6
SMS
1k
1998
1999
2000
2001
2002
MS
BSS
BTS
BSC
TRAU
NSS
MSC/VLR
GMSC
ISDN
PSTN
PSPDN
CSPDN
HLR/AuC/EIR
Call control.
BSS control functions.
Internetworking functions.
Charging,
Statistics,
Interface signalling towards BSS and external networks.
MS
BSS
BTS
BSC
TRAU
NSS
MSC/VLR
GMSC
ISDN
PSTN
PSPDN
CSPDN
HLR/AuC/EIR
V
A
S
Value Added Service (VAS) platform: simple platform for supporting certain
type of services in GSM. (Short Message Service Centre (SMSC), Voice Mail
System (VMS))
Use standard interface towards GSM. May or may not have external interfaces
towards other networks.
MS
BSS
BTS
BSC
TRAU
NSS
MSC/VLR
ISDN
GMSC
PSTN
PSPDN
CSPDN
HLR/AuC/EIR
V
A
S
I
N
Outgoing Call
Processing
6. O_Exeption
10
O_Abandon
Orig. Attempt_Authorized
2. Collect_Info
Term._Attempt_Authorized
Collected_Info
3. Analyse_Info
13
T_Abandon
12
18
T_Called_Party_Busy
Analyzed_Info
11. T_Exeption
14
9. T_Alerting
Route_Select_Failure
O_Disconnect
9
O_Answer
5. O_active
15
T_Answer
O_Call_Party_Busy
6
T_No_Answer
O_Mid_Call O_No_Answer
10. T_Active
17
T_Disconnect
T_Mid_Call
16
BCSM
HSCSD
Network Management (NMS)
Um
MS
BSS
BTS
BSC
TRAU
NSS
MSC/VLR
ISDN
GMSC
PSTN
PSPDN
CSPDN
HLR/AuC/EIR
V
A
S
I
N
GPRS
Network Management (NMS)
Um
MS
BSS
BTS
BSC
NSS
TRAU
MSC/VLR
ISDN
GMSC
PSTN
PSPDN
CSPDN
HLR/AuC/EIR
V
A
S
I
N
SGSN
GGSN
Internet
Other Data NW
EDGE (1)
EDGE phase 1:
channel coding and modulation methods to provide up to 384 kbps data rate.
One GPRS terminal gets 8 time slots. The channel should be good.
EDGE phase 2:
Guidelines for achieving high data speed for circuit switching services.
EDGE (2)
Network Management (NMS)
Um
A
E-RAN
MS
BTS
BSC
NSS
TRAU
MSC/VLR
ISDN
GMSC
PSTN
PSPDN
CSPDN
HLR/AuC/EIR
V
A
S
I
N
GGSN
Internet
Other Data NW
A
E-RAN
MS
BTS
CN CS Domain
BSC
MSC/VLR
ISDN
GMSC
PSTN
PSPDN
CSPDN
HLR/AuC/EIR
Iu
Uu
V
A
S
C
A
M
E
L
M U
W
E S
A
X A
P
E T
Gb
CN PS Domain
UTRAN
UE
BS
RNC
SGSN
GGSN
Internet
Other Data NW
Iu
Services
Initially 3G offers same services as 2G.
Services transformed into PS domain.
Trends
Separation of connections in control and
services.
Conversion of the network towards all
IP.
Multimedia services provided by the
network.
3GPP R4 (2)
The 3GPP R4 introduces separation of connection, its control, and services for
CN CS domain.
Media Gateway (MGW): an element for maintaining the connection and
performing switching function when required.
MSC server: an element controlling MGW.
Packet switched voice (Voice Over IP).
The CS call is changed to the packet switched call in MGW.
For higher uniformity the CS and PS domain is mediated by IP Multimedia
Subsystem.
3GPP R4 (1)
Network Management (NMS)
Um
Iu
GERAN
MS
BTS
BSC
MSC Server
CN CS Domain
MGW
ISDN
MGW
PSTN CSPDN
UTRAN
UE
BS
CN PS Domain
IMS
RNC
SGSN
GGSN
IP, Multimedia
Uu
HSS
V
A
S
C
A
M
E
L
M U
W
E S
A
X A
P
E T
Iu
GERAN
MS
BTS
BSC
ISDN
PSTN CSPDN
IP/
ATM
CN PS Domain
UTRAN
UE
BS
IP/
ATM
IMS
RNC
IP/
ATM
SGSN
GGSN
IP, Multimedia
Uu
HSS
V
A
S
C
A
M
E
L
M U
W
E S
A
X A
P
E T
Future trends
Techniques:
OFDM
Services
Location based services. Many services existing at the same time at different
resolution.
Separation of users:
Commercial.
Private users.
Private users with specific needs.
3G Network architecture
Non-Access Stratum
CS Domain
USIM
Mobile
Equipment
Access
Network
Serving
Network
Access Stratum
Cu
Uu
PS Domain
Iu
Access Network
Domain
User Equipment Domain
Transit
Network
Yu
Infrastructure Domain
Stratum is the way of grouping protocols related to one aspect of the services
provided by one or several domains. (3GPP spec. TR 21-905)
Infrastructure domains:
Access network domain: physical entities managing the access network
resources and provides the users with mechanisms to access the core network.
Core network domain: physical entities providing support for the network
features and telecommunication services: management of user location
information, control of network features and services, switching and
transmission.
UMTS stratums
USIM - MT
Home Stratum
Application Stratum
USIM - HN
Application
MT - SN
SN - HN
Serving Stratum
USIM - MT
Serving Stratum
MT - SN
TE - MT
MT - SN
Transport Stratum
Transport Stratum
Access Stratum
MT - AN
Access Stratum
AN - SN
MT - AN
MT
TE
USIM
MT/ME
Access
Network
Domain
Serving
Network
Domain
Home
Network
Domain
AN - SN
Mobile
Equipment
Domain
Access
Network
Domain
Serving
Network
Domain
Transit
Network
Domain
Remote
Party
Transport stratum
Supports the transport of user data and network control signalling from other strata
through UMTS
consideration of physical transport formats used for transmission.
Mechanisms for error correction and recovery.
Mechanisms to encrypt data over the radio interface and in the infrastructure
part if required.
Mechanisms for adaptation of data to use the supported physical format.
Mechanism to transcode data to make efficient use of the radio interface.
May include resource allocation and routing local to the different interfaces.
The access stratum, which is specified to UMTS as the part of the trasnport
stratum.
Access stratum
Consists of User Equipment (UE) and infrastructure parts, as well as accesstechnique specific protocols between these parts.
Provides services related to the transmission of data over the radio interface
and the management of the radio interface to the other parts of UMTS.
The access stratum includes the following protocols:
Mobile termination - Access network (MT-AN) protocol supporting transfer of
detailed radio-related information to coordinate the use of radio resources
between MR and AN.
Access network - Serving Network (AN - SN) protocol supporting the access
from the SN to the resources provided by the AN. It is independent of the
specific radio structure of the AN.
Serving stratum
Consists of protocols and functions to route and transmit user of network
generated data/information form source to destination. The source and
destination may be within the same of different networks. It contains functions
related to telecommunication services, and includes:
USIM - Mobile termination (USIM - MT) protocol supporting access to
subscriber-specific information to allow functions in the user equipment
domain.
Mobile Termination - Serving Network (MT -SN) protocol supporting access
from MT to the services provided by the serving network domain.
Terminal Equipment - Mobile Termination (TE -MT) protocol supporting
exchange of control information between the TE and the MT.
Home stratum
Application stratum
UE user equipment
ME mobile equipment
USIM UMTS Service Identity
Module
RAN Radio Access Network
UTRAM UMTS RAN
GERAN GSM/EDGE RAN
Uu
UE
UTRAN
BS
Iu
CN
RNS
CN CS Domain
3G MSC/VLR
RNC
3G GMSC
BS
UE
Iur
BS
UE
HLR/Au/EIR
RNS
CN PS Domain
RNC
BS
Registers
SGSN
GGSN
Communication Control
CM
CM
Mobility Control
Mobility Control
MM
MM
MM
RRM
RRM
Open Interface Uu
Terminal (UE)
Open Interface Iu
UTRAN
CN
NMS
UMTS Services
Security Functions
Network Management
The higher location the layer has the bigger is the investment in people and ideas.
Value Added
Service Provider
Personalised services.
Personalised User Interface (within the capabilities
of terminals).
Consistent set of services from the user's perspective
irrespective of access e.g. (fixed, mobile, wireless
etc.) Global service availability when roaming.
Personal
Service
Environment
Provided and
Controlled by
Home
Environment
Contains
1:N
User
Profile
N:N
HE Value Added
Service Provider
Implementation of Services
Applications / Clients
Application
Interface
Applications/Clients
Proprietary
Service
Proprietary
Service
Capability
Feature
Proprietary
Service
Capability
Standardised
ervice
apability
eatures (+)
Service
capabilities
SC 1
SC 2
SC 3
SC 4
SC n
Network
Service
Capabilities
Pre-set by Standards, e.g.
CAMEL, SAT, MExE, access to
bearers etc.
terminal view
The Personal Service Environment describes how the user wishes to manage
and interact with their communications services.
User Interface Profile:
Menu settings: menu items shown, menu structure, the placement of icons.
Terminal settings: ringing tone and volume, font type and size, screen and text
colour, language, content types and sizes accepted.
Network related preferences: language used for announcements .
Define the scope for management of services by the user, for services provided by the
HE.
Manage:
service delivery based on for example end to end capabilities and/or user preferences.
the prepaid accounts (e.g. increase, decrease the credit, or pass the information to an.
application which manages the credit).
provision of services to users or groups of users.
Request:
version of specific services supported in serving network and terminal.
details (e.g. protocol versions and API versions) of available service capabilities supported in
the serving network, and terminals.
Bearer Service
TE
MT
UTRAN
CN Iu EDGE
CN gateway
End-toend Service
Local Bearer
Service
External Bearer
Service
CN
Bearer Service
Radio
Bearer Service
Iu
Bearer Service
Backbone
Bearer Service
UTRA
Service
Physical
Bearer Service
Backbone Phys.
Bearer Service
Lecture 3
Introduction to WCDMA
Outline
WCDMA handovers.
Soft handover.
Softer handover.
Frequency Hopping: The signal is spread by changing the frequency over the
transmitted time of the signal:
Fast frequency hopping.
Slow frequency hopping.
Time Hopping: The data is divided into frames, that itself are divided into time
intervals. The data is burst is hopped over the frames by utilising code sequences.
Background of SS
f2
f1
f3
f1
f3
f2
f1
f1
f3
f2
f1
f1
f3
f2
f1
f3
f2
f2
f1
f1
f1
f1
f1
f1
f1
f1
f1
f1
f1
z
kH
f1
00
50
f1
f1
f1
f1
f1
f1
Frequency
PN
generator
Mod-2
adder
modulator
I
PN
generator
Local
oscillator
Q
PN
generator
Mod-2
adder
modulator
Adder
Symbol
Spreading
Data
Chip
Spreading
Code
Data x Code
Spreading
Code
Data
Despreading
Own Spreading
Code
-1
+1
Own Data x Code
Despreading
Spreading
Code
-1
+1
-1
+1
Data after
multiplication
-1
+4
Data after
integration
-4
Other Spreading
Code
-1
+1
Other Data x Code
Despreading
Own Spreading
Code
Data after
multiplication
Data after
integration
-1
+1
-1
+1
-1
+4
-4
Codes (1)
Channelisation codes used for channel separation from the same source.
Scrambling codes.
Long Codes:
Good correlation properties.
Uplink: different users.
Downlink: different BS.
C41=(1,1,1,1)
C21=(1,1)
C42=(1,1,-1,-1)
C11=(1)
C43=(1,-1,1,-1)
C22=(1,-1)
C44=(1,-1,-1,1)
SF1
SF2
SF3
LSB
clong,2,n
DL scrambling sequences:
1+X7+X18
1+X5+X7+ X10+X18
clong,1,n
xn ( t )
yn ( t )
rn (t )
radio
channel
cn (t )
PSK
demodulator
correlator
znn (t )
x (t )
decision
circuit
n(t )
xn ( t )
cn (t )
sn (t )
symbol duration.
Channel Repeating
M 1
A multipath channel: h( , t ) = h e ( )
Received signal is convolution of the received signal and the channel.
y (t ) = h e s ( t )
k =0
L 1
l =0
j2
j2
kt
kt
amplitude
amplitude
amplitude
amplitude
chips
10
second tap
0
-1
0
1
chips
10
third tap
0
-1
0
1
chips
10
received signal
0
-1
0
6
chips
10
Modified
Combined
with channel
symbol
estiamate
Finger #1
Finger #2
Finger #3
Channel can rotate the signal to any phase and to any amplitude.
QPSK symbols carry information in phase.
Energy splitted to many finger -> combining.
Maximal ratio combining corrects channel phase rotation and weights
components with channel amplitude estimate.
Same method used also for antennae combining (BTS, MS), and softer
handover (BTS), and soft/softer handover (MS)
Correlator
Code
Generators
Delay
Equalizer
Channel
Estimator
Finger #1
Finger #2
Finger #3
Timing (Finger Allocation)
Matched
filter
Combiner
Own Spreading
Code
-1
+1
-1
+1
Despreading
Spreading
Code
Data after
multiplication
path 1
Data after
multiplication
path 2
Data after
integration
Path 1
Data after
integration
path 2
-1
+1
-1
+1
-1
+1
-1
+4
-4
+4
-4
1
0.9
0.8
0.8
0.6
0.7
0.6
0.4
0.5
0.2
0.4
0
0.3
0.2
-0.2
0.1
-0.4
-8
-6
-4
-2
0
-2.5
-2
-1.5
-1
-0.5
0.5
1.5
1.5
2.5
2.5
Matched filter
Predefined Parallel data
tap 127
tap 126
...
tap 0
Register 1
X
Incoming
Serial data
X
tap 127
tap 126
...
tap 1
Register 2
j l
Pk ,l e mk ,1 sk ( t uk ,l ) sk ( t ) dt
T
zk (t ) = 1T
0
L
+
Pk ,l e jl mk ,0 sk ( t uk ,l ) sk (t )dt
n
l
,
Pk ,l e jl mk sk ( t l ) + n ( t )
j k ,l
j k ,l
z ( t ) = Pk ,l e
mk ,1 sk ( t uk ,l ) sk ( t ) dt + Pk ,l e
mk ,0 sk ( t uk ,l ) sk (t )dt
L
un ,l
T1
un ,l
+
N L T1
n k
Pn ,l e
j n ,l
mn , 1 sn ( t un ,l ) sk ( t ) dt +
T0
un ,l
Pn ,l e
j n ,l
mn ,0 sn ( t un ,l )
sk (t )dt
+ n ( t ) sk ( t ) dt
T
n.
mn is the transmitted symbol to user n.
demodulator.
un ,l Delay of the user n path compared to the
user k path.
Example.
Assume:
Single symbol transmission with single symbol transmission.
Only one multipath component for each user ( L=1 ) and a real channel.
Single cell network.
2
MAI
= E Pn mi Rn ,k ( ui )
nNk
n2 = E n0 (t ) sk (t )
T
= E {n0 (t )n0 (u )}sk (t ) sk (u )dtdu
N N
= E PP
i j mi m j Rik ( ui ) R jk ( u j )
ii =0k jj =0k
T T
=
T T
2
= PP
i j E {mi m j } Rik ( ui ) R jk ( u j ) = PR
i ik ( ui )
N
i = 0 j =0
i k j k
i =0
i k
N0
(t u )sk (t ) sk (u )dtdu
2
N0 2
N
sk (t )dt = 0 Rkk (0)
2 T
2
P
R
(0)
E
k
kk
Pbe = Q
= Q
N0
2
Pn Rnk (un ) + 2 Rkk (0)
I +
N
n
k
In the asynchronous case when the delay u is uniformly distributed over the
symbol interval, the expected value of the correlation function ratio is about:
Rnk2 (un )
1
E 2
R
(0)
kk
3Gc
where Gc = N =
Rc
chip rate
=
= processing gain
Rs symbol rate
E
=
I +
Pk
Rnk2 (un )
+
Pn 2
(0)
R
N
kk
N0
2
Rkk (0)
nk
Pk
Rs
+
P
n
3W
N
Assume: Pk = Pn
N0
2
Rs
nk
If the target SIR ratio given we can estimate the average capacity in the cell.
Assumptions made:
Powers have the same level:
Near far effect.
power control suitable for uplink.
No intracell interference:
can be considered by the intracell interference factor.
Other cells change the transmission power in the same way than the users cell.
Orthogonality:
In downlink all the codes from one BS synchronous - codes orthogonal - no
interference.
Multipath channel ruins orthogonality.
Can be considered in downlink as orthogonality factor.
E
I +
I
Total interference
= the noise density in demodulator =
W
entire spread bandwidth
Pn
received signal power
= received energy per bit =
Rn
data rate
I = ( N 1) Pn
SIR =
W
W
CIR =
R
R
Pk
(1 ) Pn +
N
n k
P0,0
K0 1
P
k =1
k ,0
N K j 1
+ Pk , j +
j =1 k =1
P0 ,0
CIR
+ P1,0 + ... + PK 0 ,0 +
P0 ,0
P1 ,0
CIR
+ ... + PK 0 ,0 +
K j 1
Pk , j + = 0
j =1 k =1
K j 1
j =1 k =1
Pk , j + = 0
M
P0 ,0 + P1,0 + ...
PK 0 ,0
CIR
K j 1
j =1 k =1
Pk , j + = 0
where
Pk ,i
M
S
2
M
S
3
Received power at BS
Received power at BS
Radio tower
M
S
1
M
S
1
M
S
2
M
S
3
Downlink: Beacause of the nature of attenuation at the cell border the users
experience higher interference that near to the BS. They have high level of
interfering signals from own BS and from other BS.
Amplitude
Uplink
Power control in uplink must make signal powers from different users nearly
equal in order to maximise the total capacity in the cell.
Downlink
In downlink the power control must keep the signal at minimal required level in
order to decrease the interference to users in other cells.
Time
Channel
Encoder
Source
Encoder
Modulation
Multiple access
interference
Channel
C/I target
Noise
Receiver
Source
Decoder
Power
control
Channel
decoder
FER
Demodulation
BER
C/I
Open Loop PC
What is initial transmission power?
BCCH
RACH/CPCH
- MS sets the initial transmission power Ptr
in RACH/CPCH and waits for ack.
- if no ack during TCPCH
Ptr(i+1) = Ptr(i) + P
Uses channel in other direction for transmitting the order for power change.
coder
decoder
m odulator
channel
dem odulator
dem odulator
channel
m odulator
coder
decoder
Control range
uplink
80 dB
downlink 30 dB
Fast PC
Uplink:
Behaviour precisely standardised.
Downlink:
Precise algorithm not standardised
Outer loop PC
Downlink
located in UE, the initial control parameters are set by UTRAN
receives inputs of the quality estimates of the transport channel
Effectiveness of PC (1)
The figure of fading from the file.
Uplink:
In uplink an effective power control follows fading as good as possible.
In the own BS received powers are equal. In other BS high variations.
Downlink:
The power control attempts to estimate the overall interference level in the
cell (system).
The PC attempts to provide good CIR to the as many users as possible.
Intra-system handovers:
Intra-frequency handovers.
MS handover within one cell between different sectors: softer
MS handover between different BS:
Soft.
Hard.
Inter-frequency handovers.
Hard
Inter-system handovers:
Handover between WCDMA <--> GSM900/1800: Hard
Handower between WCDMA/FDD <--> TDD: Hard
WCDMA handovers
Softer handover
Radio tower
Soft handover
User has at the same time connection to more than one BS.
Except PC bits exactly the same information is sent via air interface.
Soft handover probability 20-40 %.
UL/DL processing different.
MS: At Rake Maximal Ratio Combining of signals from different BS.
BS: Frame selection. Extra transmission across Iub.
me
Fra
CN
RNC
info
y
t
i
l
abi
reli
Fra
me
reli
a
bili
ty
Radio tower
info
Radio tower
P
[d b ]
Transmitted power in UL
P
[d b ]
in c re a s e o f
tra n sm itte d p o w e r
Transmitted power in DL
P
[d b ]
C e ll s ite 1
C e ll
b o u n d a ry
C e ll s ite 2
Handover procedure
Signal Strength
Handover margin
Summed Signal
Signal B
Signal A
Time
Cell B
Cell A
Radio tower
Radio tower
Upper threshold: the level at which the signal strength of the connection is at
the maximum acceptable level in respect with the requested QoS.
Lower threshold: is the level at which the signal strength of the connection is
at the minimum acceptable level to satisfied the required QoS. Thus the signal
strength of the connection should not fall below it.
Handover margin: is a predefined parameter, which is set at the point where
the signal strength of the neighbouring cell (B) has started to exceed the signal
strength of current cell (A) by a certain amount and/or for a certain time.
Active Set: is a set of signal branches (Cells) through which the MS has
simultaneously connection to the UTRAN.
Candidate Set: is a list of cells that are not presently used in the soft handover
connection, but whose pilot E/I are strong enough to be added to the active set.
Candidate set is not used in WCDMA handover algorithm.
Neighbour Set: The neighbour set or monitored set is the list of cells that the
mobile station continuously measures, but whose pilot E/I are not stron enough
to be added to the active set.
WWW traffic
The technology develops on various levels => has impact on the results
- Internet bandwidth is increasing
- Processing power of both clients and servers is increasing
- New software versions offer more capabilities
Changes in the user behavior and the contents of Internet
- Amount of data in Internet is increasing
- People use WEB more frequently
- Number of items per page is increasing
Physical distances remain => Round trip time (RTT)
The UMTS-network
aimed to cover almost all the data transmission needs of the users
different delay and other quality demands
the behavior of most significant services present in the network is needed to
- follow the effects of changes loading
- evaluate the functionality of the network
- evaluate the service quality
(see lect. 1 p. 32-36)
- control them (for example the usage of priorities)
WAP traffic
to provide a mobile user a WWW like access to the Internet.
a HTTP-like protocol optimized to the wireless domain.
Uses TCP and IP protocols for transmission
The measurements used circuit switched GSM data and WAP protocol 1.0.
The traffic logged simultaneously from both sides of the gateway.
The effects of wireless and Internet connection and the gateway separated
already the activity during WAP-transaction < voice activity (esp. uplink)
IP-packet
Nibble
Burst
TCP/ WSPconnection
WWW/WAPitem
WWW/WAPpage
WWW/WAPsession
k
f x ( x) = +1
x
0
Fx ( x) =
k )
1
x
k
=
1
k 2
2
=
( 2) ( 1)
,x k
(0.1)
,k < x
,k x
(0.2)
, 1
(0.3)
, > 2
(0.4)
when < 2 the variance and when < 1 also the mean become infinite
normally the Pareto distribution is limited to area 1 < < 2
1 (k x )
Fx ( x) =
1 ( k T )
,k < x
,k x T
(0.5)
,x >T
Geometric CDF
directly from Matlab defined as
F ( x p) =
floor ( x )
i =0
pq i
where q = 1 p
(0.6)
Since the mathematical distribution starts from zero to reach the aimed mean P
must be set
P=
1
1 + mean
(0.7)
Presently there are distributions for the WAP-item size and WAP-transactions
internal timings
With Dwap , Npc and Dpc the problem is that IP address often changes during
WAP-sessions, when GSM-data connection disconnects for idle periods. After
that there in no information about the original user.
a browser-session does not model users on the higher levels.
122 550 WAP/WWW-items are distributed to 11697 browser-sessions of which
~ 10 % do overlap and only ~60 % are separated by over 5 minute period.
Figure 4.1
w a p
D www
D
p c
S e s s io n
N p c
D pc
Session
Npc
T
0 b
0 e
W S P /
W D P
T
0 a
0 d
2 b
Page
Ni
2 e
D pii
D pii
W S P /
W T P
T
2 a
0 c
2 d
D iud
2 f
2 c
Didu
Item
W W W Ite m
D iuu
D idd
A packet call
t
WWW surfing
UDD 8 kbit/s
UDD 32 kbit/s
UDD 64 kbit/s
UDD 144 kbit/s
UDD 384 kbit/s
UDD 2048 kbit/s
(originally
UDD 8 kbit/s)
Average number
of packet calls
within a session
Average reading
time between
packet calls [s]
Average amount of
packets within a
packet call []
Average
interarrival
time between
1
packets [s]
5
5
5
5
5
5
412
412
412
412
412
412
25
25
25
25
25
25
0.5
0.125
0.0625
0.0277
0.0104
0.00195
12
15
0.96
The different interarrival times correspond to average bit rates of 8, 32, 64, 144, 384 and 2048 kbit/s.
Parameters for
packet size
distribution
k = 81.5
= 1.1
According to the values for and k in the Pareto distribution, the average packet size n is 480 and average requested filesize is Nd x = 25 x 480 bytes 12 kBytes. The packet size is limited to 66 666 bytes, giving a finite variance to the distribution. (First the truncations effect were neglected giving n = 896 bytes and Nd x = 15 x 896 bytes 13,4 kBytes.)
The principle of dividing the model to layers like session, packet call and a
packet is very good and describes the quite closely the actual process
major drawback in the presented model are:
1. it does not take in to the consideration the direction of the packets
- measured WWW traffic has great asymmetry
- delays are different for example up to Down (~RTT) and down to up
- used protocols can differ between Uplink and Downlink
2. WWW-pages are often composed of several (on average 4.8) WWW-items which use
more than one parallel TCP-connections.
3. the systematic usage of selected statistic distributions can mask out some typical
features.
- For example the datagram (=packet) size and average interarrival time distributions.
The timing diagram presented in the figure 2. WAP transaction is there divided in
following parts:
1. WAP-request transmitting time T0A/T2A. Calculated by dividing the packet size
by line speed 9,6 kbit/s
2. WAP-request processing time in Gateway T0B/T2B
3. WWW-transaction waiting time T0C/T2C
4. WAP-response processing time T0D/T2D
5. WAP-response transmitting time T0E/T2E. Calculated by dividing the packet size
by line speed 9,6 kbit/s.
6. WAP-response acknowledgement time T2F (only in WTP). The time used by to
the Mobile terminal to (process and) accept the WAP-response. The minimum =
26 ms. The measured from 32 ms to 12,6 s (mean 778 ms).
WSP/WDP WAP1 ( =
WSP/WTP WWW
(WAP0)
WAP2+rep) (WAP2)
(WAP3)
Packets up
35 726
245 350
238 948 1 001 830
Packets down
35 831
297 241
242 609
940 535
Data-Packets up
35 726
123 288
122 550
137 550
Data-Packets down
35 831
175 996
121 366
321 312
IP-bytes up [kB]
4 838
14 777
14 508
95 673
IP-bytes down [kB]
17 287
66 681
56 262
153 376
Data-bytes up [kB]
3 802
7 044
6 974
55 035
Data-bytes down [kB]
16 248
57 466
48 740
179 741
Mean Item size up
136
136
136
136
Mean Item size down
479
479
479
479
Bursts
27 901
137 064
97 435
392 309
WAP/WWW-items
35 604
122 550
122 550
136 999
WSP/TCP-connections
35 604
122 651
122 651
138 299
WAP/WWW -pages
28 882
85 243
89 492
122 500
WAP/WWW-sessions
3 028
11 722
11 723
7 467
Burst time [s]
15 178
171 667
160 526
127 716
Item time [s]
52 856
404 943
128 039
78 789
TCP-connection time [s]
52 856
541 389
270 440 75 731 900
Page time [s]
46 614
491 371
269 959
77 703
Session time [s]
491 546 1 901 940 1 708 820 2 369 690
Table 1. The main statistics of data measured Packets, IP-bytes and Data-bytes, the mean sizes of
WAP&WWW-Items, the numbers and total lengths of Bursts, Nibbles, WSP-connections, WAP&WWWitems, -pages and -sessions.
Means
Medians
ms
%
ms
%
113,36
6,9
112,00 20,0
24,80
1,5
2,00
0,4
541,59 32,8
79,40 14,2
591,33 35,8
50,10
9,0
381,38 23,1
316,00 56,5
1652,46 100
559,50 100
ms
%
ms
%
75,23
6,7
63,10 10,1
22,37
2,0
2,51
0,4
469,48 41,8
141,00 22,6
101,94
9,1
20,00
3,2
454,17 40,4
398,00 63,7
777,72 69,2
708,00 113,4
1123,19
100
624,61
100
Mean for
models
ms
113,30
6,07
453,72
73,62
393,74
1040,44
ms
75,81
19,24
451,04
352,89
452,98
764,21
%
10,9
0,6
43,6
7,1
37,8
100
%
5,6
1,4
33,4
26,1
33,5
56,5
1351,95 100
Means
Medians
WSP/WDP
WAP-Transaction duration
WAP-Page duration
WAP-session duration
WAP-Transaction separation
WAP-Page separation
WAP-session separation
WSP/WTP
WAP-Transaction duration
WAP-Page duration
WAP-session duration
WAP-Transaction separation
WAP-Page separation
WAP-session separation
Mean for
models
s
1,979
0,636
2,109
0,695
162,828
71,295
881
5,815
1087
9,505
10223 1119,505
s
s
s
2,280
1,335
3,092
1,855
145,842
70,875
254
7,865
348
14,025
2537 446,925
Table 3. The average times for duration and separation for WAP-transactions, WAP-pages and
WAP-sessions.
UE
Node B
Iub
IuCS
SMSC
/VLR
Iur
SS7
SS7
GMSC
HLR EIR
Auc
Node B
SGSN
RNC
Uu
Node B
IuPS
Iub
UTRAN
Jussi Tuominen 30.1.2002
GGSN
Gn
Gi
Core Network
UTRAN Architecture
Hierarchical Architecture
Node B
RNC
Node B
Uu
UTRAN Elements:
Iub
Iur
IuCS
Node B
RNC
Node B
Uu
Iub
RNS
UTRAN
Jussi Tuominen 30.1.2002
IuPS
Macro Diversity
Node B
Iu
RNC
Uu
Node B
Iub
Softer Handover
Iur
UE
1 RNC
Node B
RNC
Uu
Node B
Iub
RNS
UTRAN
1 BS
Macro Diversity
Node B
Iu
RNC
Uu
Node B
Iub
Soft Handover
Iur
UE
1 RNC (MDC)
Node B
RNC
Uu
Node B
Iub
RNS
UTRAN
Number of BSs
Macro Diversity
Node B
Iu
SRNC
Uu
Node B
Iub
Iur
UE
DRNC
Node B
Iub
RNS
UTRAN
Number of BSs
1 Serving RNC (MDC)
Node B
Uu
Soft Handover
Macro Diversity
Node B
Iu
SRNC
Uu
Node B
Iub
Iur
UE
Node B
DRNC
Uu
Node B
Iub
RNS
UTRAN
SRNC Anchoring
Iu
Macro Diversity
Node B
Iu
RNC
Uu
Node B
Iub
SRNC Relocation
Iur
UE
Node B
SRNC
Uu
Node B
Iub
RNS
UTRAN
Iu
Node B
Standardisation term (normally called as Base Station)
Comparable to Base Tranceiver Station in GSM
Responsible for Air Interface Layer 1
Key Node B Functions:
Modulation and spreading
RF Processing
Inner-loop power control
Rate matching
Macro diversity combining/splitting inside Node B
Control Plane
User Plane
Application
Protocol
Data
Stream(s)
Transport
Network
Layer
Transport Network
User Plane
Transport Network
Control Plane
ALCAP(s)
Signalling
Bearer(s)
Signalling
Bearer(s)
Physical Layer
Transport Network
User Plane
Data
Bearer(s)
UE
Node B
Iub
IuCS
SMSC
/VLR
Iur
SS7
SS7
GMSC
HLR EIR
PSTN
Auc
Node B
SGSN
RNC
Uu
Node B
IuPS
Iub
UTRAN
Jussi Tuominen 30.1.2002
GGSN
Gn
PDN
Gi
Core Network
Iu-CS
Radio
Network
Layer
Transport
Network
Layer
Control Plane
User Plane
RANAP
Iu UP Protocol
Layer
Transport Network
User Plane
Transport Network
Control Plane
Transport Network
User Plane
Q.2630.1
SCCP
Q.2150.1
MTP3b
MTP3b
SSCF-NNI
SSCF-NNI
SSCOP
SSCOP
AAL5
AAL5
AAL2
ATM
Physical Layer
Iu-PS
Radio
Network
Layer
Control Plane
User Plane
RANAP
Iu UP Protocol
Layer
Transport
Network
Layer
Transport Network
User Plane
Transport Network
Control Plane
Transport Network
User Plane
SCCP
M3UA
MTP3-B
SCTP
SSCF-NNI
SSCF-NNI
UDP
IP
SSCOP
AAL5
GTP-U
IP
AAL5
ATM
ATM
Physical Layer
Physical Layer
UE
Node B
Iub
SMSC
/VLR
Iur
SS7
SS7
GMSC
HLR EIR
PSTN
Auc
Node B
SGSN
RNC
GGSN
Gn
Uu
Node B
Iub
IuBC
UTRAN
PDN
Gi
CBC
Core Network
Iu-BC
Radio
Network
Layer
Transport
Network
Layer
SA Broadcast Plane
SABP Protocol
Layer
Transport Network
User Plane
TCP
IP
AAL5
ATM
Physical Layer
Jussi Tuominen 30.1.2002
UE
Node B
Iub
IuCS
SMSC
/VLR
Iur
SS7
SS7
GMSC
HLR EIR
PSTN
Auc
Node B
SGSN
RNC
Uu
Node B
IuPS
Iub
UTRAN
Jussi Tuominen 30.1.2002
GGSN
Gn
PDN
Gi
Core Network
Iur
Radio
Network
Layer
Transport
Network
Layer
Control Plane
User Plane
RNSAP
Iur Data
Stream(s)
Transport Network
User Plane
Transport Network
Control Plane
Transport Network
User Plane
ALCAP(Q.2630.1)
STC (Q.2150.1)
SCCP
MTP3-B
M3UA
MTP3-B
M3UA
SSCF-NNI
SSCF-NNI
SCTP
SSCF-NNI
SSCF-NNI
SCTP
SSCOP
IP
SSCOP
IP
AAL5
AAL5
AAL2
ATM
Physical Layer
UE
IuCS
SMSC
/VLR
Node B
Iub
Iur
SS7
SS7
GMSC
HLR EIR
PSTN
Auc
Node B
SGSN
RNC
Uu
Node B
IuPS
Iub
UTRAN
Jussi Tuominen 30.1.2002
GGSN
Gn
PDN
Gi
Core Network
Iub
Radio Network
Control Plane
Q.2630.1
Q.2150.2
Transport
Layer
SSCF-UNI
SSCF-UNI
SSCOP
SSCOP
AAL Type 5
AAL Type 5
AAL Type 2
ATM
Physical Layer
CPCH FP
ALCAP
USCH FP
DSCH FP
PCH FP
FACH FP
RACH FP
Node B
Application Part
(NBAP)
User Plane
DCH FP
Radio
Network
Layer
Transport
Network
Control Plane
IuCS
RNC
Uu
UE
Node B
Iub
SMSC
/VLR
Iur
SS7
SS7
GMSC
HLR EIR
PSTN
Auc
Node B
SGSN
RNC
Uu
Node B
IuPS
Iub
GGSN
Gn
PDN
Gi
RNS
UTRAN
Jussi Tuominen 30.1.2002
Core Network
IuCS
RNC
Uu
UE
Node B
Nb
SMSC
Server
Mc
Mc
Nc
MGW
Iub
GMSC
Server
Iur
SS7
MGW
HLR EIR
PSTN
Auc
Node B
SGSN
RNC
Uu
Node B
IuPS
Iub
GGSN
Gn
PDN
Gi
RNS
UTRAN
Jussi Tuominen 30.1.2002
Core Network
MGCF
Cx
RNC
Uu
UE
Iub
Iur
Gr
MGW
MRF
Gi
SGSN
RNC
Node B
PSTN
Mr
Node B
Uu
Mc
CSCF
HSS
Node B
Mg
SGW
IuPS
Iub
Mm
PDN
GGSN
Gn
Gi
RNS
UTRAN
Jussi Tuominen 30.1.2002
Core Network
NOTE: Standardisation on-going!
MTP-3
MTP-3 B
MTP-3 B
M3UA
MTP-2
SSCF
SSCF
SCTP
MTP-1
SCCOP
SCCOP
IP
AAL5
AAL5
ATM
G.804
:KDW GRHV
6&73 GR"
M3UA
SCTP
IP
%\WHV
:KDW LV WKH
VWUXFWXUH RI 6&73"
Chunk Type
ELWV
5RZ
Verification Tag
M3UA
Checksum
SCTP
Chunk Flags
Chunk Length
1
6&73 +HDGHU
6&73 3D\ORDG HJ 08$ PHVVDJH
IP
MAP
CAP
T CAP
INAP
B S S AP
R ANAP
B ICC
S CCP
M3UA
S CT P (16+B ytes )
IS UP
H.248
RT P
T CP (20)UDP (8)
5DGLR#$FFHVV#1HWZRUN#$UFKLWHFWXUH
:LGHEDQG#&'0$#V\VWHPV
$WWH#/lQVLVDOPL
5HVHDUFK#0DQDJHU
1RNLD#5HVHDUFK#&HQWHU
4########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
$UFKLWHFWXUH#DQG#1RGHV
5########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
875$1#DQG#6\VWHP#$UFKLWHFWXUH
8X
,X
,X0&6
1RGH#%
86,0
1RGH#%
8(
06&2
9/5
516
,XE
&X
0(
51&
,XU
51&
1RGH#%
516
875$1
6########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
&6#H[W
,X036
6*61
,X0%&
1RGH#%
*06&
&%&
&1
+/5
**61
36#H[W
875$1#'HILQLWLRQV#*HQHUDO
:&'0$#UDGLR#LV#WKH#PDLQ#GLIIHUHQFH#LQ#6UG#JHQHUDWLRQ#875$1
FRPSDUHG#WR#*60#%66
875$1#DUFKLWHFWXUH#GHYHORSPHQW#ZDV#PDLQO\#EDVHG#RQ
IDPLOLDU#SULQFLSOHV#DQG#FRQFHSWV#IURP#*60
1R#QHHG#IRU#FRQFHSWXDOO\#QHZ#QHWZRUN#HQWLWLHV
7KH#HQWLWLHV#LQ#875$1#DUH=#5DGLR#1HWZRUN#&RQWUROOHU#+51&,#DQG
%DVH#6WDWLRQ#+%6,
1RWH#WKDW#VWDQGDUGV#XVH#WHUPLQRORJ\#1RGH#%#IRU#%DVH#6WDWLRQ
$W#D#KLJK#OHYHO#WKHLU#IXQFWLRQDOLW\#LV#VLPLODU#WR#*60#%6&#DQG#%76
UHVSHFWLYHO\
1HZ#UHIHUHQFH#SRLQW#,XU#LV#DGGHG#EHWZHHQ#51&V#IRU#PDFUR
GLYHUVLW\#VRIW#+2
51&#KDV#%JHQHUDO#SXUSRVH%#,X#LQWHUIDFH#WR#FRQQHFW#WR#&1
7########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
875$1#%DVLF#&RQFHSWV
875$1#FRQVLVWV#RI#D#VHW#RI#5DGLR#1HWZRUN
6XEV\VWHPV#FRQQHFWHG#WR#WKH#&1#WKURXJK 1RGH#%
51&
,X1
1RGH#%
516
516#FRQVLVWV#RI#D#5DGLR#1HWZRUN
,XE
,XU
&RQWUROOHU#DQG#RQH#RU#PRUH#1RGH#%V1#$
1RGH#%
1RGH#%#LV#FRQQHFWHG#WR#WKH#51&#WKURXJK
,XE#LQWHUIDFH1
&1
51&
1RGH#%
516
$#1RGH#%#FDQ#VXSSRUW#)''#PRGH/#7''
,X
875$1
PRGH#RU#GXDO0PRGH#RSHUDWLRQ1
51&#LV#UHVSRQVLEOH#IRU#WKH#+DQGRYHU#GHFLVLRQV#WKDW#UHTXLUH#VLJQDOOLQJ#WR#WKH
8(1
51&#FRPSULVHV#D#FRPELQLQJ2VSOLWWLQJ#IXQFWLRQ#WR#VXSSRUW#PDFUR#GLYHUVLW\
EHWZHHQ#GLIIHUHQW#1RGH#%1
1RGH#%#VXSSRUWLQJ#WKH#)''#PRGH#FDQ#FRPSULVH#DQ#RSWLRQDO
FRPELQLQJ2VSOLWWLQJ#IXQFWLRQ#WR#VXSSRUW#PDFUR#GLYHUVLW\#LQVLGH#D#1RGH#%1
,QVLGH#WKH#875$1/#WKH#51&V#FDQ#EH#LQWHUFRQQHFWHG#WRJHWKHU#WKURXJK#WKH#,XU1#,X
DQG#,XU#DUH#ORJLFDO#LQWHUIDFHV1#,XU#FDQ#EH#FRQYH\HG#RYHU#SK\VLFDO#GLUHFW
FRQQHFWLRQ#EHWZHHQ#51&V#RU#YLD#DQ\#VXLWDEOH#WUDQVSRUW#QHWZRUN1
8########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
+LHUDUFKLFDO#875$1#$UFKLWHFWXUH
&1
,XU
51&
,X
,XU
&1
51&
,XE
1RGH#%
1RGH#%
1RGH#%
,X
,X
,XU
,X
51&
,XE
1RGH#%
1RGH#%
1RGH#%
,XU
51&
,XE
1RGH#%
1RGH#%
1RGH#%
,XE
1RGH#%
1RGH#%
1RGH#%
2QH#KLJKHU#OD\HU#HQWLW\#FRQWUROV#VHYHUDO#ORZHU#OD\HU#HQWLWLHV
/RZHU#OD\HU#HQWLW\#KDV#RQO\#RQH#PDVWHU/#LW#FDQ#EH#FRQQHFWHG#WR
RQO\#RQH#KLJKHU#OD\HU#HQWLW\#RI#WKH#W\SH#+51&#DQG#GLIIHUHQW#&1
GRPDLQV,
9########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
51ROHV
&RQFHUQLQJ#RQH#FRQQHFWLRQ#EHWZHHQ#875$1#DQG#RQH#8(#/#WKH
IROORZLQJ#UROHV#RI#51&V#H[LVW=
6HUYLQJ#51&#WKDW#FRQWUROV#WKH#FRQQHFWLRQV#WR#D#8(
'ULIW#51&#WKDW#OHQGV#LWV#UHVRXUFHV#IRU#WKH#6HUYLQJ#51&#IRU#D
SDUWLFXODU#8(
(DFK#51&#DOVR#KDV#WKH#&RQWUROOLQJ#51&#UROH#WRZDUGV#LWV#1RGH#%V
&1
51&
&1
6HUYLQJ
'ULIW
&RQWUROOLQJ
&RQWUROOLQJ
1RGH#%
:########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
6HUYLQJ
&RQWUROOLQJ
'ULIW
'ULIW
&RQWUROOLQJ
*HQHUDO#3URWRFRO#3ULQFLSOHV#LQ#875$1
;########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
$FFHVV#6WUDWXP#DQG#1RQ0$FFHVV#6WUDWXP
&&/#60/#00/
*00#+F0SODQH,>
%FDOO%#+X0SODQH,1+6,
1RQ0$FFHVV#6WUDWXP
5DGLR
SURWRFROV
+4,
5DGLR
SURWRFROV
+4,
&&/#60/#00/
*00#+F0SODQH,>
%FDOO%#+X0SODQH,1+6,
,X
SURWRFROV
+5,
,X
SURWRFROV
+5,
$FFHVV#6WUDWXP
8(
5DGLR
+8X,
875$1
,X
###&1
&RPPXQLFDWLRQ#EHWZHHQ#8(#DQG#&1#LV#LQ#1RQ0$FFHVV#6WUDWXP
$FFHVV#6WUDWXP#SURYLGHV#VHUYLFHV#IRU#1RQ#$FFHVV#6WUDWXP
875$1#LV#LQ#WKH#$FFHVV#6WUDWXP
,X#LV#LQ#WKH#$FFHVV#6WUDWXP
<########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
*HQHUDO#3URWRFRO#0RGHO#IRU#875$1
7HUUHVWULDO#,QWHUIDFHV
5DGLR
1HWZRUN
/D\HU
7UDQVSRUW
1HWZRUN
/D\HU
&RQWURO#3ODQH
8VHU#3ODQH
$SSOLFDWLRQ
3URWRFRO
'DWD
6WUHDP+V,
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
7UDQVSRUW#1HWZRUN
&RQWURO#3ODQH
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
$/&$3+V,
6LJQDOOLQJ
%HDUHU+V,
6LJQDOOLQJ
%HDUHU+V,
'DWD
%HDUHU+V,
3K\VLFDO#/D\HU
7KH#OD\HUV#DQG#SODQHV#DUH#ORJLFDOO\#LQGHSHQGHQW#RI#HDFK#RWKHU
,I#QHHGHG/#7UDQVSRUW#1HWZRUN#PD\#EH#FKDQJHG#LQ#WKH#IXWXUH#E\
GHFLVLRQV#LQ#WKH#VWDQGDUGLVDWLRQ1
43########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
(OHPHQWDU\#3URFHGXUHV#+(3,
7KUHH#FODVVHV=
&ODVV#4=#UHTXHVW#DQG#UHVSRQVH#+IDLOXUH#RU#VXFFHVV,
&ODVV#5=#UHTXHVW#ZLWKRXW#UHVSRQVH
&ODVV#6=#UHTXHVW#DQG#SRVVLELOLW\#IRU#PDQ\#UHVSRQVHV
,QGHSHQGHQW#RI#HDFK#RWKHU#+LQWHUDFWLRQV#VSHFLILHG#LQ#VSHFLDO
FDVHV,
6XFFHVVIXO#DQG#8QVXFFHVVIXO#+LI#DSSOLFDEOH,#RSHUDWLRQ#DV#ZHOO#DV
$EQRUPDO#&RQGLWLRQV#+LI#DSSOLFDEOH,#VSHFLILHG#IRU#HDFK#(3
(OHPHQWDU\#3URFHGXUHV#DUH#VSHFLILHG#LQ#WKH#LQWHUIDFH
VSHFLILFDWLRQV#+VWDJH#6#VSHFLILFDWLRQV,
8VLQJ#VHYHUDO#(3V#WRJHWKHU#LV#VSHFLILHG#LQ#VWDJH#5#VLJQDOOLQJ
IORZ#VSHFLILFDWLRQV
44########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
&OLHQW#0#6HUYHU#PRGHO
%HKDYLRXU#RI#&OLHQW#XQVSHFLILHG#+RQO\#XVDJH#RI#RSWLRQDO#,(V
VSHFLILHG,
%HKDYLRXU#RI#6HUYHU#VSHFLILHG#FOHDUO\#DQG#WKRURXJKO\
&OLHQW
QR#TXHVWLRQV#ZK\
45########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
5HTXHVW
6HUYHU
GHWDLOHG#VHUYLFH
%DFNZDUGV#DQG#)RUZDUGV#&RPSDWLELOLW\
6R#FDOOHG#%&RPSUHKHQVLRQ#5HTXLUHG%#SULQFLSOH#DSSOLHG
1R#YHUVLRQ#QXPEHU#LQ#PHVVDJHV
3URFHGXUHV#DQG#PDLQ#,(V#KDYH#%H[SOLFLW#,'%#DQG#%&ULWLFDOLW\%
LQGLFDWLQJ#ZKDW#LV#UHTXHVWHG#IURP#WKH#UHFHLYHU#LI#QRW#XQGHUVWRRG
7KH#VWUXFWXUH#IRU#,'#DQG#FULWLFDOLW\#FDQ#DOZD\V#EH#GHFRGHG/#L1H1#WKDW
VWUXFWXUH#LV#QHYHU#FKDQJHG
$OORZV#,(V#IURP#GLIIHUHQW#VWDQGDUG#YHUVLRQV#LQ#RQH#PHVVDJH
5HTXLUHV#KDQGOLQJ#RI#LQIRUPDWLRQ#DERYH#WKH#$6114#HQ2GHFRGLQJ
5$1$3#3'8
W\SH#RI
PHVVDJH
SURFHGXUH SURFHGXUH
FRGH
FULWLFDOLW\
46########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
5$1$3#PHVVDJH#YDOXH
#,G/#FULWLFDOLW\/#YDOXH
#,G/#FULWLFDOLW\/#YDOXH
1#1#1
,X#,QWHUIDFH
47########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
,X#,QWHUIDFH#&RQFHSW
8X
,X
,X0&6
1RGH#%
86,0
1RGH#%
8(
06&2
9/5
516
,XE
&X
0(
51&
,XU
,X036
6*61
$FFHVV#1RGH
IRU#&60GRPDLQ
$FFHVV#1RGH
IRU#360GRPDLQ
,X0%&
1RGH#%
51&
1RGH#%
516
875$1
48########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
&%&
&1
$FFHVV#1RGH
IRU#%&0GRPDLQ
,X#)XQFWLRQDO#6SOLW#3ULQFLSOHV
$OO#5DGLR#5HODWHG#PDWWHUV#LQ#5DGLR#1HWZRUN#DQG#DOO#6HUYLFH
5HODWHG#PDWWHUV#LQ#&1
0RVW#)XQFWLRQV#LQ#,X#LQFOXGH#ERWK#DVSHFWV
6SOLW#UHVSRQVLELOLW\
875$1#SURYLGHV#6HUYLFHV#WR#WKH#&1
8VXDO#FDVH=#&1#%FRQWUROV%#DQG#875$1#%SURYLGHV%
49########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
,X#&6#3URWRFRO#6WUXFWXUH
5DGLR
1HWZRUN
/D\HU
&RQWURO#3ODQH
8VHU#3ODQH
5$1$3
,X#8VHU#3ODQH
3URWRFRO
7UDQVSRUW
1HWZRUN
/D\HU
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
7UDQVSRUW#1HWZRUN
&RQWURO#3ODQH
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
41596314
6&&3
0736E
66&)011,
66&23
$$/8
41548314
0736E
66&)011,
66&23
$$/8
$70
3K\VLFDO#/D\HU
4:########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
$$/5
,X#36#3URWRFRO#6WUXFWXUH
8VHU#3ODQH
5DGLR
&RQWURO#3ODQH
1HWZRUN
/D\HU
5$1$3
7UDQVSRUW
1HWZRUN
/D\HU
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
,X#8VHU#3ODQH
3URWRFRO
7UDQVSRUW#1HWZRUN
&RQWURO#3ODQH
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
6&&3
07360% 068$
66&)011, 6&73
66&23
,3
*7308
1RWKLQJ#$
8'3
,3
$$/8
$$/8
$70
$70
3K\VLFDO#/D\HU
3K\VLFDO#/D\HU
4;########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
5$1$3#)XQFWLRQV#425
5DGLR#$FFHVV#%HDUHU#+8(#0#&1#EHDUHU,#KDQGOLQJ#+FRPELQHG#SURFHGXUH,>
5$%#6HW0XS#+,QFOXGLQJ#4XHXLQJ,
5$%#0RGLILFDWLRQ
&OHDULQJ#5$%#+,QFOXGLQJ#5$1#LQLWLDWHG#FDVH,
,X#5HOHDVH>#5HOHDVHV#DOO#,X#UHVRXUFHV#+6LJQDOLQJ#OLQN#DQG#803ODQH,#UHODWHG#WR#WKH
VSHFLILHG#8(1#$OVR#LQFOXGHV#5$1#LQLWLDWHG#FDVH1
5HORFDWLRQ>#+DQGOLQJ#ERWK#6516#5HORFDWLRQ#+8(#DOUHDG\#LQ#WDUJHW#51&#ZLWK
,XU,#DQG#+DUG#+DQGRYHU#+VLPXOWDQHRXV#VZLWFK#RI#5DGLR#DQG#,X,1#,QFOXGHV#/RVV0
OHVV#UHORFDWLRQ#DQG#,QWHU#V\VWHP##+DQGRYHU
3DJLQJ=#&1#WR#SDJH#DQ#LGOH#8(#IRU#D#WHUPLQDWLQJ#FDOO2FRQQHFWLRQ
&RPPRQ#,'=#8(#1$6#,G#VHQW#WR#51&#IRU#SDJLQJ#FR0RUGLQDWLRQ
7UDFH#,QYRFDWLRQ=#&1#PD\#UHTXHVW#875$1#WR#VWDUW2VWRS#WUDFLQJ#D#VSHFLILF#8(
6HFXULW\#0RGH#&RQWURO>#&RQWUROV#&LSKHULQJ#DQG#,QWHJULW\#&KHFNLQJ1
4<########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
5$1$3#)XQFWLRQV#525
/RFDWLRQ#5HSRUWLQJ>#5HTXHVWLQJ#+&1,#DQG#UHSRUWLQJ#+51&,#8(#ORFDWLRQ
'DWD#9ROXPH#5HSRUWLQJ>##5HTXHVWLQJ#+&1,#DQG#UHSRUWLQJ#+51&,#8QVXFFHVVIXOO\
WUDQVPLWWHG#'/#GDWD
,QLWLDO#8(#0HVVDJH=#&DUULHV#WKH#ILUVW#1$6#PHVVDJH#WR#WKH#&1#DQG#VHWV#XS#WKH#,X
VLJQDOOLQJ#FRQQHFWLRQ1
'LUHFW#7UDQVIHU=#&DUULHV#1$6#VLJQDOOLQJ#LQIRUPDWLRQ#RYHU#,X1#&RQWHQW#QRW#875$1
LQWHUSUHWHG#E\#875$1
&1#,QIRUPDWLRQ#%URDGFDVW>#7KLV#SURFHGXUH#DOORZV#WKH#&1#WR#VHW#&1#+1$6,#UHODWHG
V\VWHP#LQIRUPDWLRQ#WR#EH#EURDGFDVW#WR#DOO#XVHUV1#:,//#%(#'(/(7('#IURP#5<<$
2YHUORDG>#8VHG#IRU#IORZ#FRQWURO#+WR#UHGXFH#IORZ,#RYHU#WKH#,X#LQWHUIDFH#H1J1#GXH
WR#SURFHVVRU#RYHUORDG#DW#&1#RU#875$1
5HVHW>#,W#LV#XVHG#WR#UHVHW#WKH#&1#RU#WKH#875$1#VLGH#RI#,X#LQWHUIDFH#LQ#HUURU
VLWXDWLRQV1#,QFOXGHV#DOVR#UHVHWWLQJ#6LJQDOOLQJ#&RQQHFWLRQ
(UURU#,QGLFDWLRQ>#8VHG#IRU#SURWRFRO#HUURUV#ZKHUH#QR#RWKHU#HUURU#DSSOLHV
53########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
,X#,QWHUIDFH#)XQFWLRQDO#([DPSOH
54########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
&RQQHFWLRQV#LQ#6HUYLQJ#51HORFDWLRQ
06&29/5
06&
06&
9/ 5
6RXUFH
6HUYLQJ
9/ 5
7DUJHW
'ULIW
51&
&
06&29/5
51&
&
9/ 5
%76
9/ 5
%76
6HUYLQJ#51HORFDWLRQ#WULJJHUHG
55########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
6HUYLQJ
51&
&
51&
&
9/ 5
%76
9/ 5
%76
5HVXOWLQJ#&RQQHFWLRQ
5HORFDWLRQ/#8(#1RW#,QYROYHG
8(
6RXUFH#51&
&1#1RGH
7DUJHW#51&
5HORFDWLRQ#'HFLVLRQ
41#5HORFDWLRQ#5HTXLUHG
81#6WDUW#'DWD
)RUZDUGLQJ
71#5HORFDWLRQ#&RPPDQG
51#5HORFDWLRQ#5HTXHVW
61#5HORFDWLRQ#5HTXHVW#$FNQRZOHGJH
81#516$3#5HORFDWLRQ#&RPPLW
91#5HORFDWLRQ#'HWHFW
91#55URFHGXUHV#+517,#5H0DOORFDWLRQ#FRPSOHWH,
:1#5HORFDWLRQ#&RPSOHWH
;1#,X#5HOHDVH#&RPPDQG
<1#,X#5HOHDVH#&RPSOHWH
56########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
5HORFDWLRQ/#8(#,QYROYHG
8(
6RXUFH#51&
&1#1RGH
7DUJHW#51&
5HORFDWLRQ#'HFLVLRQ
41#5HORFDWLRQ#5HTXLUHG
51#5HORFDWLRQ#5HTXHVW
81#6WDUW#'DWD
)RUZDUGLQJ
71#5HORFDWLRQ#&RPPDQG
81#55&=#%+DQGRYHU#&RPPDQG%
81#)RUZDUG#6516#&RQWH[W
61#5HORFDWLRQ#5HTXHVW#$FNQRZOHGJH
91#)RUZDUG#6516#&RQWH[W
:1#%+DQGRYHU#$FFHVV%
;1#5HORFDWLRQ#'HWHFW
;1#55&#SURFHGXUHV
<1#5HORFDWLRQ#&RPSOHWH
431#,X#5HOHDVH#&RPPDQG
441#,X#5HOHDVH#&RPSOHWH
57########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
,X#%URWRFRO#6WUXFWXUH
5DGLR
1HWZRUN
/D\HU
7UDQVSRUW
1HWZRUN
/D\HU
6HUYLFH#$UHD
%URDGFDVW#3ODQH
6$%3
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
7&3
,3
$$/8
$70
3K\VLFDO#/D\HU
58########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
6$%3#)XQFWLRQV
0HVVDJH#+DQGOLQJ1#7KLV#IXQFWLRQ#LV#UHVSRQVLEOH#IRU#WKH#EURDGFDVW
RI#QHZ#PHVVDJHV/#UHSODFLQJ#H[LVWLQJ#EURDGFDVWHG#PHVVDJHV#DQG#WR
VWRS#WKH#EURDGFDVWLQJ#RI#VSHFLILF#PHVVDJHV1#$OVR#PHVVDJH#VWDWXV
LQTXLU\#LV#LQFOXGHG1
/RDG# +DQGOLQJ1# 7KLV# IXQFWLRQ# LV# UHVSRQVLEOH# IRU# GHWHUPLQLQJ# WKH
ORDGLQJ#RI#WKH#EURDGFDVW#FKDQQHOV#DW#DQ\#SDUWLFXODU#SRLQW#LQ#WLPH1
5HVHW1#7KLV#IXQFWLRQ#SHUPLWV#WKH#&%&#WR#HQG#EURDGFDVWLQJ#LQ#RQH
RU#PRUH#6HUYLFH#$UHDV1#$OVR#5HVWDUW#LQGLFDWLRQ#LV#LQFOXGHG1
(UURU#DQG#)DLOXUH#+DQGOLQJ1#7KLV#IXQFWLRQ#DOORZV#WKH#UHSRUWLQJ#RI
JHQHUDO#DQG#IXQFWLRQ#VSHFLILF#HUURU#VLWXDWLRQV1
59########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
,X#)UDPH#+DQGOLQJ#3URWRFRO
5:########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
0RGHV#RI#2SHUDWLRQ
7UDQVSDUHQW#0RGH
)RU#5$%V#UHTXLULQJ#QR#VSHFLDO#KDQGOLQJ#IURP#,X
2QO\#WUDQVSRUW#RI#WKH#XVHU#GDWD#ZLWKRXW#IUDPLQJ
8VDJH#([DPSOH=#*73#3'8V#+36#GRPDLQ,
6XSSRUW#0RGH#IRU#SUHGHILQHG#6'8#VL]H
3URYLGHV#VSHFLDO#VHUYLFHV#IRU#KDQGOLQJ#5$%V
8VHV#IUDPLQJ#RI#XVHU#GDWD
6#3'8#7\SHV=
FRQWURO#GDWD#+3'8#7\SH#47,
XVHU#GDWD#ZLWK#HUURU#GHWHFWLRQ#VFKHPH#+3'8#7\SH#3,/
XVHU#GDWD#ZLWKRXW#HUURU#GHWHFWLRQ#VFKHPH#+3'8#7\SH#4,
8VDJH#([DPSOH=#$05#VSHHFK#3'8V#+&6#GRPDLQ,
5;########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
6XSSRUW#0RGH#&RQWURO#)XQFWLRQV
,QLWLDOLVDWLRQ
7UDQVIHU#RI#8VHU#'DWD
7UDQVIHU#RI#8VHU#'DWD#3'8#PD\#LQFOXGH#)UDPH#4XDOLW\
&ODVVLILFDWLRQ
5DWH#&RQWURO
7LPH#$OLJQPHQW
+DQGOLQJ#RI#(UURU#(YHQW
5<########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
,XU#,QWHUIDFH
63########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
)XQFWLRQDO#0RGXOHV#+426,
6XSSRUW#EDVLF#LQWHU#51&#PRELOLW\
$OORZV#LQWHU#51U$#XSGDWH#DQG
SDJLQJ#LQ#PXOWLSOH#51&V#+8VHU#LQ
55U$B3&+#+RU#&(//B3&+,
VWDWH,1
$OORZV#WKH#,QWHU#51&#FHOO#XSGDWH
.#651&#UHORFDWLRQ#+8VHU#LQ#55&
&(//B)$&+#VWDWH,1
&1
&1
651HORFDWLRQ
6051&
##51&
7DUJHW#
51&
6051&
85$
%6
%6
SDJLQJ
SDJLQJ
06
%6
85$#8SGDWH
%6
%6
06
&HOO#8SGDWH
2QO\#VLJQDOOLQJ/#QR#XVHU#GDWD
1RWH=#,XU#LQWHUIDFH#GRHV#QRW#QHHG#WR#EH#LQYROYHG#LQ#,QWHU#51&#KDUG
KDQGRYHU
64########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
)XQFWLRQDO#0RGXOHV#+526,
6XSSRUW#GHGLFDWHG#FKDQQHO#WUDIILF#EHWZHHQ#WZR#51&V
$OORZV#LQWHU#51&#VRIW#KDQGRYHU
$OORZV#DQFKRULQJ#651&#ZKHQ#WKH
8VHU#LV#LQ#GHGLFDWHG#FKDQQHO#VWDWH
&1
6051&#
.#0'&
&1
'051&
%6
'051&
.#0'&
6051&
%6
%6
06
6XSSRUW#XVHU#GDWD#WUDQVIHU#ZLWK#GHGLFDWHG#FRQQHFWLRQ
6XSSRUW#RI#GRZQOLQN#VKDUHG#WUDQVSRUW#FKDQQHO#+'6&+,
65########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
%6
06
)XQFWLRQDO#0RGXOHV#+626,
6XSSRUW#FRPPRQ#FKDQQHO#WUDIILF#EHWZHHQ#WZR#51&V
$OORZV#DQFKRULQJ#RI#651&#DOVR#ZKHQ
8(#LV#LQ#FRPPRQ#FKDQQHO
+5$&+2)$&+,#VWDWH
6XSSRUW#XVHU#GDWD#WUDQVIHU#ZLWK
FRPPRQ#WUDQVSRUW#FRQQHFWLRQ
%HQHILWV#XQFOHDU#IRU#EHVW#HIIRUW#WUDIILF
+UHGXFHG#VLJQDOOLQJ#ORDG#LQ#&1/#EXW
LQFUHDVHG#FRPSOH[LW\#LQ#875$1#DQG
OHVV#HIILFLHQW#XVH#RI#UDGLR#UHVRXUFH,1
&1
6051&#
'051&
%6
06
$OVR#IRXUWK#PRGXOH#*OREDO/#ZLWK#(UURU#,QGLFDWLRQ#IXQFWLRQDOLW\
H[LVWV
66########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
,XU#SURWRFRO#VWUXFWXUH
5DGLR
1HWZRUN
/D\HU
&RQWURO#3ODQH
8VHU#3ODQH
'&+
)3
516$3
7UDQVSRUW
1HWZRUN
/D\HU
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
7UDQVSRUW#1HWZRUN
&RQWURO#3ODQH
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
41596314
41548314
6&&3
07360%
068$
07360%
068$
66&)011,
6&73
66&)011,
6&73
66&23
,3
66&23
,3
$$/8
$$/8
$70
3K\VLFDO#/D\HU
67########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
&&+
)3
$$/5
516$3#)XQFWLRQV#425
5DGLR#/LQN#0DQDJHPHQW1#7KLV#IXQFWLRQ#DOORZV#WKH#651&#WR#PDQDJH#UDGLR#OLQNV
XVLQJ#GHGLFDWHG#UHVRXUFHV#LQ#D#'5161
3K\VLFDO#&KDQQHO#5HFRQILJXUDWLRQ1#7KLV#IXQFWLRQ#DOORZV#WKH#'51&#WR#UHDOORFDWH
WKH#SK\VLFDO#FKDQQHO#UHVRXUFHV#IRU#D#5DGLR#/LQN1
5DGLR#/LQN#6XSHUYLVLRQ1#7KLV#IXQFWLRQ#DOORZV#WKH#'51&#WR#UHSRUW#IDLOXUHV#DQG
UHVWRUDWLRQV#RI#D#5DGLR#/LQN1
&RPSUHVVHG#0RGH#&RQWURO#>)''@1#7KLV#IXQFWLRQ#DOORZV#WKH#651&#WR#FRQWURO#WKH
XVDJH#RI#FRPSUHVVHG#PRGH#ZLWKLQ#D#'516
0HDVXUHPHQWV#RQ#'HGLFDWHG#5HVRXUFHV1#7KLV#IXQFWLRQ#DOORZV#WKH#651&#WR
LQLWLDWH#PHDVXUHPHQWV#RQ#GHGLFDWHG#UHVRXUFHV#LQ#WKH#'5161#7KH#IXQFWLRQ#DOVR
DOORZV#WKH#'51&#WR#UHSRUW#WKH#UHVXOW#RI#WKH#PHDVXUHPHQWV1
'/#3RZHU#'ULIWLQJ#&RUUHFWLRQ#>)''@1#7KLV#IXQFWLRQ#DOORZV#WKH#651&#WR#DGMXVW
WKH#'/#SRZHU#OHYHO#RI#RQH#RU#PRUH#5DGLR#/LQNV#LQ#RUGHU#WR#DYRLG#'/#SRZHU
GULIWLQJ#EHWZHHQ#WKH#5DGLR#/LQNV1
68########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
516$3#)XQFWLRQV#525
&&&+#6LJQDOOLQJ#7UDQVIHU1#7KLV#IXQFWLRQ#DOORZV#WKH#651&#DQG#'51&#WR#SDVV
LQIRUPDWLRQ#EHWZHHQ#WKH#8(#DQG#WKH#651&#RQ#D#&&&+#FRQWUROOHG#E\#WKH#'5161
3DJLQJ1#7KLV#IXQFWLRQ#DOORZV#WKH#651&#WR#SDJH#D#8(#LQ#D#85$#RU#D#FHOO#LQ#WKH
'5161
&RPPRQ#7UDQVSRUW#&KDQQHO#5HVRXUFHV#0DQDJHPHQW1#7KLV#IXQFWLRQ#DOORZV#WKH
651&#WR#XWLOLVH#&RPPRQ#7UDQVSRUW#&KDQQHO#5HVRXUFHV#ZLWKLQ#WKH#'516
+H[FOXGLQJ#'6&+#UHVRXUFHV#IRU#)'',1
5HORFDWLRQ#([HFXWLRQ1#7KLV#IXQFWLRQ#DOORZV#WKH#651&#WR#ILQDOLVH#D#5HORFDWLRQ
SUHYLRXVO\#SUHSDUHG#YLD#RWKHU#LQWHUIDFHV1
5HSRUWLQJ#JHQHUDO#HUURU#VLWXDWLRQV1#7KLV#IXQFWLRQ#DOORZV#UHSRUWLQJ#RI#JHQHUDO
HUURU#VLWXDWLRQV/#IRU#ZKLFK#IXQFWLRQ#VSHFLILF#HUURU#PHVVDJHV#KDYH#QRW#EHHQ
GHILQHG1
69########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
,XE#,QWHUIDFH
6:########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
/RJLFDO#0RGHO#RI#1RGH#%#LQ#)''
111 111
&RQWUROOLQJ#51&
1RGH#%
&RQWURO
3RUW
,XE
5$&+
'DWD
SRUW
,XE
3&+
'DWD
SRUW
,XE
)$&+
'DWD
SRUW
,XE
'6&+
'DWD
SRUW
,XE
7''#86&+
'DWD
SRUW
,XE
'&+
'DWD
SRUW
,XE
'6&+
'DWD
SRUW
&RPPXQLFDWLRQ
&RQWURO
3RUW
,XE
7''#86&+
'DWD
SRUW
7UDIILF#WHUPLQDWLRQ#SRLQW
&RPPRQ#7UDQVSRUW#&KDQQHOV/
1RGH#%
&HOO
ZLWK#DWWULEXWHV
111
6;########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
&HOO
&HOO
&RPPXQLFDWLRQ
&RQWURO
3RUW
7UDIILF#WHUPLQDWLRQ#SRLQW
1RGH#%#&RPPXQLFDWLRQ#&RQWH[WV/
ZLWK#DWWULEXWHV
&HOO
,XE
'&+
'DWD
SRUW
&HOO
&HOO
,XE#3URWRFRO#6WUXFWXUH
8VHU#3ODQH
&RQWURO#3ODQH
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
41596314
41548315
66&)081,
66&)081,
66&23
66&23
$$/8
$$/8
$70
3K\VLFDO#/D\HU
6<########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
86&+#)3
7UDQVSRUW#1HWZRUN
&RQWURO#3ODQH
'6&+#)3
7UDQVSRUW 1HWZRUN
8VHU 3ODQH
3&+#)3
7UDQVSRUW
1HWZRUN
/D\HU
)$&+#)3
1%$3
5$&+#)3
'&+#)3
5DGLR
1HWZRUN
/D\HU
$$/5
1%$3#)XQFWLRQV#425
&HOO#&RQILJXUDWLRQ#0DQDJHPHQW1#7KLV#IXQFWLRQ#JLYHV#WKH#&51&#WKH#SRVVLELOLW\
WR#PDQDJH#WKH#FHOO#FRQILJXUDWLRQ#LQIRUPDWLRQ#LQ#D#1RGH#%1
&RPPRQ# 7UDQVSRUW# &KDQQHO# 0DQDJHPHQW1# 7KLV# IXQFWLRQ# JLYHV# WKH# &51&# WKH
SRVVLELOLW\#WR#PDQDJH#WKH#FRQILJXUDWLRQ#RI#&RPPRQ#7UDQVSRUW#&KDQQHOV##LQ#D
1RGH#%1
6\VWHP#,QIRUPDWLRQ#0DQDJHPHQW1#7KLV#IXQFWLRQ#JLYHV#WKH#&51&#WKH#DELOLW\#WR
PDQDJH#WKH#VFKHGXOLQJ#RI#6\VWHP#,QIRUPDWLRQ#WR#EH#EURDGFDVW#LQ#D#FHOO1
5HVRXUFH# (YHQW# 0DQDJHPHQW1# 7KLV# IXQFWLRQ# JLYHV# WKH# 1RGH# %# WKH# DELOLW\# WR
LQIRUP#WKH#&51&#DERXW#WKH#VWDWXV#RI#1RGH#%#UHVRXUFHV1
&RQILJXUDWLRQ# $OLJQPHQW1# 7KLV# IXQFWLRQ# JLYHV# WKH# &51&# DQG# WKH# 1RGH# %# WKH
SRVVLELOLW\# WR# YHULI\# WKDW# ERWK# QRGHV# KDV# WKH# VDPH# LQIRUPDWLRQ# RQ# WKH
FRQILJXUDWLRQ#RI#WKH#UDGLR#UHVRXUFHV1
0HDVXUHPHQWV# RQ# &RPPRQ# 5HVRXUFHV1# 7KLV# IXQFWLRQ# DOORZV# WKH# &51&# WR
LQLWLDWH#PHDVXUHPHQWV#LQ#WKH#1RGH#%1#7KH#IXQFWLRQ#DOVR#DOORZV#WKH#1RGH#%#WR
UHSRUW#WKH#UHVXOW#RI#WKH#PHDVXUHPHQWV1
73########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
1%$3#)XQFWLRQV#525
6\QFKURQLVDWLRQ#0DQDJHPHQW1+7'',#7KLV#IXQFWLRQ#DOORZV#WKH#&51&#WR#PDQDJH
WKH#V\QFKURQLVDWLRQ#RI#D#7''#FHOO#LQ#D#1RGH#%1
5DGLR#/LQN#0DQDJHPHQW1#7KLV#IXQFWLRQ#DOORZV#WKH#&51&#WR#PDQDJH#UDGLR#OLQNV
XVLQJ#GHGLFDWHG#UHVRXUFHV#LQ#D#1RGH%1
5DGLR# /LQN# 6XSHUYLVLRQ1# 7KLV# IXQFWLRQ# DOORZV# WKH# &51&# WR# UHSRUW# IDLOXUHV# DQG
UHVWRUDWLRQV#RI#D#5DGLR#/LQN1
0HDVXUHPHQWV# RQ# 'HGLFDWHG# 5HVRXUFHV1# 7KLV# IXQFWLRQ# DOORZV# WKH# &51&# WR
LQLWLDWH# PHDVXUHPHQWV# LQ# WKH# 1RGH%1# 7KH# IXQFWLRQ# DOVR# DOORZV# WKH# 1RGH%# WR
UHSRUW#WKH#UHVXOW#RI#WKH#PHDVXUHPHQWV1
'/# 3RZHU# 'ULIWLQJ# &RUUHFWLRQ# +)'',1# 7KLV# IXQFWLRQ# DOORZV# WKH# &51&# WR# DGMXVW
WKH# '/# SRZHU# OHYHO# RI# RQH# RU# PRUH# 5DGLR# /LQNV# LQ# RUGHU# WR# DYRLG# '/# SRZHU
GULIWLQJ#EHWZHHQ#WKH#5DGLR#/LQNV1
5HSRUWLQJ# JHQHUDO# HUURU# VLWXDWLRQV1# 7KLV# IXQFWLRQ# DOORZV# UHSRUWLQJ# RI# JHQHUDO
HUURU# VLWXDWLRQV/# IRU# ZKLFK# IXQFWLRQ# VSHFLILF# HUURU# PHVVDJHV# KDYH# QRW# EHHQ
GHILQHG1
74########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
,XU#DQG#,XE#)UDPH#+DQGOLQJ#3URWRFROV
75########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
,XU#)#,XE#)UDPH#3URWRFROV
'HGLFDWHG#&KDQQHO#)UDPH#3URWRFRO
2QH#FRPPRQ#SURWRFRO#IRU#,XU#DQG#,XE#,QWHUIDFHV
&RPPRQ#&DQQHO#)UDPH#3URWRFROV
6HSDUDWH#SURWRFROV#IRU#,XU#DQG#,XE#,QWHUIDFHV
$OO#RI#WKHP#LQFOXGH
&RQWURO#)XQFWLRQV#+0RVWO\#VLPLODU#DV#LQ#,X#)UDPH#3URWRFRO,
'DWD#)UDPH#7UDQVIHU
76########12.,$##########875$1#$UFKLWHFWXUH13372#39144133#2#$WWH#/lQVLVDOPL
26.01.2002
Introduction
This lecture presents a general WCDMA or UTRA (Universal
Terrestrial Radio Access) FDD (Frequency Division Duplex)
physical layer issues.
26.01.2002
Mapping
to
26.01.2002
Carrier Spacing
5 MHz (nominal)
Chip Rate
3.84 Mcps
Frame Length
10 ms (38400 chips)
No. of slots/frame
15
No. of chips/slot
Uplink SF
4 to 256
Downlink SF
4 to 512
Channel Rate
26.01.2002
Spreading Operation
Spreading means increasing the signal bandwidth
Strickly speaking, spreading includes two operations:
Scrambling (does not affect the signal bandwidth) - using pseudonoise codes
channelization codes (SF) scrambling codes
Data
bit rate
5
26.01.2002
chip rate
chip rate
WCDMA Phys ical Layer
Channelisation (1/3)
Channelisation codes are orthogonal codes, based on Orthogonal
Variable Spreading Factor (OVSF) technique
The codes are fully orthogonal, i.e., they do not interfere with each
other, only if the codes are time synchronized
Thus, channelisation codes can separate the transmissions from a
single source
In the downlink, it can separate different users within one cell/sector
Limited orthogonal codes must be reused in every cell
Problem: Interference if two cells use the same code
Solution: Scrambling codes to reduce inter-base-station interference
26.01.2002
Channelisation (2/3)
In the uplink, it can only separate the physical channels/services of one
user because the mobiles are not synchronised in time.
It is possible that two mobiles are using the same codes.
In order to separate different users in the uplink, scrambling codes are
used.
The channelisation codes are picked from the code tree as shown in
next slide.
One code tree is used with one scrambling code on top of the tree.
If c4,4 is used, no codes from its subtree can be used (c8,7 , c8,8 , ).
26.01.2002
Channelisation (3/3)
Code tree
c4,1=(1,1,1,1)
c8,2
c2,1=(1,1)
c1,1=(1)
(c)
(c,c)
c2,2=(1,-1)
(c,-c)
26.01.2002
c4,2=(1,1,-1,-1)
c8,3
c4,3=(1,-1,1,-1)
c8,4
c8,5
c4,4=(1,-1,-1,1)
c8,6
c8,7
...
c8,8
S F =1
c8,1
S F =2
S F =4
S F =8
...
Scrambling
In the scrambling process the code sequence is multiplied with a
pseudorandom scrambling code.
The scrambling code can be a long code (a Gold code with 10 ms
period) or a short code (S(2) code).
In the downlink scrambling codes are used to reduce the inter-basestation interference. Typically, each Node B has only one scrambling
code for UEs to separate base stations. Since a code tree under one
scrambling code is used by all users in its cell, proper code
management is needed.
In the uplink scrambling codes are used to separate the terminals.
26.01.2002
Summary
Usage
10
Channelisation code
Scrambling code
Length
No. of
codes
Code
family
Spreading
26.01.2002
Transport Channels
11
26.01.2002
Channel Concepts
Three separate channels concepts in the UTRA: logical, transport, and
physical channels.
Logical channels define what type of data is transferred.
Transport channels define how and with which type of characteristics the
data is transferred by the physical layer.
Physical data define the exact physical characteristics of the radio channel.
RLC layer
L2
Logical Channel
MAC layer
Transport Channel
PHY layer
L1
Physical Channel
12
26.01.2002
13
26.01.2002
14
26.01.2002
Physical Channel
15
26.01.2002
DTX Period
Data (DPDCH)
channelization code, cD
scrambling code
Data
(DPDCH)
Control
(DPDCH)
I+jQ
*j
BPSK for each channel
channelization code, cC
16
26.01.2002
Data
DPCCH
Uplink DPCH
PILOT
0
TFCI
FBI
TPC
14
10 ms
17
26.01.2002
18
26.01.2002
256
DPDCH channel
bit rate (kbps)
15
128
30
15 kbps
64
60
30 kbps
32
120
60 kbps
16
240
120 kbps
480
240 kbps
960
480 kbps
5740
2.3 Mbps
WCDMA Phys ical Layer
TrCH 2
CRC attachment
TrBlk concatenation/
code block
segmenation
PhyCH mapping
Channel coding
Radio frame
equalization
1st interleaving
Radio frame
segmentation
...
Other TrCHs
2nd (intra-frame)
interleaving
PhyCH segmentation
CCTrCh
TrCH multiplexing
Rate matching
19
26.01.2002
Slot
Downlink
DPCH
DPCCH
DPDCH
2560 chips
DPCCH
TPC
DATA
TFCI
DPDCH
DPCCH
DATA
PILOT
14
10 ms
20
26.01.2002
21
A full rate
TFCI
A half rate
26.01.2002
TrCh A
TPC
TrCh B
PILOT
TPC
TrCh B
PILOT
22
Spreading factor
Channel
symbol rate
(kbps)
Channel
bit rate
(kbps)
DPDCH channel
bit rate range
(kbps)
512
7.5
15
3-6
1-3 kbps
256
15
30
12-24
6-12 kbps
128
30
60
42-51
20-24 kbps
64
60
120
90
45 kbps
32
120
240
210
105 kbps
16
240
480
432
215 kbps
480
960
912
456 kbps
960
1920
1872
936 kbps
4, with 3 parallel
codes
2880
5760
5616
2.3 Mbps
26.01.2002
TrCH 2
CRC attachment
TrBlk concatenation/
code block
segmenation
PhyCH mapping
Channel coding
Rate matching
1st insertion of DTX
indication
...
Other TrCHs
2nd (intra-frame)
interleaving
PhyCH segmentation
CCT rCh
1st interleaving
Radio frame
segmentation
23
26.01.2002
26.01.2002
25
26.01.2002
RACH Operation
First, UE sends a preamble.
26.01.2002
AICH Preamble
RACH Message
WCDMA Phys ical Layer
27
26.01.2002
CPCH Operation
After receiving CPCH AICH,
UE sends a CPCH CD preamble with the same power from another
signature.
If no collision after a certain time, the BS echo this signature back to the
UE on the CD Indication Channel (CD-ICH).
Then, the UE sends data over several frames with fast power control.
The CPCH status indicator channel (CSICH) carries the status of different
CPCH information.
BS
UE
CPCH Preamble
CPCH CD
28
26.01.2002
AICH Preamble
CPCH Message
CPCH CD-ICH
WCDMA Phys ical Layer
29
26.01.2002
In-band signaling is needed to inform for which user the data was
intended.
30
26.01.2002
31
26.01.2002
32
26.01.2002
33
26.01.2002
P-SCH
14
S-SCH
14
2560 chips
10 ms
34
26.01.2002
26.01.2002
SSC Sequences
Secondary Synchronisation Code (SSC) and Code Group
Code
group
#0
#1
#2
#3
#4
#5
#6
#7
#8
#9
30
11
11
16
16
14
14
31
13
12
16
16
13
12
32
16
13
12
13
12
16
:
:
:
:
16 6 9 16 13 12 2 6 2 13 3 3 12 9 7 16 6 9 16 13 12
Start Frame
36
26.01.2002
37
26.01.2002
38
26.01.2002
39
26.01.2002
DL
SIRtarget adjustment
UL
commands
RNC
Outer Loop Power Control
if quality<target,
increase SIRtarget
40
26.01.2002
BS
Fast Power Control
if SIRestimate<SIRtarget,
send "power up" command
41
26.01.2002
Set the SIR target in order to maintain a certain frame error rate
(FER). Operated at radio network controller (RNC).
Open loop PC
No feedback information.
Make a rough estimate of the path loss by means of a downlink
beacon signal.
42
26.01.2002
26.01.2002
44
26.01.2002
Measurement
gap
Normal
Frame
45
26.01.2002
Compressed
Mode
Normal
Frame
46
26.01.2002
Handover
Intra-mode handover
47
26.01.2002
MT
UTRAN
CN Iu EDGE
CN gateway
End-toend Service
Local Bearer
Service
External Bearer
Service
Radio Interface
protocols
CN
Bearer Service
Radio
Bearer Service
Iu
Bearer Service
Backbone
Bearer Service
UTRA
Service
Physical
Bearer Service
Backbone Phys.
Bearer Service
UE
BS
RNC
Logical Channels
Transport Channels
Physical Channels
Paging in order to find out the actual location of the user. Th network request
is carried out in the logical channel Paging Control Channel (PCH).
Task common for all UE residing in the cell. Common Control Channel
(CCCH). Since many users may use CCH simultaneously they are identified
by U-RNTI ( UTRAN Radio Network Temporary Identity).
The control information of dedicated and active connection is send in
Dedicated Control Channel (DCCH).
The dedicated user traffic in DL is sent through Dedicated Traffic Channel
(DTCH).
In DL the information to all UE or a specific group of UE in the cell can be
transmitted on Common Traffic Channel (CTCH)
Nt
DC
Duplication avoidance
GC
Nt
DC
UuS boundary
U-plane information
C-plane signalling
L3
control
Radio
Bearers
control
control
control
control
RRC
PDCP
PDCP
L2/PDCP
RLC
RLC
BMC
L2/BMC
RLC
L2/RLC
RLC
RLC
RLC
RLC
RLC
Logical
Channels
MAC
L2/MAC
Transport
Channels
PHY
L1
Transport Channels
Service provided by L1 to L2
(MAC). Defined how data is
transported.
Common transport channels
(where there is a need for inband
identification of the UEs when
particular UEs are addressed);
Dedicated transport channels
(where the UEs are identified by
the physical channel, i.e. code and
frequency for FDD and code, time
slot and frequency for TDD).
Dedicated transport channel types are:
Logical Channels
RLC
Logical Channels
MAC
Traffic Channels:
Dedicated Traffic Channels (DTCH) (UL&DL)
Common Traffic Channels (CTCH) (DL)
CCCH
RACH
CPCH
DCH
Transport
Channels
Physical
Channels
PRACH
PCCH
BCCH
CCCH
CTCH
Transport
Channels
PCH
BCH
FACH
DSCH
DCH
Physical
Channels
S-CCPCH
P-CCPCH
PDSCH
DPDCH
DPCCH
Radio Bearers
Service provided by
RLC/PDCP/BMC to higher layers.
Defined by:
RLC/PDCP/BMC parameters.
Transport channel parameters.
Physical channel parameters??
Mapping between Radio
bearer(s) logical channels and
transport channels.
RRC
Signalling
Radio Bearers
PDCP
BMC
RLC
RRC
user-plane
L3
L2
L1
PCCH
BCCH
CCCH
CTCH
DCCH
DTCH DTCH
Logical
Channels
MACControl
MAC-d
MAC-b
MAC-c/sh
Transport
Channels
BCH
PCH
FACH
RACH
CPCH
DSCH
DCH
DCH
MAC SDU
UTRAN Radio Network Temporary Identity (U-RNTI) may be used in the MAC header
of DCCH when mapped onto common transport channels in downlink direction; the URNTI is never used in uplink direction;
Cell Radio Network Temporary Identity (C-RNTI) is used on DTCH and DCCH in
uplink, and may be used on DCCH in downlink and is used on DTCH in downlink when
mapped onto common transport channels;
the UE id to be used by MAC is configured through the MAC control SAP.
UE-Id Type field: is needed to ensure correct decoding of the UE-Id field in MAC
Headers
MAC c/sh
TCTF MUX: this function represents the handling (insertion for uplink
PCCH
channels and detection and deletion for downlink channels) of the TCTF
field in the MAC header, and the respective mapping between logical and
transport channels.The TCTF field indicates the common logical channel
type, or if a dedicated logical channel is used;
CTCH
BCCH
MAC Control
MAC-c/sh
to MAC d
add/read
UE Id
TCTF MUX
Scheduling/Priority
Handling (1)
add/read UE Id:
the UE Id is added for CPCH and RACH transmissions
the UE Id, when present, identifies data to this UE.
UL: TF selection: in the uplink, the possibility of transport format
selection exists. In case of CPCH transmission, a TF is selected based on
TF availability determined from status information on the CSICH;
ASC selection: For RACH, MAC indicates the ASC associated with the
PDU to the physical layer. For CPCH, MAC may indicate the ASC
associated with the PDU to the Physical Layer. This is to ensure that
RACH and CPCH messages associated with a given Access Service Class
(ASC) are sent on the appropriate signature(s) and time slot(s). MAC also
applies the appropriate back-off parameter(s) associated with the given
ASC. When sending an RRC CONNECTION REQUEST message, RRC
will determine the ASC; in all other cases MAC selects the ASC;
scheduling /priority handling: this functionality is used to transmit
the information received from MAC-d on RACH and CPCH based on
logical channel priorities. This function is related to TF selection.
TFC selection: transport format and transport format combination
selection according to the transport format combination set (or transport
format combination subset) configured by RRC is performed,
UL: TF selection
TFC
selection
ASC
selection
PCH
DSCH DSCH
USCH USCH
FACH
FACH
RACH
ASC
selection (2)
TDD only
TDD only
PCCH
BCCH
SHCCH
CCCH
MAC Control
CTCH
(TDD only)
MAC-c/sh
Flow Control
MAC-c/sh / MAC-d
TFC selection
TFC selection
PCH
FACH
FACH
DL: code
allocation
DSCH
DSCH
USCH
USCH
TDD only
TDD only
RACH
CPCH
(FDD only )
to MAC d
MAC-d
DCCH DTCH DTCH
MAC Control
MAC-d
Transport Channel Type Switching
Deciphering
C/T MUX
C/T
MUX
to MAC-c/sh
Ciphering
DCH
DCH
MAC-Control
UE
to MAC-c/sh
Flow Control
MACc/sh /
MAC-d
Deciphering
C/T
MUX
MAC-d
DL scheduling/
priority handling
Ciphering
DCH
DCH
control plane
user-plane
RRC
Signalling
Radio Bearers
L3
PDCP
BMC
RLC
L2
Logical Channels
MAC
Transport Channels
PHY
L1
AM-SAP
UM-SAP
RLCControl
Transmitting
transparent
entity
Receiving
transparent
entity
BCCH/PCCH/
CCCH/DCCH/DTCH
Acknowledged
mode entity
DTCH/DCCH
Transmitting
unacknowledged
entity
Receiving
unacknowledged
entity
CCCH/CTCH/
DTCH/DCCH
UTRAN/UE
TM-SAP
TM-SAP
Transmission
buffer
Transmitting
TM- RLC
entity
Segmentation
Receiving
TM- RLC
entity
Reassembly
Reception
buffer
CCCH/DCCH/DTCH/SHCCH UE
BCCH/PCCH/DCCH/DTCH UTRAN
CCCH/DCCH/DTCH/SHCCH UTRAN
BCCH/PCCH/DCCH/DTCH UE
The transmitting TM-RLC entity receives RLC SDUs from upper layers through
the TM-SAP.
All received RLC SDUs must be of a length that is a multiple of one of the valid
TMD PDU lengths.
If segmentation has been configured by upper layers and a RLC SDU is larger
than the TMD PDU size used by the lower layer for that TTI, the transmitting
TM RLC entity segments RLC SDUs to fit the TMD PDUs size without adding
RLC headers. All the TMD PDUs carrying one RLC SDU are sent in the same
TTI, and no segment from another RLC SDU are sent in this TTI.
If segmentation has not been configured by upper layers, then more than one
RLC SDU can be sent in one TTI by placing one RLC SDU in one TMD PDU.
All TMD PDUs in one TTI must be of equal length.
When the processing of a RLC SDU is complete, the resulting one or more TMD
PDU(s) are/is submitted to the lower layer through either a BCCH, DCCH,
PCCH, CCCH, SHCCH or a DTCH logical channel.
UE/UTRAN
UTRAN/UE
UM-SAP
UM-SAP
Transmission
buffer
Segmentation &
Concatenation
Transmittin
g
UM RLC
entity
Receiving
UM RLC
entity
Reassembly
Remove RLC
header
Reception
buffer
Ciphering
Deciphering
CCH/DTCH UE
DCCH/DTCH UTRAN
CCH/SHCCH/DCCH/DTCH/CTCH UTRAN CCCH/SHCCH/DCCH/DTCH/CTCH UE
The transmitting UM-RLC entity receives RLC SDUs from upper layers
through the UM-SAP.
The transmitting UM RLC entity segments the RLC SDU into UMD PDUs of
appropriate size, if the RLC SDU is larger than the length of available space in
the UMD PDU. The UMD PDU may contain segmented and/or concatenated
RLC SDUs. UMD PDU may also contain padding to ensure that it is of a valid
length. Length Indicators are used to define boundaries between RLC SDUs
within UMD PDUs. Length Indicators are also used to define whether Padding
is included in the UMD PDU.
If ciphering is configured and started, an UMD PDU is ciphered (except for the
UMD PDU header) before it is submitted to the lower layer.
The transmitting UM RLC entity submits UMD PDUs to the lower layer
through either a CCCH, SHCCH, DCCH, CTCH or a DTCH logical channel.
AM-SAP
AM RLC entity
Segmentation/Concatenation
RLC Control Unit
Add RLC header
Piggybacked status
Optional
Retransmission
buffer &
management
Reassembly
Received
acknowledgements
MUX
Transmission
buffer
Reception buffer
& Retransmission
management
Acknowledgements
Deciphering
Set fields in PDU Header (e.g. set poll
bits) & piggybacked STATUS PDU
Ciphering (only for AMD PDU)
Receiving side
Transmitting side
DCCH/
DTCH**
Demux/Routing
DCCH/
DTCH*
DCCH/
DTCH**
DCCH/
DTCH**
DCCH/
DTCH*
DCCH/
DTCH**
The associated AMD PDUs are reassembled by the Reassembly Unit and delivered
to upper layers through the AM-SAP.
RESET and RESET ACK PDUs are delivered to the RLC Control Unit for
processing. If a response to the peer AM RLC entity is needed, an appropriate
Control PDU is delivered, by the RLC Control Unit to the transmitting side of the
AM RLC entity.
The transmitting side of the AM-RLC entity receives RLC SDUs from upper layers
through the AM-SAP.
RLC SDUs are segmented and/or concatenated into AMD PDUs of a fixed length.
The segmentation is performed if the received RLC SDU is larger than the length of available
space in the AMD PDU.
The PDU size is set during AM-RLC establishment.
The packets could be segmented, concatenated, padded.
Boundaries between the packets are indicated by a length indicator.
After the segmentation and/or concatenation are performed, the AMD PDUs are placed in the
Retransmission buffer at the MUX.
AMD PDUs are submitted to either one or two DCCH or DTCH logical channels.
PDCP-SDU
PDCPControl
PDCP entity
PDCP entity
Header
comp. entity
Alg. Type 1
Header
comp. entity
Alg. Type 2
Header
comp. entity
Alg. Type 1
Header
comp. entity
Alg. Type 2
PDU
numbering
PDU
numbering
PDCP entity
Header
comp. entity
Alg. Type 1
RLC-SDU
RLC SAPs
UM-SAP
AM-SAP
Tr-SAP
The Packet Data Convergence Protocol shall perform the following functions:
Header compression and decompression of IP data streams (e.g., TCP/IP and
RTP/UDP/IP headers for IPv4 and IPv6) at the transmitting and receiving entity,
respectively. (In Release 99 compression accordingly RFC 2507).
Transfer of user data. This function is used for conveyance of data between users of
PDCP services.
Maintenance of PDCP sequence numbers for radio bearers that are configured to
support lossless SRNS Relocation.
PDCP uses the services provided by the Radio Link Control (RLC) sublayer.
BMC SAP
BMCControl
BMC entity
RLC SAPs
UM-SAP
Assignment, reconfiguration and release of radio resources for the RRC connection.
Control of requested QoS.
UE measurement reporting and control of the reporting.
RRC message integrity protection.
Arbitration of radio resources on uplink DCH.
Slow Dynamic Channel Allocation (DCA) (TDD mode).
Timing advance (TDD mode).
RRC connection mobility functions (RNC relocation).
Outer loop power control.
Control of ciphering.
Message Routing
BMCControl
SAP
PDCPControl
SAP
RLCControl
SAP
DCFE
PNFE
BCFE
MACControl
SAP
l1-Control
SAP
RLC SAPs
AM-SAP AM-SAP AM-SAP
UM-SAP
Tr-SAP
in
service
CELL_DCH
out of
service
in
service
in
service
GSM
Connected
Mode
GPRS
Packet
Transfer
Mode
CELL_FACH
out of
service
Release RRC
Connection
GSM:
Handover
UTRA:
Inter-RAT
Handover
CELL_PCH
Cell reselection
Establish RRC
Connection
Release of
temporary
block flow
Release RR
Connection
Initiation of
temporary
block flow
Idle Mode
Establish RR
Connection
Idle Mode:
After UE is switched on it will camp in the a suitable cell. After camping:
User is able to send and receive system and cell broadcasting information.
In the idle mode until it transmits a request to establish RRC connection.
Cell_DCH
Entered from Idle Mode or by establishing a DCH from the Cell_FACH state.
DPCH and physical downlink shared channel (PDSCH) is allocated to UE.
UE is in this mode until explicit signalling for Cell_FACH.
Cell_FACH
No dedicated channel allocated. Data transmitted through RACH and FACH.
UE listens BCH.
Cell reselection is performed (RNC is informed).
Cell_PCH
UE known at a cell level but can be reached via PCH.
Usel listens BCH, some terminals also BMC.
In case of Cell reselection automatically moved to Cell_FACH state.
URA_PCH
UE executes the cell update procedure only if the UTRAN Registration Area is changed.
DCCH can not be used in this state, all the activities initiated by the network through the
PCCH or RACH.
Planning
Planning should meet current standards and demands and also comply with future
requirements.
Uncertainty of future traffic growth and service needs.
High bit rate services require knowledge of coverage and capacity enhancements methods.
Real constraints
Coexistence and co-operation of 2G and 3G for old operators.
Environmental constraints for new operators.
Network planning depends not only on the coverage but also on load.
Capacity:
To support the subscriber traffic with sufficiently low blocking and delay.
Coverage:
To obtain the ability of the network ensure the availability of the service in the entire service area.
Quality:
Linking the capacity and the coverage and still provide the required QoS.
Costs:
To enable an economical network implementation when the service is established and a controlled
network expansion during the life cycle of the network.
What is new
Multiservice environment:
Highly sophisticated radio interface.
Bit rates from 8 kbit/s to 2 Mbit/s,
also variable rate.
Air interface:
Capacity and coverage coupled.
Fast power control.
Planning a soft handover overhead.
Cell dominance and isolation
Vulnerability to external interference
2G and 3G:
Coexistence of 2G 3G sites.
Handover between 2G and 3G
systems.
Service continuity between 2G and
3G.
Requirements
and strategy
for coverage,
quality, and
capacity,
per services
Coverage
Planning and
Site Selection
Propagation
measurements
Coverage
Prediction
Site
acquisition
Coverge
optimisation
Capacity Requirements
Traffic distribution
Service distribution
Allowed blocking/queuing
System features
Parameter
Planning
Area/Cell
specific
Handover
stategies
Externernal Interface
Analysis
Identification
Adaptation
Maximum
loading
Other
RRM
O&M
Network
Optimisation
Survey
measurements
Statistical
eprformance
analysis
Quality
Efficiency
Availability
P0 , 0
CIR
N K j -1
P0, 0 -
P1, 0
CIR
j =1 k =1
N K j -1
+...+ PK0 , 0 + Pk , j + h = 0
M
PK0 , 0
CIR
j =1 k =1
N K j -1
+ Pk , j + h = 0
j =1 k =1
20
0
20
s,i
[dBm]
Speed of users
min distance
uniform distribution
max distance
40
60
200
300
400
500
600
700
800
900
1000
Data rates
x 10
CIR
6.5
Soft Capacity
6
0
100
200
300
400
500
600
Distance from BS [m]
1 .2
700
0 .3
800
900
1000
Objective parameters
coverage
capacity (blocking)
good link quality (BER, FER)
throughput delay, for packet services
Methods
Network planning
Resource reservation for handling expected traffic without congestion.
load per cell/sector, handover areas
power
load
Planning methods
Preparation phase.
Defining coverage and capacity objectives.
Selection of network planning strategies.
Initial design and operation parameters.
Initial dimensioning.
First and most rapid evaluation of the network elements count and capacity of these elements.
Offered traffic estimation.
Joint capacity coverage estimation.
Detailed planning.
Detailed coverage capacity estimation.
Iterative coverage analysis.
Planning for codes and powers.
Optimisation.
Setting the parameters
Soft handover.
Power control.
2. Initial phase:
Network expansion:
Add more sites.
Add more sectors / carriers to existing sites.
Network expansion:
2G operator:
Re-using the infrastructure (Lover cost):
Green-field operator:
Radio network implementation from
scratch.
Renting infrastructure from other operators.
+ Transmission network.
+ Sites (masts, buildings, power supplies,).
Challenges
- Sufficient coverage for all services.
- Intersystem handover not seamless.
- Higher Cost.
Dimensioning
Initial planning
first rapid evaluation of the network element count as well as associated
capacity of those elements.
Radio access
Estimate the sites density.
Site configuration.
Activities
Link budget and coverage analysis.
Capacity estimation.
Estimation of the BS hardware and sites, RNCs and equipments at
different interfaces. Estimation of Iur,Iub,Iu transmission capacities.
Cell size estimation.
Needed
Service distribution.
Traffic density.
Traffic growth estimation.
QoS estimation.
Dimensioning process
Radio link specific input:
Link Budget calculation
- Data rate
max. allowed path loss
- Eb/Io
...
Interference
margin
Load Factor
calculation
Capacity estimation
nr. sites, total traffic
Equipment
requirement
nr BS, equipments
After choosing the cell range the coverage area can be calculated using
propagation models
Okumura-Hata, Walfisch-Ikegami, .
The coverage area for one cell is a hexagonal configuration estimated from:
S = K r2
S coverage area.
r maximum cell range, accounting the fact that sectored cells are not hexagonal.
K Constant accounting for the sectors.
Site configuration
Value of K
Omni
2.6
2-sectored
1.3
3-sectored
1.95
6-sectored
2.6
Example of a
WCDMA RLB
0.125
21
0
3
18
Receiver BS
Thermal noise density [dBm/Hz]
Base station recever noise figure [dB
Receiver noise density [dBm/Hz]
Receiver noise power [dBm]
Interference margin [dB]
Receiver interference power [dBm]
Total effective noise + interference [d
Processing gain [dB]
Required Eb/No [dB]
Receiver sensitivity [dBm]
-174
5
-169
-103.2
3
-103.2
-100.2
25
5
-120.2
18
2
0
154.2
a
b
c
d=a+b-c
e
f
g=e+f
h=g+10*log10(3840000)
i
j=10*log10(10^((h+1)/10)-10^(h/10
k=10*log10(10^(h/10)+10^(j/10))
l=10*log10(3840/12.2)
m
n=m-l+k
o
p
q
r=d-n+o-p-q
95
7
3.52
7.3 s
3t
8u
141.9 v=r-s+t-u
Pk
I own Pk + I oth + N
W
=
Rk
Eb
I0
Pk
I own Pk + i I own + N
k , k = 1,K, K n
The inequality must be hold for all the users and ca be solved for minimum received
signal power (sensitivity) for all the users.
R R
R
Pk 1 + k k = k k (1 + i ) I own + k k N
W
W
W
1
1
1 + i ) I own +
Pk =
N , k = 1,K, K
(
W
W
1+
1+
k Rk
k Rk
Kn
Kn
N
Kn
1
1
=
+
+
1
P
i
P
(
)
k
k
W
=
1
=
1
k =1
k
k
1+
k =1 1 + W
k Rk
k Rk
Kn
1
N
(1 + i )
W
k =1 1 +
Kn
k Rk
Pk (1 + i ) =
k =1
Kn
1
1
(1 + i )
W
k =1 1 +
k Rk
1
(1 + i )
W
k =1
1+
k Rk
By including also effect of sectorisation (sectorisation gain , number of sectors N s),
and voice activity .
Uplink loading is defined as: UL =
N
1
k 1 + i s
W
k =1
1+
k Rk
Kn
UL =
20
i=0
i=0.65
18
16
Noise rise [ dB ]
14
12
10
8
6
4
2
0
100
200
300
400
load [ kbit/s]
500
600
700
I
N
LP
The downlink loading is estimated based on DL = i i i (1 i ) + mi
W
i =1
n =1, LPni
n m
LPmi is a link loss from the serving BS M to MS I,
LPni is the link loss from another BS N, to MS I,
i is the transmit EI0b requirement for MS I, including soft HO combining gain an
the average power rise due to the fast power control,
N number of BS,
I
number of connections in a sector,
i orthogonality factor.
N
LPmi
i
=
The other to own cell interference in downlink DL
n =1, LPni
n m
The total BS transmit power estimation considers multiple communication links with
average LPmi from the serving BS.
signal power,
Pr
N 0 W background noise.
SNR =
R
W (1 )
Spectrum efficiency
Uplink
rx_Eb/Io is a function of required BER target and multipath channel model.
Macro diversity combining gain can be seen as having lower rx_Eb/Io when
the MS is having links with multiple cells.
Inter cell interference i is a function of antennae pattern, sector configuration
and path loss index.
Downlink
tx_Eb/Io is function of required BER target and multipath channel model.
Macro diversity combining gain can be seen as having lover tx_Eb/Io when
MS is having radio links with multiple cells.
Orthogonality factor is a function of the multipath channel model at the given
location.
Planners have to select the sites so that the other to own cell interference i is
minimised.
Cell should cover only what is suppose to cover.
Coverage improvement
Capacity improvement
Adding frequencies.
Adding cells.
Sectorisation.
Transmit diversity.
Lower bit rate codecs.
Multibeam antennas.
RNC Dimensioning
The whole network area divided into regions each handled by a single RNC.
RNC dimensioning: provide the number of RNCs needed to support the estimated traffic.
For uniform load distribution the amount of RNCs:
numRNCs =
numCells
cellsRNC fillrate1
NUM#ELLS number of cells in the area to be dimensioned, CELLS2.#maximum number of cells, FILLRATE
margin used to back off from the maximum capacity.
numBTSs
btsRNC fillrate2
NUM"43S number of BS in the area to be dimensioned, BTS2.#maximum number of BSs that can be
connected to one RNC, FILLRATE margin used to back off from the maximum capacity.
numRNCs =
numRNCs =
TP2.#maximum Iub capacity, FILLRATE margin used to back off from it, NUM3UBS the expected number
simultaneously active subscribers.
Soft blocking
If all BS channel elements are busy, the next call comes to the cell is blocked.
The cell capacity can be obtained from the Erlang B model.
Soft blocking
The capacity limited by the amount of interference in the air interference.
Call admission based on QoS control
There is always more than enough BS channel elements.
Soft capacity
Soft capacity: the increase of Erlang capacity with soft blocking compared to that with
hard blocking with the same maximum number of channels per cell.
Erlang capacity with soft blocking
SoftCapacity =
1
Erlang capacity with hard blocking
Minimum cell throughput for NRT data should be planned for busy hour loading in
order to maintain some QoS.
By filling the capacity not used by RT traffic we increase loading and in effect go after
the free capacity used for soft capacity, cell dimensioning becomes more complex.
Load
max. planned load
Admission control
Extra capacity
admit if possible
threshold based systems
initialise
iteration
combined UL/DL
iteration
Creating a plan,
Loading maps
global
initialisation
uplink
iteration step
downlink
iteration step
Defining service
requirements
Importing/creating and
editing sites adn cells
Importing
measurements
Importing/generating
and refining traffic
lauyers
Model tuning
WCDMA calculations
Analyses
post
processing
post processing
phase
graphical
outputs
Quality of Service
Neighbour cell
generation
coverage
analyses
Reporting
END
Digital map.
for coverage prediction.
totpoligical data (terrain), morphological data (terrain type), building location and height.
Resolution: urban areas M, rural areas
M.
Plan.
logical concept combining various items.
digital map, map properties, target plan area, selected radio access technology, input parameters, antenna
models.
Antenna editor.
logical concept containing antenna radiation pattern, antenna gain, frequency band.
Planning
Importing sites.
Utilisation of 2G networks.
Bearer service
definition
Traffic
modeling
mobile list
generation
WCDMA
calculation
Optimising dominance.
Interference and capacity analysis.
Locating best servers in each location in the service area.
Target to have clear dominance areas.
Monte-Carlo simulation.
Finding average over many snapshots: average, minimum, maximum, std.
Averages over mobile locations.
Iterations are described by:
Number of iterations.
Maximum calculation time.
Mobile list generation.
General calculation settings.
Outage
after UL
UL
Iteration
Traffic after
UL
Throughput
UL
Best Server
UL
Cell loading
DL
Iteration
SHO area
Coverage
UL
Best Server
DL
Ec/Io
Cell TX
powers
per link
Traffic After
DL
Throughput
DL
Covergae
pilot Ec/Io
Reporting:
Outage
After DL
Covrage
pilot Ec/Io
Active set
sizes
no convergence
DL iteration step
convergence
post processing
END
UL iteration step
Initialise deltaCIold
allocate the CPICH powers
calculate the received Perch levels
and determine the best server in DL
calculate the MS senisitivities
determine the SHO connections
END
E N
The target CIR CIRt arg et = b 0
W R
The actual CIR
N
Pnk LPnk
C
=
I k n =1 (1 k ) Pn LPnk + I oth ,n + N k
The planning tool evaluates the actual
CIR and compares it to the Target CIR
Coverage analysis
UL DCH Coverage
W
(1 ) 1 +
R
DL DCH Coverage
Pixel by pixel is checked whether an additional mobile having certain bit rate could be
served. Concentration on the power limits per radio link.
The transmit power need for supporting the link is calculated and compared to the
R W
maximum allowed:
Ptx N
n
k AS LPk ( I tot I k + N ms )
DL CPICH Coverage
Dynamic simulation
Conclusions
Cell level results are in good agreement with both, dynamic and static results.
The outage areas are in the same locations if investigated with different
simulations.
Changing capacity.
Admission control.
Packet scheduling.
Load Control.
Resource management.
Power control.
Handover control.
Changing Capacity
RRM purpose.
Link Quality
Optimisation
and tailoring
Cell coverage
Cell Capacity
Prx_threshold
Interference measurements.
Soft capacity utilisation.
Scheduling in radio interface.
Actions to load change.
Real time interference minimisation:
Handover control.
Service prioritisation.
Connection parameter settings.
Admission control.
BS
SRNC
Admission Control
Packet Scheduler
Load Control
Resource Manager
Power Control
Handover Control
Power Control
Power Control
Load Control
DRNC
RRM functionality is a
set of algorithms used
for optimal utilisation of
air interface and HW
resources.
Admission Control
Load Control
Resource Manager
Power Control
Load Control
RRM methods
Network based functions.
Admission control (AC).
Handles all new incoming traffic. Check whether new connection can be admitted to the system
and generates parameters for it.
Occurs when new connection is set up as well during handovers and bearer modification.
no new
RAB
Drop RT bearers
LC
PS
decrease bit rates
overload
actions
NRT bearers
to FACH
drop NRT bearers
PrxTarget+PrxOffset or
PtxTarget+PtxOffset
perventive
state
only bew RT
bearers if RT load
below PrxTarget/
Prxtarget
preventive load
control actions
no new capacity
request scheduled
bit rate not
increased
PrxTarget or
PtxTarget
normal
state
AC admits
RABs normally
no action
PS schedules
packet traffic
normally
In uplink.
m
m
In downlink.
m
m
5,
) OWN + I oth
PrxTotal
.
PrxTotal = I own + I oth + Pn
Noise Rise=PrxTotal/PrxNoise
Overload area
Prx_threshold
Noise rise
Noise _ RiseUL
P
1
= rxTotal =
1 UL
PN
%NR=?
%Load
Prx_Noise
Max planned load
The UL loading is calculated based on the individual load factor of each individual
user.
1
UL =
W
k 1+
(1 + i )
k Rk k
The load can be estimated by dividing the total currently allocated transmit
power at the BS by the maximum transmitted power capability of the cell:
P
DL = txTotal
PtxMAX
The loading is the sum of the bit rates of all currently active connections
divided by the maximum throughput of the cell:
N
DL =
R
k =1
2MAX
W
DL = (1 ) + iDL
k =1 k Rk k
N
Admission control
0RX4OTAL
L
1
0
I RX4OTAL L .
1 L
I
1
.
W
1+
R
Downlink
A new bearer is admitted only if the load after admittance stays below the
threshold defined by RNP.
Uplink
oldUL + L thresholdUL
Downlink
oldDL + L thresholdDL
Admission control
In the decision procedure AC will use threshold form network planning and from
interference measurements.
The new connection should not impact the planned coverage and quality of existing
connections. (During the whole connection time.)
AC estimates the UL and DL load increase which new connection would produce.
AC uses load information from LC and PC.
Load change depends on attributes of RAB: traffic and quality parameters.
If UL or DL limit threshold is exceeded the RAB is not admitted.
AC derives the transmitted bit rate, processing gain, Radio link initial quality
parameters, target BER, BLER, Eb/No, SIR target.
AC manages the bearer mapping
The L1 parameters to be used during the call.
Logical dependencies of AC
Iub
Bearer set up request
RM
Radio Resource Info
- Codes
- Transport resources
RB info
Resource request
Resource info
PS
AC
Load change estimation
RAB admission
L2 parameters
Transport Format Combination
DL Power allocation
Load Info
Load Change
Info
Load Info
Target BER/BLER/SIR
Active set info
PC
HC
LC
Packet scheduling
To determine the available radio interface resources for non real time radio bearer.
To share the available radio interface resources between non real time radio bearers.
to monitor the allocations for non real time radio bearers.
To initiate transport channel type switching between common, shared and dedicated
channels when necessary.
To monitor the system loading.
To perform load control actions for the non-real-time radio bearers when necessary.
AC handles
Load
bit rate
Packet call
time
PS handles
time
DCH
RACH
TrCH type
Applicable UE
state
Direction
Code Usage
Dedicated
CELL_DCH
Common
Common
Common
Shared
CELL_FACH CELL_FACH CELL_FACH CELL_FACH
Both
Accordingly to
maximum bit
rate
Power control Fast closedloop
SHO support Yes
Target data
Medium or
traffic volume high
Suitability for Poor
bursty data
Setup time
High
Relative radio High
performance
FACH
Uplink
Fixed code
allocations in a
cell
Open-loop
Downlink
Fixed code
allocations in a
cell
Open-loop
No
Small
No
Small
Good
Low
Low
CPCH
DSCH
Good
Uplink
Fixed code
allocations in a
cell
Fast closedloop
No
Small or
medium
Good
Downlink
Fixed code
allocations in a
cell
Fast closedloop
No
Medium or
high
Good
Low
Low
Low
Medium
Low
Medium or
high
Load Control
Purpose: optimise the capacity of a cell and prevent overload
The interference main resource criteria.
LC measures continuously UL and DL interference.
RRM acts based on the measurements and parameters from planning
Overload condition.
LC is responsible for reducing the load and bringing the network back into operating area.
Controllable traffic.
Non-real-time users (traffic).
Overlaod Area
Power
Load Target
Overload margin
Estimated Capacity
for NRT load
time
Description of LC
LC consists of AC, PS algorithms and LC, updating load status based on the
measurements and estimations from AC and PS.
LC algorithm
Resource management
Power control
First DPCCH power level for the uplink inner-loop PC is started as.
$0##(?)NITIAL?0OWER = DPCCH _ Power _ Offset #0)#(?23#0
SIRDPCCH is the initial target SIR produced by the AC for the particular connection.
SFDPDCH is the spreading factor of the corresponding DPDCH.
The open loop PC is used to the the initial power of the downlink
channelsbased on downlink measurement reports.
The function is in UTRAN and MS.
A possible algorithm for initial power calculations is
Initial
Tx
P
R
( Eb N 0 ) DL
W
( Eb N 0 )CPICH
PtxTotal
R ( Eb N 0 ) DL CPICH _ Tx _ power
=
PtxTotal
W
E
N
(
)
b
0 CPICH
DL common
channels
P-CPICH
P-SCH S-SCH
P-CCPCH
PICH
AICH
S-CCPCH
PDSCH
Typical power
Note
level
30-33 dBm
5-10% of maximum cell Tx power (20 W). Set during
Network planning.
-3 dB
Relative to P-CPICH power.
-5 dB
Relative to P-CPICH power.
-8 dB
Relative to P-CPICH power and Number of paging
indicators per frame Np = 72.
-8 dB
Power of one Aquisation Indicator (AI) compared to PCPICH power.
-5 dB
Relative to P-CPICH and SF=256 (15 ksps). The
configuration covers FACH power, max FACH power,
PCH power.
FACH slow PC can be applied.
Inner loop PC TPC commands from user. A proprietary protocol for
slow PC can be used.
,
S
hm
+M
t
i
r
c
i
ff
lgo
, tra
Ca
s
P
s
o
,
C
th l
PC
a
T
p
CR
%
,
L
P
L
U
C
E
,U
z): IR
RNC
ors _MOD H RS
H
t
x/
c
0
fa PS
0 get S
IC
ma E
/
l
1
P
n
i
a
D
it
D P-C ans
a
ar
10
, me
Lg
L in _MO
P ( tual t
o
U
I
F
D
,
/
C
,
c
l
R
H
ac
LE
SIR C, DP
H E terna
DC DL
B
t
C
t
e
I
n
i
P
e
P
rg
l ta L %T
targ
P-C
a
,
t
L
i
R
D
,D
In
UL outer loop PC
LE
C:
P: ower
B
R
A
l
R
a
B
n
p
u
o
N RL
t
%SIR = f(BLER (BER)
: ac
nds
n
i
a
C
m
SIR
target measurements
m
RR
om
c
H
C
C
PD
TP PCCH
D
L
+
D
D CH
/
UL
BS
PC
y
D
l
n
n
o
Ho
PC
CC
P
D
SIR estiamte vs. target SIR
on
C
P
UL TPC commands
MS
DL outer loop PC
%SIR = f(BLER (BER)
SIR target measurements
SIR estiamte vs target SIR
DL TPC commands
Received signal power is compared to the CIRtarget and depending on the result
transmission power is asked to increase to decrease.
CIRtarget is got from uplink outer loop PC.
Fast PC algorithm: 1
PC during handover
Commands know to be same are combined into one command that is combined further with other
TPC commands
commands not known to be the same
soft symbol decision on each of the PC commands TPCi where i=1N
to each symbol is assigned a realiability figure Wi
The TPC commands are combined as function of of all N power control commands TPCi
and reliability estimates Wi:
TPC_cmd= (W1,W2,..,WN,TPC1,TPC2,,TPCN), where TPC_cmd -1,1
Allows:
Fast PC algorithm: 2
Combining TPC_cmd known to be same. The commands are combined into one command
Combining TPC_cmd not known to be same
MS makes PC decision over 3 slots
sums all the decisions that are not known to be same in a slot
the TPC_cmd for two first slots is 0 and for the third slot it is either - 1, 0, + 1 depending on the
value of the normalised sum of PC bits
MS estimates the received SIR and compares it with required SIR target.
SIR is estimated from the pilot symbols of the DL-DPCH
Power difference for different channels is estimated from given power offset
values.
Changes of power are multiplies of the minimum step size
it is mandatory for BS to support 0.5 and 1 dB step size
Tslot=2560 chips
TL Tx
power
PO2
DL DPCH
Data
DPDCH
PO1
TPC
TPCI
DPCCH
PO3
Data
DPDCH
Pilot
DPCCH
Soft handover.
The signals are combined in MS.
Power drifting?
The transmission code power levels of athe connecions from the cell in SHO are
forwarded, after averaging, to RNC.
Averaging for example 750 TPC commands (500 ms).
Outer loop PC
Outer loop power control produces an adequate target CIR for inner loop PC.
Done for each DCH belonging to the same RRC connection.
Frequency typically 10-100 Hz.
During Soft HO.
The UL quality is observed after the MDC. The SIR target is generated for all cells in SHO.
The reliability of the blocks is provided to RNC. The quality is estimated based on CRC codes.
LC
UL Outer Loop
PC Controller
SIR Target
modification
command
Quality info
BLER/BER
UL Outer loop PC
Entry #
Calculation of SIR
target change
MDC
MDC
MDC
New SIR
Target
Transmission of
the new SIR target
value ot BTS
AC
Inital SIR target
RNC
Node B
PC in compressed mode
Aim to recover a SIR close to the target SIR after each transmission gap
In downlink compressed mode no PC is applied during transmission gap
In simultaneous DL/UL compressed mode transmission is stopped
The initial tr power of each UL after the tr gap is equal to the power before the gap,
but with an offset resume
resume may be
0
resume = Int[last / TPCmin] TPCmin
PC modes are fixed and signalled with the other parameters during the downlink
compressed mode
ordinary PC is applied
ordinary PC is applied with step size RP-TPC during RPL slots after transmission gap.
Handovers
Intrasystem HO.
Intrafrequency HO.
Interfrequency HO.
Intersystem HO.
Hard HO (HHO).
All the old radio links of an MS are released before the new radio links are established.
Real time bearers: short disconnection in transmission.
Non real time bearers HHO is lossless.
Soft HO (SHO).
MS always keeps at least one radio link to UTRAN.
Soft HO: MS is simultaneously controlled by two or more cells belonging to diffetrent BTS of
the same RNC or to different RNC.
Softer HO. MS is controlled by at least two cells under one BTS.
Intrasystem intra-frequency HO
Objectives of soft/softer HO.
Optimum fast closed loop PC as the terminal is always linked with the strongest cells.
Seamless handover with no disconnection of the radio access bearer.
Diversity gain by combining the received signals from different cells. Better coverage. Less
transmission power.
MEHO: MS continuously measures serving and neighbouring cells on the current carrier.
The RAN can perform soft and softer HO simultaneously.
General HO activities.
Reporting of the MS measurements.
Compares measurement results with the HO threshold.
MS sends reports to BTS when the criteria is met.
Threshold is provided by the RNC.
Comparison result is transmitted to RNC.
HO decision.
SRNC orders MS to add or remove cells from/to Active set.
Measurements reporting
Neighbouring cells
For each cell in the radio network configuration database are defined a list of neighbouring
cells.
Intrafrequency neighbouring list. The UE must be able to monitor at least 32 cells on
the same WCDMA carrier frequency as the serving cell.
Interfrequency neighbouring list. The UE must be able to monitor at least 32 cells on
the two other WCDMA carrier frequencies compared to the serving cell.
Intersystem neighbouring list. For each neighbouring PLMN a separate list is
maintained.
UE internal measurements.
Controlled cell by cell bases. Info transmitted to MS in DCCH.
P-CPICH 1
P-CPICH
Ec/Io
P-CPICH 2
Addition
window
Drop
window
Replacement
window
P-CPICH 3
P-CPICH 4
Reporting of:
Event 1a Event 1e
Event 1C
10
log
M
W
10
log
M
Event 1a.
new )
i + (1 W ) M Best ( R1a H 1a 2 )
10 (
10
i =1
NA
Event 1b. 10 log10 ( M Old ) W 10 log10 M i + (1 W ) M Best ( R1b + H 1b 2 )
i =1
R1a
Mi
H 1a
R1b
NA
M Best
W
M Old
H1b
Periodic Reporting.
If the operation (AS update) can not occur because lack of HW the MS continues to send
periodic reports.