QoS Aware Adaptive

Subcarrier Allocation
in OFDMA Systems
Mustafa Ergen & Sinem Coleri
{ergen,csinem}@eecs.berkeley.edu
University of California Berkeley
Introduction
Motivation
Orthogonal Frequency Division Multiple Access(OFDMA)
OFDMA System
Resource Allocation Problem
Algorithms
Optimal
Suboptimal
Simulation
Conclusion

Motivation
Broadband Wireless Access
Ex: IEEE 802.16, Wireless MAN
OFDM
Eliminates InterSymbol Interference
OFDMA





OFDM Diagram
Multiuser OFDM


OFDM-TDMA
OFDM-FDMA
OFDMA
User 1
User 2
User 3
Subcarrier
Time
OFDM-TDMA
Subcarrier
Time
OFDM-FDMA
Subcarrier
Time
OFDMA


Resource Allocation

Goals:
Dynamic subcarrier selection
Improve system performance with adaptive
modulation
More bits transmitted in large channel gain carriers
Provide QoS
Rate and BER
Resource Allocation

Assumptions:
Base station knows
the channel
Base station informs
the mobiles for
allocation

Base
Station
System
Application
Network
Resource Allocation
Physical Layer
rQoS=[rR,rBER] oQoS=[oR,oBER,oCoS]
oCoS=Ptotal for downlink
oCoS=Pu for uplink
[User x Subcarrier]
OFDMA
AWGN
w(n)
Adaptive Modulation
IDFT
Guard
Insertion
P/S
Channel
+
S/P
Guard
Removal
DFT
Adaptive Demodulation
X(k)
Y(k)
x(n)
y(n)
h(n)
x
f
(n)
y
f
(n)
Path
Loss
Channel Information
from
user k
Resouce Allocation Module
Subcarrier
allocation
with
Different
Modulation
Subcarrier
Extraction
for
user
k
Adaptive Modulation
Adaptive Modulation
User 1 (Rate R1, BER1)
User 2 (Rate R2, BER2)
User K (Rate RK, BERK)
Maximum Total
Power
.
.
.
.
.
.
.
.
.
.
.
User k Adaptive Demodulation
Adaptive Demodulation
Resource Allocation
64-QAM

16-QAM

4-QAM

Channel
Subcarrier
U
s
e
r

RATE: [12 6 6 8 ]
BER: [1e-2 1e-2 1e-4 1e-4]
QoS
Resource Allocation
Notation
) 1 2 ( )
4
(
3
) ( :
2
,
:
} ,..., 1 , 0 {
,
:
} ,..., 1 { :
} ,..., 1 { :
) (
:
2
1
2
,
,
,

=
e
e
e
=
c
n k
n k k c
n k
BER
Q
No
c f QAM M
n k
gain channel
M
n k
c bit assigned
N n subcarrier
K k user
c f
P Power Transmit
o
o
Optimal
Integer Programming

= =
= =
= = =
s s
=
e
K
k
M
c
c n k
c n k
N
n
M
c
n k k
c n k c n k
K
k
N
n
M
c n k
n k
n all f or and
k all f or c R to subject
f or
c f
c n k
1 1
, ,
, ,
1 1
,
, , , ,
1 1 1
2
,
,
. , 1 0
, .
} 1 , 0 {
) (
min
, ,

Subcarrier
U
s
e
r

Subcarrier
U
s
e
r

Subcarrier
U
s
e
r

Subcarrier
U
s
e
r

P
c2
P
c3
P
c1
Motivation for Sub-optimal
Algorithms

IP is complex
Allocation should be done within the
coherence time
Time increases exponentially with the
number of constraints


Current Suboptimal Algorithms
2-step:
Subcarrier Allocation
Assume the data rate for all subcarriers
Assume modulation rate is fixed
Assign the subcarriers
Bit Loading
Greedy approach to assign the bits of user

Current Suboptimal Algorithms
Subcarrier Allocation
Hungarian algorithm
Optimal, very complex
LP approximation to IP
problem
Close to optimal
Bit Loading
Subcarrier
U
s
e
r

Subcarrier
U
s
e
r

Subcarrier
U
s
e
r

). (
1
) ( min arg
: ,
, ,
, ,
, ,
n k n k
n k n k
n k n k
S n
k
c P evaluate
c c
c P n
times R f ollowing the repeat k each For
k
A
+ =
A =
e
Problems in Current Suboptimal
Algorithms

Subcarrier assignment and bit loading are
separated
Users with bad channels may need higher
number of subcarriers
Not iterative subcarrier assignment


Iterative Algorithm
Iterative algorithm based on
Assignment of bits according to highest
modulation
Finding the best places
Distributing the assigned bits to other
subcarriers or to non-assigned subcarriers
Exchanging the subcarriers among user
pairs for power reduction.


Iterative Algorithm
Fair Selection(FS)
Greedy Release(GR)
Horizontal Swaping(HS)
Vertical Swaping(VS)

Iterative Algorithm
FAIR
SELECTION

Ptotal<Pmax

GREEDY
RELEASE
Start
Modulation--

H
O
R
I
Z
O
N
T
A
L

S
W
A
P

V
E
R
T
I
C
A
L

S
W
A
P

ASSIGNMENT ITERATION
Simulation Environment
Build the OFDMA system
Modulations:4-QAM,16-QAM,64-QAM
Independent Rayleigh fading channel
to each user
Number of subcarriers =128
Nodes are perfectly synchronized



CDF of total transmit power
without Pmax constraint
CDF of total transmit power with
Pmax constraint
Average bit SNR vs. RMS delay
spread
As RMS delay spread increases, the fading variation increases
hence higher gains are obtained by adaptive allocation
Average bit SNR vs. number of
users
As the number of users increases, the probability of obtaining
good channel at a subcarrier increases
Instantaneous Average bit SNR
vs Time
Iterative Algorithm improves its Average Bit SNR by the time.
Conclusion
OFDMA
Broadband Wireless Access
Resource Allocation
Channel Information
QoS Requirement
Optimal Algorithms
complex
Iterative Algorithms