Beruflich Dokumente
Kultur Dokumente
Agenda
1. WCDMA Fundamentals Introduction WCDMA Network Architecture and Interfaces Basic Concepts: Spreading, Processing Gain WCDMA codes Radio Fundamentals : RSCP, Ec/Io WCDMA channels 2. WCDMA Network Dimensioning and Planning WCDMA Network Dimensioning Process Overview Cell Breathing Concept Input Planning Parameters Link Budget 3G Planning : Key Results analysis
Price/performance of technology
New spectrum
GSM evolution to 3G
High Speed Circuit Switched Data Dedicate up to 4 timeslots for data connection ~ 50 kbps Good for real-time applications Inefficient -> ties up resources, even when nothing sent Enhanced Data Rates for Global Evolution GSM Uses 8PSK modulation HSCSD 9.6kbps (one timeslot) 3x improvement in data rate on short distances GSM Data Can fall back to GMSK for greater distances Also called CSD Combine with GPRS (EGPRS) ~ 384 kbps
GSM
GPRS EDGE
WCDMA
General Packet Radio Services Data rates up to ~ 115 kbps Max: 8 timeslots used at any one time Packet switched; resources not tied up all the time GSM / GPRS core network re-used by WCDMA (3G)
Voice SMS
Video sharing Video telephony Real time IP Real time games High speed mobile intranet
Non-real time Interactive, medium Real time background and bit rate streaming, connections, narrowband business connectivityefficient business streaming connectivity
CDMA
EDGE Evolution
GSM WCDMA UMTS-TDD WiMAX (802.16-2004) HSPA I-HSPA 3.9 G
WiMAX (802.16-2005)
Flarion Flash-OFDM WLAN (unlicensed) 05 06 10
9 Nokia Siemens Networks
07
08
09
10
3GPP is a co-operation between standardisation bodies ETSI (Europe), ARIB/TTC (Japan), CCSA (China), ATIS (North America) and TTA (South Korea) GSM, EDGE UMTS WCDMA - FDD WCDMA - TDD
3GPP2 is a co-operation between standardisation bodies ARIB/TTC (Japan), CCSA (China), TIA (North America) and TTA (South Korea) CDMA2000 CDMA2000 1x CDMA2000 1xEV-DO
11
Structure of 3GPP
TSG STRUCTURE
12
UMTS Releases
UMTS Release 99
UMTS CN UTRAN & WCDMA
1999 2001
UMTS Release 4
2002
UMTS Release 5
High Speed Downlink Packet Access (HSDPA) Wideband AMR Initial phase of the IP Multimedia Subsystem IP transport in the UTRAN etc. FDD Enhanced Uplink (HSUPA) IMS Phase 2 Wireless LAN/UMTS Inter-working Multimedia Broadcast/Multicast Service (MBMS) 64 QAM modulation MIMO HSPA+ LTE
2005
UMTS Release 6
2007
UMTS Release 7
2008
13 Nokia Siemens Networks
UMTS Release 8
3G evolution performance
WCDMA R99 3GPP 5.0 MHz 100-200 ms 384 kbps 384 kbps
Standard Bandwidth Network Latency Downlink peak rate Uplink peak rate Spectral efficiency, DL Spectral efficiency, UL
1.8-10.7 Mbps
1-4 Mbps 0.2-0.8 bps/Hz 0.25 bps/Hz
Up to 50 Mbps
1.6-2.5 bps/Hz 0.6-0.8 bps/Hz
0.16 bps/Hz
0.16 bps/Hz
15
17
18
19
Technology Forecast
20
Subscriber Forecast
21
22
23
24
25
26
27
The Roads to 3G
2G
2.5G
IS-95B
3G
CDMA
CDMA IS-95A
1xRTT
1xEV-DO
1xEV-DV
CDMA2000 3xRTT
HSCSD
GSM
GSM
GPRS
EDGE
WCDMA
Multiple phases
28
UMTS NW Architecture
UTRAN
WCDMA BTS
Uu
RNC
WCDMA BTS
Iur
Iu
RNC
WCDMA BTS
30
CN
Circuit MSC/VLR switched (cs) domain
RNC
Uu Iur UE packet switched (ps) domain
Iub
RNC
Iu-PS
SGSN
31
General UE Architecture
UMTS SIM
USIM
CU
Terminal Equipment
Mobile Equipment
ME
UTRAN
UE UU
32
Node B
Radio Network Controller
Iu-cs
RNC
CN (MSC)
Node B
UE
Node B
Radio Network Controller
CN (SGSN)
Node B
RNC
UTRAN IU
Iu-ps
UU
33 Nokia Siemens Networks
Elements of UTRAN
Radio Network Controller
Owns and controls radio resources in its domain (BSC in GSM) Service Access Point for all services that UTRAN provides for the CN Note: Service RNC (SRNC) and Drift RNC (DRNC) are subsets
34
CN Iu
RNC Iur RNC
Iur
The Interface between different
RNCs
Iub
The interface between the Node B
and the RNC
Uu
The air interface
Iub NodeB Uu
UE
35
CN Iu
RNC Iur RNC
Iub NodeB Uu
UE
36
CN Iu
RNC Iur RNC
Iub NodeB Uu
UE
37
CN Iu
RNC Iur RNC
Iub NodeB Uu
UE
38
CN Iu
RNC Iur RNC
Iub NodeB Uu
UE
39
WCDMA Services
41
QoS Classes
Videotelephony
Telephony
File downloading
Teleshopping Teleworking
43
Conversational Class
Conversational pattern - symmetric Real time, Extremely delay sensitive Typically between peers Example Applications:
Voice Video telephony
44
Streaming
Highly asymmetric Real time, relatively low delay required Typically between server and client Example Applications
Web broadcast Video on demand Streaming multimedia
45
Interactive
Request response pattern Preserve data integrity Relatively delay sensitive but not real time Treated as non-real time packet based service Example applications:
Web browsing Location based services Database retrieval
46
Background
Destination is not expecting the data within a certain time Preserve data integrity Treated as non-real time packet based service Example Applications
Download of Emails File download
47
49
51
TDMA
Timeslot Period
Frame Period
frequency time
User 1 User 1 Idealised TDMA (with no guard periods)
52 Nokia Siemens Networks
FDMA
Frame Period (we may still need frames/timeslots for signaling) Channel Bandwidth
frequency
User 1
53 Nokia Siemens Networks
time
frequency
54 Nokia Siemens Networks
code
time
WCDMA Technology
Frequency
f 5 MHz
WCDMA Carrier
3.84 MHz
Time
55
GSM900/1800:
3G (WCDMA):
56
57
Spreading
58
Spreading Code
chip rate
Each user data bit is multiplied with a sequence of 'x' code bits called CHIPS.
Data bits when spreaded with code sequence is known as chips
In order to distinguish between the information-carrying bits in the user data and the bits in the user spreading codes, we tend to use the term chips to refer to the bits in the spreading code
60
Each user data bit is multiplied with a sequence of 'x' code bits called CHIPS. Data bits when spreaded with code sequence is known as chips
Example: Spreading code 1 = (1, -1) Data to spread = (1,0,1,1) Data after spreading = (1, -1).(1), (1,-1).(0), (1,-1).1, (1,-1).1 = (1,-1, -1,1,1-1,1,-1)
Spreading factor (SF) = Spreaded Signal BW / Unspreaded Signal BW = The number of chips per data
61
The resulting spread data is at a rate of 'x' times user data rate
Despreading The spread user data/chip sequence is multiplied with the same 'x' code
chips to recover the original data. Example: Spreading code 1 = (1, -1) Data to spread = (1,0,1,1) Data after spreading = (1, -1).(1), (1,-1).(0), (1,-1).1, (1,-1).1 = (1,-1, -1,1,1-1,1,-1)
Despreading : Multiply the received signal with same spreading code ( 1, -1, -1, 1, 1, -1, 1, -1).(1,-1)
1. Take first two chips = (1,-1).(1,-1) = 1+1 = 2 = +ve => 1 2. Take next two chips = (-1,1).(1,-1) = -1 -1 = -2 = -ve => 0 3. Take next two chips = (1,-1).(1,-1) = 1+1 = 2 = +ve => 1 4. Take next two chips = 1,-1).(1,-1) = 1+1 = 2 = +ve => 1
62
Spreading
63
Frequency
Processing gain:
W G p dB R
64
Example
Voice user (R=12,2 kbit/s)
R
Gp=W/R=24.98 dB
Frequency (Hz)
Spreading sequences have a different length Processing gain depends on the user data rate
Gp=W/R=10 dB
Frequency (Hz)
65 Nokia Siemens Networks
66
WCDMA Codes
In WCDMA two separate codes are used in the spreading operation
Channelisation code Scrambling code
Scrambling code
DL: separates cells in same carrier frequency UL: separates users
Channelisation code
DL: separates different users within a cell UL: separates physical channels of one user
67
SCRAMBLING CODE
Node B
X
User 1 Signal
Channelisation Code 2
X
User 2 Signal
+
3.84 MHz RF carrier RF
Channelisation Code 3
X X
User 3 Signal
RF X X
Node B
Scrambling Code 2
User 1 Signal
Channelisation Code 2
X
User 2 Signal
RF
X
User 3 Signal
69
CHANNELISATION codes:
CODE 1
Pilot BCCH
P-CPICH Pilot X
CODE 2
BCCH
P-CCPCH
X
CODE 3
SUM
Time
User 1
DPCH1
CODE 4
+
SCRAMBLING CODE X RF 3.84 MHz RF carrier
User 2
X
CODE 5
DPCH2
User 3
DPCH3
Orthogonality
Two codes are said to be orthogonal when their inner product is zero.
Then : S1* S2 = 0
Eg:(1, 1, 1, 1) and (1, 1, -1, -1) are orthogonal: (1 * 1) + (1 * 1) + (1 * -1) + (1 * -1) = 0
71
Top sub-element
Cch,4,0 =(1,1,1,1) Cch,2,0 = (1,1)
Cch,4,1 = (1,1,-1,-1)
Cch,1,0 = (1)
Cch,4,2 = (1,-1,1,-1)
Cch,2,1 = (1,-1)
Bottom sub-element
SF = 1 SF = 2
Cch,4,3 = (1,-1,-1,1) SF = 4
72
SF= 8
C8(0)=[11111111 ]
C4(1)=[11-11]
C0(0)=[ 1] C4(2)=[1-111] C2(1)=[11] C4(3)=[1-111]
.....] C16(1)=[....... .....] C16(2)=[....... C8(1)=[1111-1-1-1- .....] 1] C16(3)=[....... .....] C16(4)=[....... C8(2)=[11-1-111-1- .....] 1] C16(5)=[....... .....] C16(6)=[....... C8(3)=[11-1-1-1-111] .....] C16(7)=[....... .....] C16(8)=[....... C8(0)=[1-11-11-11- .....] C16(9)=[....... 1] .....] C16(10)=[....... C8(5)=[1-11-1-11-11] ....] C16(11)=[......... ..] C16(12)=[..... C8(6)=[1-1-111-1-11] ......] C16(13=[...... .....] C16(14)=[..... C8(7)=[1-1-11-111- ......] 1] C16(15)=[..... ......]
SF=1 6 C16(0)=[.......
...
SF=25 SF=51 6 2
73
Example
Spreading code 1 = (1, -1) Date to spread = (1,0,1,1) Data after spreading = (1, -1).(1), (1,-1).(0), (1,-1).1, (1,-1).1 = (1,-1, -1,1,1-1,1,-1) Spreading code 2 = (1,1) Date to spread = (0,0,1,1) Data after spreading = (-1,-1, -1,-1, 1,1, 1,1 ) Combined signal = (1,-1,-1,1,1,-1,1,-1) + (-1,-1,-1,-1,1,1,1,1) = (0,-2,-2,0,2,0,2,0) User 1 decodes it by simple vector multiplication (0,-2, -2,0, 2,0, 2,0) . (1,-1)
1. 2. 3. 4.
Take first 2 bits = (0,-2).(1,-1) = (0).(1) + (-2).(-1) = 0+ 2 = 2 => +ve => 1 Take next 2 bits = (-2,0).(1,-1) = (-2).(1) + (0).(-1) = -2+0 = -2 => -ve => 0 Take next 2 bits (2,0).(1,-1) = 2.1 + 0.-1 = 2 + 0 = 2 => =+ve => 1 Take next 2 bits (2,0).(1,-1) = 2 => +ve => 1
75
Multipath Propagation
Scramblin g code C1
C1+2
Scramblin g code C2
76
77
Fading ????!!!
Fingers??!!
Spreading/Despreading???!!!
79
Rake Receiver
A rake receiver is a radio receiver designed to counter the effects of
multipath fading. It does this by using several "sub-receivers" called fingers, each assigned to a different multipath component
80
RAKE Receiver
81
RAKE RECEPTION
Operating Principle of Rake Receiver
Assign a RAKE finger to each time delay position where significant energy arrives. Within each correlation receiver track the fast changing phase and amplitude
Combined Symbol
finger1 finger2
finger3
82
UMTS Bearers
NRT PS data 8, 16, 32, 64, 128, 256, 384 (UL/DL) (CELL_DCH)
NRT PS data 16 (UL), 32 (DL) (CELL_FACH) Streaming PS data 8, 16, 32, 64, 128, 256 (DL) Lower AMR speech codecs: 7.95, 5.90, 4.75 , 12.65, 8.85, 6.6
83
84
CPICH
The Common Pilot Channel (CPICH) is broadcast from every cell It carries no information and can be thought of as a beacon constantly transmitting the
Scrambling Code of the cell WCDMA cells are identified by their SC. Its like a BCCH in GSM
It is this beacon that is used by the phone for its cell measurements for network acquisition
and handover purposes (Ec, Ec/Io).
85 Nokia Siemens Networks
Io
In a WCDMA network the User Equipment (UE) receives signals from many cells Io* = The sum total of all of these signals (dBm) *Note: Sometimes Io is referred to as No, RSSI
86
RSCP 1
RSCP 2
RSCP
Using the properties of SCs the UE is able to extract the respective CPICH levels from the sites received
RSCP = The Received Power of a Particular CPICH (dBm) Ec = Energy per Chip
87
Io
RSCP
From the previous two measures we can calculate a signal quality for each CPICH (SC) received Ec/Io = (Energy per chip / Noise spectral density) = RSCP/RSSI *Note: Sometimes Ec/Io is referred to as Ec/No
88 Nokia Siemens Networks
89
Handover Types
Intra-Frequency Handovers Softer Handover Soft Handover Hard Handover Inter-Frequency Handover Can be intra-BS, intra-RNC, inter-RNC
90
91
92
93
3G
2G
94
Handover types
Node B
Node B Node B
Sector 1
Sector 1 f1 Sector 2 f1
Frequency f1
Frequency f1
Sector 3 f1
Sector 3
Softer Handover
RNC
UMTS
RNC
Iur
GSM900/1800
Node B
Node B
Inter-System Handover
Iub
Iub
Node B
Frequency f1 Frequency f2
Node B
Frequency f1
Frequency f1
Hard/Inter-Frequency Handover
95 Nokia Siemens Networks
97
WCDMA Frame
Radio frame: A radio frame is a processing duration which consists of 15 slots.
The length of a radio frame corresponds to 38400 chips.
Slot: A slot is a duration which consists of fields containing bits. The length of a
slot corresponds to 2560 chips
10 11 12 13 14
10ms
98
L3
L2
Medium Access Control MAC
Logical Channels
Transport Channels
L1
Physical Layer
Physical Channels
99
100
Logical Channels
content is organised in separate channels, e.g. System information, paging, user data, link management
Transport Channels
logical channel information is organised on transport channel resources before being physically transmitted
101
DTCH
DCH
DPDCH
DPCCH
102
CCCH
RACH
PRACH
DCCH
HS-DPCCH DTCH
DCH
DPDCH DPCCH
103
P-CPICH
BCCH PCCH CCCH BCH PCH P-CCPCH S-CCPCH PICH AICH P-SCH S-SCH HS-PDSCH HS-SCCH DPDCH DPCCH
FACH
HSDSCH DCH
DCCH
DTCH
104 Nokia Siemens Networks
AICH P-SCH
S-SCH
DCCH
DTCH
HSDSCH DCH
105
P-CPICH
P-CCPCH
DCCH
DTCH
106 Nokia Siemens Networks
FACH
P-SCH S-SCH
DCCH
HSDSCH DCH
DTCH
107
CCCH
FACH
AICH P-SCH
S-SCH HS-PDSCH HS-SCCH DPDCH DPCCH
DCCH DTCH
108 Nokia Siemens Networks
HSDSCH DCH
P-CPICH BCCH BCH P-CCPCH S-CCPCH PICH CCCH FACH AICH P-SCH S-SCH HS-PDSCH HS-SCCH DPDCH DPCCH
109 Nokia Siemens Networks
PCCH
PCH
DCCH DTCH
HSDSCH DCH
P-CPICH BCCH PCCH BCH PCH P-CCPCH S-CCPCH PICH CCCH FACH P-SCH S-SCH DCCH HSDSCH DCH HS-PDSCH HS-SCCH AICH
DTCH
DPDCH
DPCCH
110
cell coverage: all the channels must be decoded at the cell edge cell capacity: the common channel power consume resources from the
traffic channels
111
112
113
114