Enhanced Uplink Dedicated Channel (EDCH) High Speed Uplink Packet Access (HSUPA)

EDCH Background & Basics Channels/ UTRAN Architecture Principles: Hybrid ARQ, scheduling, soft handover RRM: Handover, Resource Allocation Performance Results

Background
E-DCH E DCH is a Rel-6 feature with following targets Rel 6 Improve coverage and throughput, and reduce delay of the uplink dedicated transport channels Priority given to services such as streaming, interactive and background services, conversational (e.g. VoIP) also to be considered Full mobility support with optimizing for low/ medium speed Simple implementation Special focus on co-working with HSDPA Standardization started in September 2002 Study item completed in February 2004 Stage II/ III started in September/ December 2004 Release 6 frozen in December 2005/ March 2006 Various improvements have been introduced in Rel-7 & Rel-8 p

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

E-DCH Basics
HSDPA in the downlink !!
E-DCH E DCH is a modification of DCH Not a shared channel, such as channel

PHY taken from R99 Turbo coding and BPSK modulation Power Control 10 msec/ 2 msec TTI / Spreading on separate OVSF code, i.e. code mux with existing PHY channels MAC similarities to HSDPA Fast scheduling Stop and Wait HARQ: but synchronous New principles p p Intra Node B softer and Inter Node B soft HO should be supported for the E-DCH with HARQ Scheduling distributed between UE and NodeB

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

E-DCH Scheduling

UE
Scheduling information UE detects data in buffer Scheduling grant

NodeB
Scheduler takes UE for scheduling

DATA
Scheduling grant

UE sends scheduling information MAC-e MAC e signaling On E-DPCCH: happy bit NodeB allocates the resources Absolute/ l ti Ab l t / relative scheduling grants h d li t Algorithms left open from standards Depending on the received grants, UE decides on transmission Maintains allocated resources by means of internal serving grants ll d b f l Selects at each TTI amount of E-DCH data to transmit Algorithms fully specified by UMTS standard
Scheduling information Scheduling grant

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

E-DCH Scheduling Principle

UL Load

UL Load target
UE #m

Serving S i E-DCH users

UE #1

Non-serving E-DCH users

Non E-DCH

E-DCH scheduler constraint Keep UL load within the limit Scheduler controls: E-DCH load portion from nonserving users of other cells E-DCH resources from each serving user of own cell Non E-DCH load portion E DCH DCH, RACH, HS-DPCCH May include non-scheduled E-DCH Controlled by legacy load control, y g y , e.g. Admission/ Congestion control Notes: E-DCH users transmit asynchronously h l Each UE owns whole code tree

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

UMTS Channels with E-DCH

Cell C ll 1 = Serving E-DCH cell

Cell C ll 2 UE

Rel-6 E-DCH (in SHO)

UL PS service (DTCH) UL Signalling (DCCH)

R99 DCH (in SHO) UL/DL signalling (DCCH) UL/DL CS voice/ data Rel-5 HS-DSCH (not shown) DL PS service (DTCH) DL signalling (Rel-6, DCCH) (Rel 6
WS 2008 6

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

E-DCH Channels
E-DPDCH E DPDCH Carries the data traffic Variable SF = 256 2 UE supports up to 4 E-DPDCH E-DPCCH Contains the configuration as used on E DPDCH E-DPDCH Fixed SF = 256 E-RGCH/ E-HICH E RGCH/ E HICH E-HICH carries the HARQ acknowledgements E-RGCH carries the relative scheduling grants gg Fixed SF = 128 Up to 40 users multiplexed onto the same channel by using specific signatures E-AGCH Carries the absolute scheduling grants Fixed SF = 256 d
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim WS 2008 7

Timing Relation (UL)

Downlink DPCH

CFN

CFN+1

15 Tslot (10 msec) Uplink DPCCH p 0.4 Tslot (1024 chips) 148chips CFN

E-DPDCH/ E-DPCCH E DPCCH

10 msec TTI 2msec TTI Subframe #0 3 Tslot (2 msec) Subframe #1

10 msec Subframe #2 Subframe #3 Subframe #4

E-DPDCH/ E-DPCCH time-aligned to UL DPCCH

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

HSUPA UE Categories
E-DCH Category Category 1 Category 2 Category 3 Category 4 Category 5 Category 6 Category 7 (Rel.7) (Rel 7) Max. num. Codes 1 2 2 2 2 4 4 Min SF SF4 SF4 SF4 SF2 SF2 SF2 SF2 EDCH TTI 10 msec 10 msec/ 2 msec 10 msec 10 msec/ 2 msec 10 msec 10 msec/ 2 msec 10 msec/ 2 msec Maximum MAC-e TB size 7110 14484/ 2798 14484 20000/ 5772 20000 20000/ 11484 20000/ 22996 Theoretical maximum PHY data rate (Mbit/s) 0.71 1.45/ 1.4 1.45 2.0/ 2.89 2 89 2.0 2.0/ 2 0/ 5.74 2.0/ 11.5 11 5

When 4 codes are transmitted, 2 codes are transmitted with SF2 and 2 with SF4 , UE Category 7 supports 16QAM
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim WS 2008 9

E-DCH UTRAN Architecture

Evolution from Rel-5 E-DCH functionality is intended for transport of dedicated logical channels (DTCH/ DCCH) E-DCH in Rel-6 Additions in RRC to configure E-DCH RLC unchanged (UM & AM) New MAC-es entity with link to MAC-d New MAC-e entity located in the Node B MAC-e entities from multiple NodeB may serve one UE ( ft HO) (soft

SRNC

RRC RLC

PDCP

Logical Channels

DCCH DTCH

BCCH

MAC-es
MAC-d flows MAC-d flows

MAC-d
DCH

w/o MAC-c/sh o

CRNC

Upper phy

MAC-c/sh

NodeB
MAC-e
Transport Channels
EDCH

MAC-hs
HS-DSCH DSCH FACH

MAC-b
BCH

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

10

MAC-e/es in UE

To MAC-d MAC-es/e
E-TFC Selection Multiplexing

MAC Control

MAC-e/es Functions Priority handling Per logical channel Multiplexing MAC-d flow concept Mux of data from multiple MAC-d flows into single MAC-e PDU Scheduling Maintain scheduling grant E-TFC selection HARQ handling

HARQ

Associated Scheduling Downlink Signalling (E-AGCH / E-RGCH(s)) UL data (E-DPDCH)

Associated ACK/NACK signaling (E-HICH)

Associated Uplink Signalling: E-TFCI, RSN, happy bit (E-DPCCH)

Cf. 25.309
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim WS 2008 11

MAC-e in NodeB

MAC-d Flows

UE #N UE #2
MAC Control

UE #1
E-DCH De-multiplexing

Control
E-DCH Scheduling

MAC-e Functions Per user HARQ handling: ACK/ NACK generation De-multiplexing E-DCH E DCH control: t l Rx/ Tx control signals E-DCH scheduling for all users Assign resources (scheduling grants)
E-DCH

HARQ entity

MAC-e

Cf. 25.309
UMTS Networks

Common RG

Associated Uplink Signalling

Associated Downlink Signalling

Iub overload control

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

12

MAC-es in SRNC

To MAC-d

MAC-es Functions
MAC-es

Queue distribution
Disassembly Disassembly MAC C t l Control

Disassembly

Reordering
Reordering/ Co b Combining g Reordering/ Co b Combining g Reordering/ Co b Combining g

Per logical channel In-sequence delivery Macro-diversity combining: g frame selection Disassembly

Reordering Queue Distribution

Reordering Queue Distribution

MAC-d flow #1

MAC-d flow #n

Cf. 25.309
UMTS Networks

From MAC-e in NodeB #1

From MAC-e in NodeB #k

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

13

Data Flow through Layer 2

RLC MAC-d

RLC PDU:

Header

DATA

DDI: Data Description Indicator (6bit) MAC-d PDU size Log. Channel ID Mac-d flow ID N: Number f MAC-d PDU N N b of MAC d PDUs (6bit)

MAC d MAC-d PDU:

DATA

MAC-e/es

MAC-es PDU:

TSN

DATA

DATA

DDI

DDI

DDI

DATA MAC-es PDU

DATA

Padding (Opt)

MAC-e header

TSN: Transmission Sequence Number (6bit)

MAC-e PDU:

PHY

DATA

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

14

Hybrid ARQ Operation

N-channel parallel HARQ with stop-and-wait protocol Number of HARQ processes N to allow uninterrupted E-DCH transmission 10 msec TTI: 4 2 msec TTI: 8 Synchronous retransmissions y Retransmission of a MAC-e PDU follows its previous HARQ (re)transmission after N TTI = 1 RTT Incremental Redundancy via rate matching Max. # HARQ retransmissions specified in HARQ profile

ACK NACK ACK NACK

New Tx 1 New Tx 2 New Tx 3 New Tx 4

Re-Tx 1

New Tx 2

Re-Tx 3

New Tx 4

Re-Tx 1

Re-Tx 2

NACK NACK

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

15

E-DCH UE Scheduling
UE maintains internal serving grant SG SG are quantized Maximum E-DPDCH/ DPCCH power ratio (TPR), which are defined by 3GPP Reception of absolute grant: SG = AG No transmission: SG = Zero_Grant Reception of relative grants: increment/ decrement index of SG in the SG p g / table AG and RG from serving RLS can be activated for specific HARQ processes for 2msec TTI sec UE selects E-TFC at each TTI Allocates the E-TFC according to the given restrictions Serving S i grant SG t UE transmit power Provides priority between the different logical channels

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

16

Scheduling Grant Table

Scheduling grants are max. E-DPDCH/ DPCCH power ratio (TPR traffic to il t ti ) t ffi t pilot ratio) Power Ratio is related to UE data rate Relative Grants SG moves up/ down when RG = UP/ DOWN Absolute Grants SG jumps to entry for AG 2 reserved values for ZERO_GRANT/ INACTIVE

Index 37 36 35 34 33 32 31 30 29

Scheduled Grant 2 (168/15) *6 2 (150/15) *6 2 (168/15) *4 2 (150/15) *4 2 (134/15) *4 2 (119/15) *4 2 (150/15) *2 2 (95/15) *4 2 (168/15)

14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
UMTS Networks

(30/15) 2 (27/15) 2 (24/15) 2 (21/15) 2 (19/15) 2 (17/15) 2 (15/15) 2 (13/15) 2 (12/15) 2 (11/15) 2 (9/15) 2 (8/15) 2 (7/15) 2 (6/15) 2 (5/15)

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

17

E-DCH Scheduling Options

Rate Scheduling
ra ate

Time Scheduling
ra ate

UE2 UE1 UE1 time UE2 UE3 UE1 UE3

time

UEs are continuously active Data rate is incremental increased/ decreased by relative scheduling grants No N synch b t h between UE required UEs i d Load variations can be kept low For low to medium data rates

UEs are switched on/ off by absolute scheduling grants UEs should be in synch Load L d variations might be large i ti i ht b l (verry) high data rates

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

18

Timing Relation for Scheduling Grants

Scheduling decision Load estimation, etc E-RGCH E-AGCH HARQ process number

E-DCH

AG applied to this HARQ process RG interpreted relative to the previous TTI in this HARQ process.

AG and RG associated with specific uplink E-DCH TTI, i.e. specific HARQ process Association based on the timing of the E-AGCH and E-RGCH. E AGCH E RGCH Timing is tight enough that this relationship is un-ambiguous. Example: 10msec TTI

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

19

Scheduling Information
Happy bit signaling One bit status flag send on E-DPCCH at each TTI Criterion for happy bit Set to unhappy if UE is able to send more data than given with existing serving grant Otherwise set to happy Oh i h Scheduling Information Reporting Content of MAC e report MAC-e Provides more detailed information (log. channel, buffer status, UE power headroom) Will be sent less frequently (e.g. every 100 msec) Parameters adjusted by RRC (e.g. reporting intervals, channels to report)

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

20

HSUPA Resource Allocation

Cell resources -Admissible uplink noise rise/load -CAC via RNC -Number AGCH/RGCH QoS parameters -Throughput bounds Throughput E-DCH Radio Resource Management E-RRM -Keep uplink load within the limit -Control E-DCH load portion from nonserving users of other cells -Control E-DCH resources from each serving user of own cell -Satisfy QoS/ GoS requirements (Ranking PF/SW) -Maximize HSUPA cell throughput

Node B resources -decoding capability decoding -Iub bandwidth capacity Capabilities of the UEs -MAC-e PDU size limits MAC e -SF limits

Task: assigns Serving Grants (relative or absolute grants) in terms of a power offset to the current DPCCH power to the UEs in order to control the maximum data rate

Finally, the UE decides by itself on the used power ratio and the transport block size taking into account the restrictions sent by Node B

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

21

NodeB Scheduling Principle

UL Load

UL Load target
UE #m

E-DCH scheduler constraint Keep UL load within the limit Scheduler controls: E-DCH E DCH load portion of non-serving non serving users from other cells

Serving S i E-DCH users

UE #1

Non-serving E-DCH users

E-DCH resources of each serving user of own cell Principles: Rate vs. time scheduling Dedicated control for serving users Common control for non-serving users Note: Scheduler cannot exploit fast fading !

Non E-DCH

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

22

Non-scheduled Mode
Configured by the SRNC UE is allowed to send E-DCH data at any time Signaling overhead and scheduling delay are minimized Support of QoS traffic on E-DCH, e.g. VoIP & SRB Characteristics Resource given by SRNC:
Non-scheduled Grant = max. # of bits that can be included in a MAC-e PDU UTRAN can reserve HARQ processes for non-scheduled transmission

Non-scheduled transmissions defined per MAC-d flow

Multiple non-scheduled MAC-d flows may be configured in parallel One specific non-scheduled MAC-d flow can only transmit up to the nonscheduled grant configured for that MAC-d flow

Sc edu ed grants Scheduled g a ts will be co s de ed o top o non-scheduled considered on of o sc edu ed transmissions

Scheduled logical channels cannot use non-scheduled grant Non-scheduled Non scheduled logical channels cannot transmit data using Scheduling Grant

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

23

E-DCH Operation in Soft Handover

scheduling grant HARQ ACK/ NACK

scheduling grant HARQ ACK/ NACK

UE NodeB 1 NodeB 2

Macro-diversity Macro diversity operation on multiple NodeBs Softer handover combining in the same NodeB Soft handover combining in RNC (part of MAC-es) Independent MAC-e processing in both NodeBs I d d MAC i i b hN d B HARQ handling rule: if at least one NodeB tells ACK, then ACK Scheduling rule: relative grants DOWN from any NodeB have precedence d
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim WS 2008 24

Mobility Handling
The UE uses soft handover for associated DCH as well as for E DCH E-DCH Using existing triggers and procedures for the active set update (events 1A, 1B, 1C) E-DCH active set is equal or smaller than DCH active set
New event 1J: non-active E-DCH link becomes better than active one

The UE receives AG on E-AGCH from only one cell out of the E-DCH E AGCH E DCH active set (serving E-DCH cell) Rel-6: E-DCH and HSDPA serving cell must be the same Hard Handover, i change of serving E-DCH cell H dH d i.e. h f i E DCH ll Using RRC procedures, which maybe triggered by event 1D
Could be also combined with Active Set Update

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

25

Mobility Procedures

SRNC
MAC-es

SRNC
MAC-es

MAC-e NodeB

MAC-e NodeB

MAC-e NodeB

MAC-e NodeB

s
Serving E-DCH radio link

t
Serving S i E-DCH radio link

Inter-Node B serving E-DCH cell change within E-DCH active set Note: MAC e still established in both NodeBs ! MAC-e

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

26

E-DCH State Transitions

Reuse of the DCH state transition framework Move to Cell_FACH in case of decreased traffic amount Move back from Cell_FACH in case of increased traffic amount Transition to URA_PCH in case of inactivity Preferred combination: E-DCH/ HSDPA Transition to DCH In case of handover to cells not supporting E-DCH Service specific triggers

Cell DCH HSDPA/ EDCH

Cell DCH HSDPA/ DCH Cell FACH, URA_PCH,

Cell DCH DCH/ DCH

IDLE
UMTS Networks Andreas Mitschele-Thiel, Jens Mckenheim WS 2008 27

E-DCH RRM Principle

E-DCH resources controlled by UL load target Derived from RTWP target/ reference background noise NodeB internal load target E-DCH non-serving load portion Equivalent to target non nonserving E-DCH to total E-DCH power ratio NodeB schedules E-DCH users according to RNC settings di t tti Priority for non E-DCH traffic RNC still controls non E-DCH load portion By means of e.g. admission/ congestion control Based on either of the following To be derived from RTWP OR Measure of non-EDCH load

UL Load

UL Load target

Serving S i E-DCH users Non-serving E-DCH users

Non E-DCH load portion

Non E-DCH

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

28

E-DCH Performance & Capacity

E-DCH E DCH offers improved throughput due to HARQ gain Faster scheduling with tighter UL load control The additional PHY channels consume resources UL load: DPCCH, E-DPCCH DL power/ codes: E-HICH/ E-RGCH, E-AGCH

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

29

User Throughput vs. Aggregate Cell Throughput

10ms TTI, unlimited CE dec. rate 1200

2ms TTI, next release

36 cells network UMTS composite channel model FTP t ffi model (2 Mbyte traffic d l Mb t upload, 30 seconds thinking time)

1 2 3

#UEs/cell

1000 User Throughput [kbps]

800

4 5 6 7 8 9
1600

600

400

Maximum cell throughput M i ll th h t reached for about 78 UEs per cell

Cell throughput drops if #UEs increases further since the associated signaling channel consume UL resources too

200

10
0 200 400 600 800 1000 1200 1400 Aggregated Cell Throughput [kbps]

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

30

Single User Performance

Average user throughput ( C aye ) o d e e (RLC layer) for different channel profiles
1 UE in the network
3000 Avera User Throu ghput [kbps] age

2ms, 1Tx , 3500

10ms, 1Tx ,

1 target HARQ transmission g Q

2500

For AWGN channel conditions:

10ms TTI: up to 1.7 Mbps p p (near theoretical limit of 1.88 Mbps) 2ms TTI: up to 3 Mbps (below theoretical limit 5.44 (b l th ti l li it 5 44 Mbps) E.g. due to restrictions y (window from RLC layer ( size, PDU size)

2000

1500

1000

500

0 AW GN PedA3 PedA30 Scenario VehA30 VehA120

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

31

E-DCH Summary
New uplink transmission concept Optimized for interactive, background and streaming, support of conversational Full support of mobility with optimizing for low/ medium speed Improved PHY approach New UL transport channel: E-DCH p Additional signalling channels to support HARQ and E-DCH scheduling MAC-e/es entity located in NodeB/ SRNC Distributed E DCH scheduling between UE and NodeB E-DCH E-DCH supports soft/ softer HO Radio Resource Control procedures similar to HSDPA E-DCH Resource Management Cumulated resources managed by Controlling-RNC Re use Re-use of principles for DCH control (handover state transition) (handover, Significant improved performance

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

32

References
Papers A. Ghosh et al: Overview of Enhanced Uplink for 3GPP W-CDMA, Proc. IEEE VTC 04/ Milan, vol. 4, pp. 22612265 H. Holma et al: HSDPA/ HSUPA for UMTS, Wiley 2006 Standards TS 25.xxx series: RAN Aspects 25 xxx TR 25.896: Feasibility Study for Enhanced Uplink for UTRA FDD TR 25.808: FDD Enhanced Uplink; Physical Layer Aspects p ; y y p TR 25.309/ 25.319 (Rel.7 onwards): (FDD) Enhanced Uplink: Overall Description (Stage 2)

UMTS Networks

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

33

Abbreviations
ACK AG AM AMC BO CAC CDMA DBC DCH DDI DPCCH E AGCH E-AGCH E-DCH E-HICH Indicator E-RGCH E-TFC FDD FEC FIFO FP GoS HARQ IE MAC-d MAC d MAC-e/es
UMTS Networks

(positive) Acknowledgement Absolute Grant Acknowledged (RLC) Mode Adaptive Modulation & Coding Buffer Occupancy Call Admission Control Code Division Multiple Access Dynamic Bearer Control Dedicated Channel Data Description Indicator Dedicated Physical Control Channel E DCH E-DCH Absolute Grant Channel Enhanced (uplink) Dedicated Channel E-DCH HARQ Acknowledgement Channel E-DCH Relative Grant Channel E-DCH Transport Format Combination Frequency Division Duplex Forward Error Correction First In First Out Framing Protocol F i P t l Grade of Service Hybrid Automatic Repeat Request Information Element dedicated Medium Access Control E-DCH Medium Access Control

Mux NACK NBAP OVSF PDU PHY PO Qo QoS QPSK RB RG RL RLC RLS RRC RRM RV SDU SF SG SI TNL TPR TTI UM

Multiplexing Negative Acknowledgement NodeB Application Part Orthogonal Variable SF (code) Protocol Data Unit Physical Layer Power Offset Qua y o Quality of Service Quadrature Phase Shift Keying Radio Bearer Relative Grant Radio Link Radio Link Control Radio Link Set Radio Resource Control Radio Resource Management Redundancy Version Service Data Unit Spreading Factor Serving Grant Scheduling Information Transport Network Layer Traffic to Pilot Ratio Transmission Time Interval Unacknowledged (RLC) Mode U k l d d M d

Andreas Mitschele-Thiel, Jens Mckenheim

WS 2008

34