Professional Documents
Culture Documents
Klaus David
Gliederung
HSDPA Concepts HSDPA Control Channels HSUPA Fast Scheduling in HSDPA
ComTec 2005
Gliederung
Packet transmission in UMTS Rel. 99
Logical Channels
ComTec 2005
Channel characteristics
DCH
Service Power control Soft handover Multicode operation Amount of data Bursty data Any Fast Yes No Large No Codespace reserved for theor. max. datarate
DSCH
Data Fast No Yes Large Yes High peak data rates but low activity
FACH
User data possible Slow No No Small Yes Mapped to same physical channel as PCH
Page 5
ComTec 2005
E b
Page 6
ComTec 2005
E b
Page 7
ComTec 2005
HSDPA concepts
Page 8
HARQ (FEC + ARQ) AMC (turbo coding, QPSK/16QAM) New HSDPA Channels New functionality in Node B
fast link adaptation, transmission combining
ComTec 2005
HSDPA concepts
Page 9
HARQ (FEC + ARQ) AMC (turbo coding, QPSK/16QAM) New HSDPA Channels New functionality in Node B
fast link adaptation, transmission combining
ComTec 2005
HSDPA concepts
Page 10
HARQ (FEC + ARQ) AMC (turbo coding, QPSK/16QAM) New HSDPA Channels New functionality in Node B
fast link adaptation, transmission combining
ComTec 2005
HSDPA concepts
Page 11
HARQ (FEC + ARQ) AMC (turbo coding, QPSK/16QAM) New HSDPA Channels New functionality in Node B
fast link adaptation, transmission combining
ComTec 2005
TTI: 2ms
Page 12
ComTec 2005
1 code
120 kbps 240 kbps 360 kbps
5 codes
600 kbps 1,2 Mbps 1,8 Mbps
15 codes
1,8 Mbps 3,6 Mbps 5,3 Mbps
Page 13
ComTec 2005
1 code
120 kbps 240 kbps 360 kbps
5 codes
600 kbps 1,2 Mbps 1,8 Mbps
15 codes
1,8 Mbps 3,6 Mbps 5,3 Mbps
Page 14
ComTec 2005
HSDPA concepts
Page 16
HARQ (FEC + ARQ) AMC (turbo coding, QPSK/16QAM) New HSDPA Channels New functionality in Node B
fast link adaptation, transmission combining
ComTec 2005
HSDPA concepts
Page 17
HARQ (FEC + ARQ) AMC (turbo coding, QPSK/16QAM) New HSDPA Channels New functionality in Node B
fast link adaptation, transmission combining
ComTec 2005
HSDPA concepts
Page 18
Measurement ofARQ) Channel quality (ACK/NACK, QoS,...) HARQ (FEC + Scheduling decisions AMC (turbo QPSK/16QAM) flow controlcoding, in Iub Fast scheduling New HSDPA Channels New functionality in Node B
Quelle: WCDMA for UMTS, Harri Holma and Antti Toskala [1]
Page 19 ComTec 2005
MAC-hs
New MAC sub layer allows for easier compatibility to previous specifications MAC-hs located in Node B
Handling of HARQ (fast retransmissions) RNC still retains Release 4 MAC functionalities
(from [1])
ComTec 2005
Fast scheduling
Scheduler prefers users with good conditions
Better performance than round-robin Gain due to multi-user diversity
(from [6])
ComTec 2005
HSDPA concepts
HARQ (FEC + ARQ) AMC (turbo coding, QPSK/16QAM) New HSDPA Channels New functionality in Node B UE constantly checks rel. power level (DSCH to pilot) no fast power control
ComTec 2005
Page 22
HSDPA concepts
HARQ (FEC + ARQ) AMC (turbo coding, QPSK/16QAM) New HSDPA Channels New functionality in Node B UE constantly checks rel. power level (DSCH to pilot) no fast power control
ComTec 2005
Page 23
Summary
Page 24
ComTec 2005
Gliederung
HSDPA Concepts HSDPA Control Channels HSUPA SIR Scheduling
ComTec 2005
TTI: 2ms
Page 27
ComTec 2005
HS-SCCH - Downlink
TTI: 2ms -> 3 timeslots
1st Timeslot:
Demodulation information Codes to despread
2-3rd Timeslot:
CRC-Information HARQ Process info First transmission or retransmission?
Terminal specific masking SF 128 (40 bits per timeslot) rate convolutional coding (separate per part)
Page 28
ComTec 2005
Page 29
ComTec 2005
TTI: 2ms
Page 30
ComTec 2005
HS-DPCCH - Uplink
Two parts
1st part:
ACK/NACK for physical layer retransmissions
2nd part:
CQI Feedback
Page 31
ComTec 2005
Page 32
ComTec 2005
Gliederung
HSDPA Concepts HSDPA Control Channels HSUPA SIR Scheduling
ComTec 2005
HARQ
Node B asks UE to retransmit New Mac-e layer necessary Node B controlled HARQ Increased system capacity higher tolerable Error prob. of physical channel
ComTec 2005
NACK
ACK
Quelle: 8301253 Advanced Topics in Radio Network Planning, TUT ComTec 2005
Short TTI
2 ms or 10 ms ? (in discussion) delay reduction shortened RTT for HARQ increased throughput
ComTec 2005
Node B scheduling
TFCs from which UE chooses various scheduling schemes are in discussion
ComTec 2005
Data transmission
Quelle: 8301253 Advanced Topics in Radio Network Planning, TUT ComTec 2005
Data transmission
RLC ACK/NACK
Packet
L1 ACK/NACK Quelle: 8301253 Advanced Topics in Radio Network Planning, TUT ComTec 2005
Node B scheduling
TFCs from which UE chooses various scheduling schemes are in discussion
ComTec 2005
ComTec 2005
Summary
ComTec 2005
Gliederung
HSDPA Concepts HSDPA Control Channels HSUPA SIR Scheduling
ComTec 2005
Overview
The SIR-Scheduling Algorithm Definition of a scheduling problem How to improve the algorithm How to use with MxRRM
ComTec 2005
SIR-Scheduling Algorithm
PS scheduling algorithm Simple scheduling scheme:
Schedule packets with best SIR first
The algorithm in Literature Outperforms PF- and RR-Scheduler [2] Best overall PS-Throughput but unfair [3] Optimal when improved by QoS-awareness [5] SIR not optimal in worst case scenario [4]
Page 53 ComTec 2005
Variable Parameters
Power level E b Time
Page 54 ComTec 2005
Page 55
ComTec 2005
Variable Parameters
Powerlevel Datarate
E b
Time
Page 56 ComTec 2005
Page 57
ComTec 2005
A scheduling problem
| ci
< d i >
Page 58
ComTec 2005
Concrete modelling
min wi cij
i j
Page 59
ComTec 2005
Assertion:
The Algorithm that schedules the packet with the minimum first will solve the Optimization criteria in a optimum way.
di wi
di d j < wi w j
di
dj
dj
Page 60
di
ComTec 2005
Proof (continued )
di d j < wi w j
d iwi + (d i + d j ) w j > d j w j + (d j + d i ) wi
dj dj
di
ComTec 2005
Page 61
Conclusion
It is beneficial to schedule short packets first This is exactly what the SIR-Scheduler does
Page 62
ComTec 2005
Page 63
ComTec 2005
Variable Parameters
Powerlevel Eb Datarate
Channel coding Channel modulation
Page 65
ComTec 2005
Page 66
ComTec 2005
Page 67
ComTec 2005
Summary
We have introduced a fast and popular packet scheduling algorithm Including the algorithm into the simulator will hopefully improve system performance We have even learned a way to further improve the algorithm
Page 68
ComTec 2005
Literature
[1] Harry Holma and Antti Toskala; WCDMA for UMTS, volume 2. John Wiley and Sons, 2002. [2] H. van den Berg, R. Litjens and J. Lavermann; HSDPA Flow Level Performance: The impact of Key System and Traffic Aspects, Hans van den Berg, Remco Litjens, Joost Lavermann, MSWiM04 [3] 3GPP TR 25.848 v4.0.0; Physical layer aspects of UTRA High Speed Downlink Packet Access (Release 4) [4] Sem Borst; User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks, IEEE INFOCOM 2003 [5] M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar and P. Whiting, CDMA Data QoS Scheduling on the Forward Link with Variable Channel Conditions, Bell Laboratories, Lucent Technologies [6] Whitepaper WCDMA evolved, the first step - HSDPA, Ericsson, 284 23-2958 Uen Rev A, May 2004 [7] 3GPP TR 25.896 v6.0.0; Feasibility Study for Enhanced Uplink for UTRA FDD (Release 6)
Page 69 ComTec 2005