High Speed High-Speed Downlink Packet Access (HSDPA)

HSDPA Background & Basics Principles: Adaptive Modulation, Coding, HARQ Channels/ UTRAN Architecture Principles: Fast scheduling, Mobility Performance Results

Motivation (as of 2000)

Voice, low speed packet data

GSM/GPRS

No Multimedia, Limited QOS

Medium rate Packet data

UMTS Rel. 99

Theoretical 2 Mbps but ~384 kbps subjected to practical constraints

As the UMTS networks are rolled out, the demand for high bandwidth b d d h services is expected to grow rapidly. d dl By 2010, 66% of the revenues will come from data services (source: UMTS forum). Release 99/4 systems alone will not be capable to meet these demands. (Realistic outdoor data rates will be limited to 384kbps). 384kbps) A more spectral efficient way of using DL resources is required. Competition with CDMA 2000 1x EV-DO/DV p /
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 2

HSDPA Background
Initial goals Establish a more spectral efficient way of using DL resources providing data rates beyond 2 Mbit/s, (up to a maximum theoretical limit of 14.4 Mbps) Optimize interactive & background packet data traffic, support streaming service Design for low mobility environment, but not restricted Techniques compatible with advanced multi-antenna and receivers Standardization started in June 2000 Broad forum of companies Major f t M j feature of R l f Release 5 Enhancements in R7 HSPA+ Advanced transmission to increase data throughput Signaling enhancements to save resources

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

HSDPA Basics
Evolution from R99/ R4 5MHz BW Same spreading by OVSF and scrambling codes Turbo coding New concepts in R5 Adaptive modulation (QPSK vs. 16QAM), coding and multicodes (fixed SF = 16) Fast scheduling in NodeB (TTI = 2ms) Hybrid ARQ Enhancements in R7 HSPA+ Signaling enhancements 64QAM MIMO techniques, increase of the bandwidth

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

Higher Order Modulation

Standard modulation scheme in UMTS networks QPSK 2 bit per symbol With HSDPA, modulation can be switched between two schemes QPSK 2 bit per symbol 16-QAM 4 bit per symbol

Low bitrate robust

High bitrate Sensitive to disturbances

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

Key Principles
Adaptive Modulation and Coding (Mother Turbo code rate = 1/3) For wireless data, link adaptation through Rate Control is more effective then Power Control. Users in favorable channel conditions (based on Channel Quality indication) are assigned higher code rates and higher order modulation(16QAM). This means higher data rates = Reduced latency

But what about when channel is changing at high rate;

Can AMC guarantee reliability?

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

Hybrid ARQ No. In fast fading conditions, AMC alone is not enough.
H-ARQ t H ARQ automatically adapts to instantaneous channel conditions by: ti ll d t t i t t h l diti b fast retransmissions at physical layer adding redundancy only when needed

The retransmitted packets are combined with original packet to improve the decoding probability.
Simple form of Hybrid ARQ shows g g p significant gains over link adaptation alone. Different schemes can be used for retransmission of original data packet. Chase combining Incremental Redundancy

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

Fast Scheduling Fading is good in multiuser environment!!

Channels are uncorrelated Multi-user y diversity Assign the resources to the best user(s) in time to maximise throughput Gains increase with number of users Max C/I Proportional fair Round Robin

With HSDPA Scheduling function is moved from RNC to Node-B.

10
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 8

HS-DSCH Principle I
Channelization codes at a fixed spreading factor of SF = 16 Up to 15 codes in parallel

SF=2 SF=4 SF=8 C16 15 16,15 SF=16 Physical channels (codes) to which HS-DSCH is mapped C16 0 16,0 CPICH, etc.

OVSF channelization code tree allocated by CRNC HSDPA codes autonomously managed by NodeB MAC-hs scheduler Example: 12 consecutive codes reserved for HS DSCH starting at C16 4 HS-DSCH, C16,4 Additionally, HS-SCCH codes with SF = 128 (number equal to simult. UE)

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

HS-DSCH Principle II

Resource sharing in code as well as time domain: R h i i d ll ti d i Multi-code transmission, UE is assigned to multiple codes in the same TTI Multiple UEs may be assigned channelization codes in the same TTI
Code

Time (per TTI) Data to UE #1 Data to UE #2 Data to UE #3 not used

Example: 5 codes are reserved for HSDPA, 1 or 2 UEs are active within one TTI

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

10

UMTS Channels with HSDPA

Cell C ll 1 = Serving HS-DSCH cell

Cell C ll 2 UE

Rel-5 HS-DSCH
DL PS service S (Rel-6: DL DCCH)

R99 DCH (in SHO)

UL/DL signalling (DCCH) UL PS service UL/DL CS voice/ data

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

11

HSDPA Channels
HS-PDSCH HS PDSCH
Carries the data traffic Fixed SF = 16; up to 15 parallel channels QPSK: 480 kbps/code, 16QAM: 960 kbps/code

HS-SCCH
Signals the configuration to be used next: HS-PDSCH codes, modulation format, TB information Fixed SF = 128 Sent two slots (~1.3msec) in advance of HS-PDSCH

HS-DPCCH
Feedbacks ACK/NACK and channel quality information (CQI) Fixed SF = 256, code multiplexed to UL DPCCH Feedback F db k sent ~5msec after received data 5 f i dd

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

12

Timing Relations (DL)

Tslot (2560 chips) Downlink DPCH 3 Tslot (2 msec) HS-SCCH ch. code & mod TB size & HARQ Info HS-DSCH HS DSCH TTI = 3 Tslot (2 msec) ) HS-PDSCH HS-DSCH-control = 2 Tslot DATA

NodeB Tx view Fixed ti Fi d time offset b t ff t between th HS SCCH i f the HS-SCCH information and the start of th ti d th t t f the corresponding HS-DSCH TTI: HS-DSCH-control (2 Tslot= 1.33msec) HS-DSCH and associated DL DPCH not time-aligned

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

13

Timing Relations (UL)

Tslot (0 67 ms) (0.67 Uplink DPCCH 3 Tslot (2ms) HS-PDSCH DATA UEP = 7.5 Tslot (5ms) HS-DPCCH CQI A/N CQI A/N m 256 chips CQI A/N CQI 0-255 chips

A/N

UE Rx view Alignment to m 256 to preserve orthogonality to UL DPCCH HS-PDSCH and associated UL DPCH not time-aligned ( (but quasi synch) q y )

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

14

HSDPA Architecture

Evolution from R99/R4 HSDPA functionality is intended for transport of dedicated logical channels Takes into account the impact on R.99 networks

SRNC

RRC RLC

PDCP

Logical Channels

DCCH DTCH

BCCH

MAC-d
DCH

w/o MAC-c/sh o

HSDPA in R5 Additions in RRC to handle HSDPA RLC nearly unchanged (UM & AM) Modified MAC d with link to MAC-d MAC-hs entity New MAC-hs entity located in the Node B

CRNC

Upper phy

MAC-c/sh

NodeB
MAC-hs
Transport Channels
HS-DSCH DSCH FACH

MAC-b
BCH

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

15

MAC-hs in NodeB

MAC-d flows MAC-hs UE #2 UE #1

Priority Queue distribution

UE #N

Priority Queue

Priority Queue

Priority Queue

MAC Control

Scheduling

MAC-hs Functions Priority handling Flow Control To RNC To UE Scheduling Select which user/queue to transmit Assign TFRC & Tx power HARQ handling Service measurements e.g. HSDPA provided bitrate

HS-DSCH

TFRC: Transport Format and Resource Combination

UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 16

MAC-hs in UE

To MAC-d MAC-hs
Disassembly Reordering Disassembly Reordering

MAC-hs Functions
MAC Control

HARQ handling ACK/ NACK generation Reordering buffer handling Associated to priority queues Flow control per reordering buffer Memory can be shared with AM RLC

Re-ordering queue distribution

HARQ

HS-DSCH

Associated Downlink Signalling HS-SCCH

Associated U li k Si A i d Uplink Signalling lli HS-DPCCH

Disassembly unit

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

17

Data Flow through Layer 2

Higher Layer PDU

Higher Layer PDU

Higher Layer

Reassembly

RLC SDU

RLC SDU

Segmentation & Concatenation

RLC header

L2 RLC (non-transparent)
RLC

MAC-d SDU

header

MAC-d header

Transport Block (MAC-hs PDU)

MAC-d

header

MAC-d SDU L2 MAC-d (non-transparent) MAC-d PDU

MAC-d PDU

MAC-hs header

MAC-hs SDU

MAC-hs SDU L2 MAC-hs (non-transparent)

CRC

L1

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

18

Hybrid Automatic Repeat Request

HARQ is a stop-and-wait ARQ Up to 8 HARQ processes per UE Retransmissions are done at MAC h layer, i in the Node B R t i i d t MAC-hs l i.e. i th N d Triggered by NACKs sent on the HS-DPCCH The mother code is a R = 1/3 Turbo code Code rate adaptation done via rate matching, i.e. by puncturing and repeating bits of the encoded data Two types of retransmission Incremental Redundancy
Additional parity bits are sent when decoding errors occured Gain due to reducing the code rate

Chase Combining
The same bits are retransmitted when decoding errors occured Gain due to maximum ratio combining

HSDPA uses a mixture of both types

UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 19

HARQ Processes

RTTHARQ Data HS-PDSCH

ACK/NACK HS-DPCCH

HARQ is a simple stop-and-wait ARQ stop and wait Example RTTmin = 5 TTI Synchronous retransmissions (MAC hs decides on transmission) (MAC-hs UE support up to 8 HARQ processes (configured by NodeB) Min. number: to support continuous reception Max. number: limit of HARQ soft buffer Number of HARQ processes configured specifically for each UE category
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 20

HSDPA UE Categories

The specification allows some freedom to the UE vendors 12 different UE categories for HSDPA with different capabilities g p (Rel.5) The Th UE capabilities differ in biliti diff i Max. transport block size (data rate) Max. Max number of codes per HS-DSCH HS DSCH Modulation alphabet (QPSK only) Inter TTI distance (no decoding of HS-DSCH in each TTI) Soft buffer size The MAC hs scheduler needs to take these restrictions into account MAC-hs
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 21

HSDPA UE Physical Layer Capabilities

HS-DSCH Category Maximum number of HS-DSCH multi-codes m lti codes 5 5 5 5 5 5 10 10 15 15 5 5 Minimum interTTI interval Maximum MAC-hs TB size Total number of soft channel bits 19200 28800 28800 38400 57600 67200 115200 134400 172800 172800 14400 28800 Theoretical maximum data rate (Mbit/s) 1.2 1.2 1.8 1.8 3.6 3.6 7.2 7.2 10.1 14.0 0.9 09 1.8

Category 1 Category 2 Category 3 Category 4 Category 5 Category 6 Category 7 Category 8 g y Category 9 Category 10 Category 11* Category 12*

3 3 2 2 1 1 1 1 1 1 2 1

7298 7298 7298 7298 7298 7298 14411 14411 20251 27952 3630 3630

Note: UEs of Categories 11 and 12 support QPSK only

cf. TS 25.306
Nov. 2009 22

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Channel Quality Information (CQI)

Signalled to the Node B in UL each 2ms on HS-DPCCH Integer number from 0 to 30 corresponds to a Transport Format Resource Combination (TFRC) given by Modulation Number of channelisation codes Transport block size For the given conditions the BLER for this TFRC shall not exceed 10% Mapping defined in TS 25.214 for each UE category 25 214

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

23

CQI Mapping Table

CQI value 0 1

Transport Block Size N/A 137

Reference power Number of Modulation adjustment HS-PDSCH Out of range 1 QPSK 0

NIR

XRV

Tables specified in TS 25.214 25 214

28800

6 7 15 16 23 24 25 26 27 28 29 30

461 650

1 2

QPSK QPSK

0 0

Example for UE category 10

For each UE category Condition: BLER 10%

3319 3565

5 5

QPSK 16-QAM

0 0

9719 11418 14411 17237 21754 23370 24222 25558

7 8 10 12 15 15 15 15

16-QAM 16 QAM 16-QAM 16-QAM 16 QAM 16-QAM 16-QAM 16-QAM 16-QAM 16-QAM

0 0 0 0 0 0 0 0

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

24

HSDPA Fast Scheduling

3G (Rel.99) with dedicated channels 3G with high speed feedback/scheduling on shared channels

Note: No fast channel quality feedback

2 TTI @1.2M

2 TTI @76k

7 TTI @614k

1 TTI @1.2M

64k 64k 64k

CQI CQI C/I CQI

C/I C/I

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

25

Scheduler Inputs

QoS & Subscriber Profile User 1: Best effort, silver class User 2: High priority, platinum class

History How long had the user been waiting?

Traffic Model Morning Afternoon Evening Off peak

Feedback from UL (CQI, ACK/NACK)

Scheduler

UE capability

Buffer Status

Radio resources Power, OVSF codes

Scheduled Users & Packet Formation Strategy

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

26

Packet Formation Strategy

Scheduler Outputs

Selected User

Adaptive Transport Block size

Adaptive Coding or redundancy

Adaptive p Modulation (QPSK, 16 QAM)

# of OVSF codes

So that
QoS/GoS constraints are satisfied and Network throughput is maximized, while

Subject to constraints (standards restrictions and service requirements)

Maintain fairness across UE and t ffi streams M i t i f i UEs d traffic t
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 27

Classical Scheduling Disciplines

HSDPA scheduler runs every TTI (2 msec) h d l ) Round Robin: allocate the use s co secut e y ou d ob a ocate t e users consecutively

- Offers fair time allocation - One of the simplest solutions Disadvantage: - Low cell and user throughput
Best Effort scheduler: prefer the users with good channel conditions

Advantage:

- Highest system throughput and easy to implement Disadvantage: - Starvation to users with low C/I
Proportional Fairness: equalise the channel rate / throughput ratio P ti lF i li th h l t th h t ti

Advantage:

Advantage: - Higher throughput than Round Robin Disadvantage: - Does not use QoS information
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 28

Comparison of Schedulers

user perceived throughput

100% Round Robin 80% Per rcentage of user rs rece eiving throughp put
average throughput [k e kbps] 2500

aggregated cell throughput

Proportional Fair QoS aw are

2000

60%

1500

40%

1000

20%

500

0% 0 100 200 300 400 average throughput [kbps] 500 600

0 Round Robin Proportional Fair p Q QoS aw are

Simple Round Robin doesnt care about actual channel rate Proportional Fair offers higher cell throughput QoS aware algorithm offers significantly higher user perceived throughput than PF with similar cell throughput

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

29

Mobility Procedures I
HS-DSCH for a given UE belongs to only one of the radio links assigned to the UE (serving HS-DSCH cell) The UE uses soft handover for the uplink, the downlink DCCH and any simultaneous CS voice or data Using existing triggers and procedures for the active set update (events 1A, 1B, 1C) Hard handover for the HS-DSCH, i.e. Change of Serving HS-DSCH C ll within active set Ch f S i HS DSCH Cell i hi i Using RRC procedures, which are triggered by event 1D

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

30

Mobility Procedures II

CRNC

CRNC

Source HSDSCH Node B

MAC-hs NodeB NodeB NodeB

Target HSDSCH Node B

MAC-hs NodeB

s
Serving HS-DSCH radio link

t
Serving S i HS-DSCH radio link

Inter-Node B serving HS-DSCH cell change Note: MAC hs needs to be transferred to new NodeB ! MAC-hs
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 31

HS-DSCH Serving Cell Change

Measurement quantity CPICH 1

Hysteresis

CPICH 2

CPICH3

Time to trigger

Reporting event 1D

Time

Event 1D: change of best cell within the active set Hysteresis and time to trigger to avoid ping-pong (HS-DSCH: 12 dB, 0.5 sec)

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

32

Handover Procedure

UE

Target HS-DSCH cell

Source HS-DSCH cell

SRNC = DRNC Serving HS-DSCH cell change decision i.e. i e event 1D If new NodeB

RL Reconfiguration Prepare RL Reconfiguration Ready ALCAP Iub HS-DSCH Data Transport Bearer Setup RL Reconfiguration Prepare RL Reconfiguration Ready RL Reconfiguration Commit

Radio Bearer Reconfiguration Radio Bearer Reconfiguration Complete

RL Reconfiguration Commit

Synchronous Reconfiguration with Tactivation Reset MAChs entity

DATA
ALCAP Iub HS-DSCH Data Transport Bearer Release

Example: HS-DSCH h d h d E l HS DSCH hard handover (synchronized serving cell change) ( h i d i ll h )

UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 33

HSDPA Managed Resources

a) OVSF Code Tree

Border adjusted by CRNC

SF=2 SF=4 SF=8

C16 15 16,15
SF=16 Codes reserved for HS-PDSCH/ HS-SCCH b) Transmit Power Border adjusted by CRNC

C16 0 16,0
Codes available for DCH/ common channels

Tx power available for HS PDSCH/ HS SCCH HS-PDSCH/ HS-SCCH

Tx power available for DCH/ common channels

Note: CRNC assigns resources to Node B on a cell basis

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

34

Cell and User Throughput vs. Load

Load Impact
2500 Mean User Throughput Aggregated Cell Throughput

Throughp [kbit/sec put c]

2000

36 cells network UMTS composite channel model it h l d l FTP traffic model (2 Mbyte download, 30 sec thinking time) The user throughput is decreased when increasing load due to the reduced service time The cell throughput increases with t e load because o e a t the oad overall more bytes are transferred in the same time

1500

1000

500

0 4 6 8 10 12 14 16 18

Number of Users/ Cell

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

35

HSDPA Performance per Category

Cat 6 - Cat 8 Comparison p

2500 Mean User Throughput Peak User Throughput Aggregated Cell Throughput

36 cells network UMTS composite channel model it h l d l FTP traffic model (2 Mbyte download, 30 sec thinking time) Higher category offers higher max. throughput limit Cat.6: 3 6 Cat 6: 3.6 MBit/sec Cat.8: 7.2 MBit/sec Max. Max user perceived performance increased at low loading Cell performance slightly better

2000 throug ghput (kbps)

1500

1000

500

0 Cat 6/ 10 users Cat 8/ 10 users Cat 6/ 20 users Cat 8/ 20 users

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

36

Coverage Prediction with HSDPA

Example Scenario
15 users/cell / Pedestrian A channel model Plot generated with field g prediction tool

HSDPA Throughput depends on location

UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim Nov. 2009 37

HSDPA Summary
New downlink transmission concept Optimised for interactive & background, support of streaming Design for indoor & urban environment Improved PHY approach New DL transport channel: HS-DSCH Additional signalling channels to support fast adaptation Advanced architecture MAC-hs entity located in NodeB Radio R R di Resource Control procedures similar to DCH C l d i il HSDPA Resource Management Cell resources managed by Controlling-RNC g y g Re-use of principles for DCH control (handover, state transition) Significant improved performance

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

38

HSDPA References
Papers:
Arnab Das et al: Evolution of UMTS Toward High-Speed Downlink Packet Access, Bell Labs Technical Journal, vol. 7, no. 3, pp. 47 68, June 2003 A. Toskala et al: High-speed Downlink Packet Access, Chapter 12 in Holma/ Toskala: WCDMA for UMTS, Wiley 2007 T. Kolding et al: High Speed Downlink Packet Access: WCDMA Evolution, IEEE Veh. Techn. Society News, pp. 4 10, February 2003 H. H Holma et al: HSDPA/ HSUPA for UMTS Wiley 2006 HSDPA/ UMTS,

Standards TS 25.xxx series: RAN Aspects p TR 25.858 HSDPA PHY Aspects TR 25.308 HSDPA: UTRAN Overall Description (Stage 2) TR 25.877 Iub/Iur protocol aspects

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

Nov. 2009

39

Abbreviations
ACK ALCAP AM AMC CAC CDMA CQI DBC DCH DPCCH FDD FEC FIFO GoS HARQ H-RNTI HSDPA HS DPCCH HS-DPCCH HS-DSCH HS-PDSCH HS-SCCH (positive) Acknowledgement Access Link Control Application Protocol Acknowledged (RLC) Mode g ( ) Adaptive Modulation & Coding Call Admission Control Code Division Multiple Access Channel Quality Information Dynamic Bearer Control Dedicated Channel Dedicated Physical Control Channel Frequency Division Duplex Forward Error Correction First In First Out Grade of Service Hybrid Automatic Repeat Request HSDPA Radio Network Temporary Identifier High Speed Downlink Packet Access High Speed Dedicated Physical Control Channel High Speed Downlink Shared Channel High Speed Physical Downlink Shared Channel High Speed Signaling Control Channel IE MAC-d MAC-hs Mux NACK NBAP OVSF PDU PHY QoS QPSK RB RL RLC RRC RRM SDU SF TB TFRC TFRI TTI UM 16QAM Information Element dedicated Medium Access Control high-speed Medium Access Control Multiplexing Negative Acknowledgement NodeB Application Part Orthogonal Variable SF (code) Protocol Data Unit Physical Layer Quality of Service Quadrature Phase Shift Keying Radio Bearer Radio Link Radio Link Control Radio Resource Control Radio Resource Management Service Data Unit Spreading Factor Transport Block Transport F T t Format & R t Resource Combination TFRC Indicator Transmission Time Interval Unacknowledged (RLC) Mode 16 (state) Quadrature Amplitude Modulation
Nov. 2009 40

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim