You are on page 1of 10

3G Evolution

Chapter:

Outline
Introduction Link Adaption Scheduling Hybrid ARQ S Summary

7
Ruiyuan Tian

Scheduling, Scheduling, Link adaption and Hybrid ARQ


Department of Electrical and Information Technology p gy

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

Outline
Introduction Link Adaption Scheduling Hybrid ARQ S Summary

From Wikipedia, the free encyclopedia


Link adaption,
adaptive modulation and coding ( p g (AMC), modulation and coding ), g scheme (MCS) denote the matching of the modulation, coding and other signal and protocol p p parameters to the conditions on the radio link ( g the (e.g. pathloss, the interference due to signals coming from other transmitters, the sensitivity of the receiver, the available transmitter power margin, etc.) a rate adaptation algorithm that adapt MCS according to the quality of the radio channel, and thus the bit rate and robustness of data transmission

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

AMC

Link adaption

How to adapt to channels variation? p

MCS in 802.11n, by Meifang Zhu, MSc @ EIT


2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 5 2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 6

From Wikipedia, the free encyclopedia


Scheduling
in packet-switched computer networks, the notion of a scheduling p p , g algorithm is used as an alternative to first-come first served queuing of data packets in advanced packet radio wireless networks such as HSDPA, p , channel-dependent scheduling may be used to take advantage of favourable channel conditions to increase the throughput and system spectral efficiency

Scheduling
http://users.ece.utexas.edu/~rheath/research/ multihop/ofdm.php

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

From Wikipedia, the free encyclopedia


Hybrid ARQ Scheduling
automatic repeat-request (ARQ) ( automatic repeat-query) is an p q ( ) (or p q y) error control method for data transmission which uses acknowledgments and timeouts to achieve reliable data transmission over an unreliable service hybrid ARQ (HARQ) is a variation of the ARQ error control method. In standard ARQ, error-detection information bits are added to data to be transmitted (such as cyclic redundancy check, CRC). In Hybrid ARQ, forward error correction (FEC) bits are also added to the existing Error Detection (ED) bits (such as Reed-Solomon code or Turbo code)

How to manage the resource allocation? g

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

10

ARQ
http://www.ecst.csuchico.edu/~sim/547/Ol d547/notes/NOTE9_1.htm

Hybrid ARQ

How to request re-transmission smart? q

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

11

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

12

Motivation
Rapid varying radio channel
Time-variant: coherence time (Doppler spread) ( pp p ) Frequency-selective: coherence bandwidth (delay spread) Interference

Outline
Introduction Link Adaption Scheduling Hybrid ARQ S Summary

Exploit the channel variation prior to transmission


Link adaption
Set transmission parameters to handle radio channel variation

Channel-dependent scheduling
Efficient resource sharing among users

Handle the channel variation after transmission


Hybrid ARQ
Retransmission request of erroneously received data packets

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

13

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

14

Link Adaption (1)


Power control
Dynamically adjust the transmit p y y j power to compensate for the p varying radio channel condition Maintain a certain SNR at the receiver Constant data rate regardless of the channel variation

Link Adaption (2)


Rate control
Packet-data traffic: constant rate not a strong desire for constant g rate (as high rate as possible) Dynamically adjust the data rate to compensate for the varying radio channel condition Full constant transmit power (desirable in multiuser systems)

Desired for circuit-switched voice

By S. Parkvall
2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 15 2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband

By S. Parkvall
16

Link Adaption (3)


Rate control
Adaptive Modulation and Coding ( p g (AMC) scheme ) Good channel condition: Bandwidth limited
High-order modulation + high-rate coding

AMC+M

Poor channel condition: Power limited Poor


Low-order modulation + low-rate coding

In HSDPA link adaptation


QPSK for noisy channels and 16QAM for clearer channels 14 Mbps, on clear channels using 16-QAM and close to 1/1 coding rate. 2.4 Mbps, on noisy channels using QPSK and 1/3 coding rate (14 Mbps x 1/2 x 1/3 ) This adaptation is performed up to 500 times per second
2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 17 2009-04-02

Adaptive Modulation Coding and MIMO Scheme in IEEE802 11n Modulation, IEEE802.11n, by Meifang Zhu, MSc @ EIT
3G Evolution - HSPA and LTE for Mobile Broadband 18

Link Adaption (4)


Power control: constant rate
Desired for voice/video
Short-term rate variation not an issue with constant average data rate

Outline
Introduction Link Adaption Scheduling Hybrid ARQ S Summary

Inefficient use of transmit power

Rate control: constant (max) transmit power


Adaptive data rate Efficient use of transmit power Desired in multiuser systems to reduce variations in interference power

[Chung & Goldsmith, 2001] Little spectral efficiency is lost when the power or rate is constrained to be constant, with optimal adaption.

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

19

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

20

Scheduling
The allocation of the shared resources among the users at each time instant
Whom ? How ?

Downlink Scheduling (1)


Intra-cell (quasi) orthogonality
Combined TDM/FDM/CDM/SDM
TDM+CDM in HSDPA TDM+FDM in LTE

Joint function with link adaption Channel dependent Downlink scheduling


Centralized resource

No intra cell interference intra-cell

Assuming TDM-based DL with single user scheduled a time:


Maximized resource utilization, if, at each time instant, all resources assigned t th user with th b t i t t i d to the ith the best instantaneous channel condition h l diti Power control:
For a given rate, lowest possible TX power Inefficient use of TX power minimum interference

Uplink scheduling
Distributed resource

Rate control:
For a given TX power, highest rate Highest link utilization

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

21

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

22

Downlink Scheduling (2)


Channel-dependent scheduling
Max-C/I (Max rate) scheduler ( )
Schedule at the fading peaks

Downlink Scheduling (3)

k = arg max Ri
i

Round-robin scheduling
Regardless of channel conditions g Fair? same amount of the radio resources Unfair! service quality (more resources needed for poor channel) Simple but poor performance

Independently varying radio links


Multiuser diversity gain

High system throughput but not fair


Exploit fading rather than combat

Starve the poor channel user

By S. Parkvall
2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 23 2009-04-02

By S. Parkvall
3G Evolution - HSPA and LTE for Mobile Broadband 24

Downlink Scheduling (4)


Two-fold requirement
Take advantage of the fast channel variations g Ensure the same average user throughput

Downlink Scheduling (5)


LTE

Proportional-fair scheduler

R k = arg max i Ri i

channel-dependent scheduling in time and frequency domains p g q y

P Proportion b t ti between th i t t the instantaneous d t rate and th average data t d the data rate during a certain period High throughput and fairness

Schedule on fading peaks peaks, regardless of the absolute quality

By S. Parkvall
2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 25 2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband

By S. Parkvall
26

Uplink Scheduling (1)


Distributed resources Limited available TX power
Far user power limited small amount of bandwidth resource Close user bandwidth limited large amount of bandwidth

Uplink Scheduling (2)


Max-Rate
Highest capacity ( g g p y (neglecting p g power limitation) )

Greedy filling
Max-Rate + max tolerable interference level Diff Different user d t rates ( t t data t (no transmission f poor channel user) i i for h l )

Orthogonal multiple access (TDMA, FDMA)


Similar to the downlink case Limited TX power for the sake of inter-cell MA interference p

Proportional-fair
Compromise between Max-Rate and Greedy filling p y g Proportion between the instant and average rate

Non-orthogonal multiple access (CDMA)


Power control (Constant RX power, BER, data rate) Maximum tolerable interference level ( f (intra / inter) )

Round-robin
S Simple ( uplink channel knowledge required) (no ) Poor performance

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

27

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

28

On Channel State Information (CSI)


CSI
Needed at TX for link adaption and channel-dependent scheduling p p g

Traffic Behavior and Scheduling (1)


Load
Significant different p g performance of schedulers in high load system g y

Downlink
Pilot signal
e.g., C Correlation channel estimator l ti h l ti t

Traffic behavior
Significant impact on the trade-off between the service fairness and the system throughput

Measured channel conditions reported to BS


Outdated if high mobility

Scheduler
Round-robin (RR): fair, regardless of channel Max-Rate (Max-C/I): absolute best instantaneous channel Proportional-fair (PF): balanced compromise

Channel prediction
Additional complexity and constraint

Link adaption based on long-term average channel

Uplink
TDD: reciprocity HSPA: Chap 10 Chap. LTE: Chap. 17
2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 29

Traffic
Full buffer scenario: always data at BS for all terminals Bursty packet: e.g., web browsing
By S. Parkvall
2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 30

Traffic Behavior and Scheduling (2)

Outline
Introduction Link Adaption Scheduling
By S. Parkvall

Hybrid ARQ S Summary

RR: similar but poor performance MAX C/I: poor with full buffer; Improved with bursty buffer PF: robust and good performance
2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 31 2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 32

Hybrid ARQ (1)


Forward Error Correction (FEC)
Add redundancy for error correction y

Hybrid ARQ (2)


Hybrid ARQ with soft combining
Erroneously received p y packet stored in a buffer memory y Later combined with the retransmission Soft-combining improved performance

Automatic Repeat Request (ARQ)


Compatible with TCP behavior for packet data E Error-detecting code b C li R d d d t ti d by Cyclic Redundancy Ch k (CRC) Check CRC used as a checksum to detect errors
Division of polynomials in Galois field GF(2) remainder

No error? Positive acknowledgement (ACK) Error? Negative acknowledgement (NAK)

Hybrid ARQ
Combination of FEC and ARQ FEC: correct a subset of errors ARQ: if still error detected
2009-04-02 3G Evolution - HSPA and LTE for Mobile Broadband 33 2009-04-02

combining
3G Evolution - HSPA and LTE for Mobile Broadband

By S. Parkvall
34

Hybrid ARQ (3)


Hybrid ARQ with soft combining
Chase Combining g
Retransmission of the same set of data, i.e., additional repetition coding Maximum-ratio combining: (re-transmission diversity?) g Accumulated increasing SNR

Hybrid ARQ (4)


Hybrid ARQ with soft combining
Incremental Redundancy y
Multiple sets of the information Retransmission of a different set Combine to recover the same information

By S. Parkvall

By S. Parkvall

Constant coding rate

Varying (reducing) coding rate

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

35

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

36

Hybrid ARQ (5)


Hybrid ARQ with soft combining
Implicit link adaption p p
Instead of channel estimation, adapt to the channel based on results Additional redundancy added only when needed g Robust regardless of channels variation

Outline
Introduction Link Adaption Scheduling Hybrid ARQ S Summary

Drawbacks
Delay: unacceptable from the end-user QoS perspective

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

37

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

38

Chapter summary
Link adaption
AMC+M for rate control

3G Evolution
Chapter:

Channel-dependent scheduling
Exploit diversity vs QoS fairness

7
Ruiyuan Tian

Hybrid ARQ
Smart retransmission

Adapt to and Exploit


Variations in radio channel quality Variations in traffic pattern ff

Scheduling, Scheduling, Link adaption and Hybrid ARQ


By S. Parkvall

instead of combating them!

Department of Electrical and Information Technology p gy

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

39

2009-04-02

3G Evolution - HSPA and LTE for Mobile Broadband

40

You might also like