EE360: Lecture 7 Outline

Adaptive Cellular Systems

Announcements
Project comments later today, revision due
Monday 5pm
Paper summary due Feb. 5 (1/13 handout, also on
web)
HW posted this week, due Feb. 12.

Adaptive resource allocation in cellular
Power control
Adaptive OFDM
Adaptive CDMA
8C32810.43-Cimini-7/98
Review of Last Lecture
Design considerations: Spectral sharing, reuse, cell size,
resource allocation, cooperation.
Evolution: 1G to 2G to 3G to 4G and beyond
Cellular system capacity and area spectral efficiency
Improving capacity via interference reduction and MIMO
Dynamic Resource Allocation
Allocate resources as user and network conditions change
Resources:
Channels
Bandwidth
Power
Rate
Base stations
Access

Optimization criteria
Minimize blocking (voice only systems)
Maximize number of users (multiple classes)
Maximize revenue: utility function
Subject to some minimum performance for each user

BASE
STATION
Dynamic Channel Allocation
Fixed channel assignments are inefficient
Channels in unpopulated cells underutilized
Handoff calls frequently dropped

Channel Borrowing
A cell may borrow free channels from neighboring cells
Changes frequency reuse plan

Channel Reservations
Each cell reserves some channels for handoff calls
Increases blocking of new calls, but fewer dropped calls

Dynamic Channel Allocation
Rearrange calls to pack in as many users as possible without
violating reuse constraints
Very high complexity
DCA is a 2G/4G problem
Variable Rate and Power
Narrowband systems
Vary rate and power (and coding)
Optimal power control not obvious

CDMA systems
Vary rate and power (and coding)
Multiple methods to vary rate (VBR, MC, VC)
Optimal power control not obvious
Optimization criteria
Maximize throughput/capacity
Meet different user requirements (rate, SIR, delay, etc.)
Maximize revenue
Adaptive techniques for
multiuser OFDM
Different subcarriers assigned to different users
Orthogonal allocation: Multiuser OFDM
Semiorthogonal allocation: Multicarrier CDMA




The fading on each individual subchannel is
independent from user to user

Adaptive resource allocation gives each their best
subchannels and adapts optimally to these channels

Multiple antennas reduces interference when multiple
users are assigned the same subchannels
f
0
f
N
Adaptive Resource Allocation
Orthogonal Subcarrier Allocation
Degrees of freedom
Subcarrier allocation
Power
Rate
Coding
BER
Optimization goals (subject to power constraint):
Maximize the sum of average user rates
Find all possible average rate vectors (capacity region)
Find average rate vectors with minimum rate constraints
Minimize power for some average rate vector

Minimize outage probability for some constant rate
vector.
Power Control
Originally used to compensate for near-far
problem or achieve certain SINR targets
Challenging to make algorithm distributed

Meeting SINR targets may not be possible
Then should combine with access control

In 3G and 4G systems, power control
typically combined with other adaptation
Often formulated as an optimization problem
Rarely get closed-form solutions
Mehmets
presentation
Adaptive Subcarrier, Bit,
and Power Allocation*
*Wong, et al, JSAC, Oct. 1999
Formulated as an optimization problem
K users, N subbands
R
k
bits per OFDM symbol for kth user
c
k,n
bits assigned by kth user to nth subband
c
k,n
e D = {0, 1, 2, , M}
if c
kn
= 0, c
kn
= 0 for all k = k
f
k
(c) is SNR required for c bits/symbol

2
,
,
,
) (
n k
n k k
n k
c f
P
o
=
2
,
,
n k
o
channel gain
Problem formulation
Minimize required power with bit allocation


Reformulate problem to be convex:
r
k,n
represents user ks rate in subcarrier n,

k,n
represents time-sharing factor:

= =
e
=
N
n
K
k
n k k
n k
c
T
c f P
n k
1 1
,
2
,
*
) (
1
min
,
o
D
C1: For all k e {1, , K},

=
=
N
n
n k k
c R
1
,

= =
e
e
=
N
n
K
k
n k
n k
k
n k
n k
M r
T
r
f P
n k
n k n k
1 1
,
,
2
,
,
] 1 , 0 [
] , 0 [
*
) ( min
,
, ,
o

=
=
N
n
n k k
r R
1
,

=
=
N
n
n k
1
,
1
subject to:
and
Solve via Lagrangian


= =
= = = =
|
.
|

\
|

|
.
|

\
|

|
|
.
|

\
|
=
N
n
K
k
n k n
K
k n
k n k k
N
n
K
k
n k
n k
k
n k
n k
R r
r
f L
1 1
,
1
1
1
,
1 1
,
,
2
,
,
1 |

Obtain a closed-form soln.

Optimal allocation depends on channel and required rate
Guaranteed solution when total data rate is less than MN.
( )
2
, ,
1 ' *
,
*
, n k k q k n k n k
f r o

=
( )
( )
( )
( )
( )

>
< <
<
=

M f
M f
M f
f
f
n k k k
n k
k
n k k k k
n k k k
n k
k
k q
2
,
1 '
2
,
'
2
,
1 '
2
,
1 '
2
,
'
,
0
0
0
o
o
o
o
o

( )
( )

>
<
=
n k n k n
n k n k n
n k
H
H
, ,
, , *
,
1
0
|
|

( ) ( ) ( ) ( ) | |
2
,
1 ' 2
,
2
,
1 '
2
,
,
1
n k k n k n k k k
n k
n k
f f f H o o o
o

=
Adaptive solution
Increase Lagrangian multipliers iteratively until all
users rate constraints are satisfied.

Modified problem
Generate solution using single user bit allocation
among assigned subcarriers.

P
T
s P
T
*
s P
T

Difference between final (suboptimal) & modified
solutions gives performance upper bound
SNR gains
Outage Probability Reduction
Summary of Adaptive OFDM
Good to exploit multiuser diversity
May beat out CDMA techniques

Perfect channel estimation is not practical

Adaptive solution is guaranteed to
converge, but no iteration limit is given.
Multiuser OFDM with
Multiple Antennas

MIMO greatly increases channel capacity

Multiple antennas also used for spatial multiple access:
Users separated by spatial signatures (versus CDMA time signatures)
Spatial signatures are typically not orthogonal
May require interference reduction (MUD, cancellation, etc.)

Methods of spatial multiple access
Singular value decomposition
Space-time equalization
Beamsteering

Use similar optimization formulation for resource allocation
Spatial Multiuser Access OFDM With Antenna Diversity and Power Control
J. Kim and J. Cioffi, VTC 2000
Resulting Power Control Algorithm
Waterfill for all K users if:
Perfect interference cancellation, or
BER constraint is satisfied

When interference kicks in:
Do not assign further energy, instead, use it
on other channels.
Performance Results
Pe < 0.01 on all active
subchannels
Comparison to Other Methods:
Has path diversity versus beamforming
Space Time Equalizer:
W(f) = [H*(f)H(f)]
-1
H*(f)
Noise enhancement when signal fades
Since channel gain (A) not present in SVD,
channel model updates less frequently, and is
less prone to channel estimation errors
SVD less prone to near/far because of spatial
isolation.
Summary of OFDM/MIMO
OFDM compensates for ISI
Flat fading can be exploited
One spatial mode per user per frequency
Receiver spatially separates multiple users
on a frequency
Traditional detection methods used
Power control similar to other systems


Multicarrier CDMA
Multicarrier CDMA combines OFDM and CDMA
Idea is to use DSSS to spread a narrowband signal
and then send each chip over a different subcarrier
DSSS time operations converted to frequency domain
Greatly reduces complexity of SS system
FFT/IFFT replace synchronization and despreading
More spectrally efficient than CDMA due to the
overlapped subcarriers in OFDM
Multiple users assigned different spreading codes
Similar interference properties as in CDMA
Optimize power and rate adaptation
in a CDMA system
Goal is to minimize transmit power

Each user has a required QoS
Required effective data rate
Rate and Power Control in CDMA
*
*Simultaneous Rate and Power Control in Multirate
Multimedia CDMA Systems, S. Kandukuri and S. Boyd
System Model: General
Single cell CDMA
Uplink multiple access channel
Different channel gains
System supports multiple rates

System Model:
Parameters
Parameters
N = number of mobiles
P
i
= power transmitted by mobile i
R
i
= raw data rate of mobile i
W = spread bandwidth
QoS requirement of mobile i, _
i
, is
the effective data rate

) 1 (
ei i i
P R =
System Model: Interference
Interference between users represented
by cross correlations between codes, C
ij

Gain of path between mobile i and base
station, L
i

Total interfering effect of mobile j on
mobile i, G
ij
is


ij i ij
C L G =
SIR Model (neglect noise)

=
+
=
i j
j ij
i ii
i
P G
P G
SIR
q
i
i
i
o
b
i
R
W SIR
I
E
=
|
|
.
|

\
|
= |
QoS Formula
Probability of error is a function of |
I

Formula depends on the modulation scheme
Simplified P
e
expression

QoS formula



i
ei
c
P
|
1
=
|
|
.
|

\
|
|
|
.
|

\
|
=
i
i
e i i
R
W SIR
P R 1
Solution
Objective: Minimize sum of mobile powers
subject to QoS requirements of all mobiles
Technique: Geometric programming
A non-convex optimization problem is cast as a
convex optimization problem
Convex optimization
Objective and constraints are all convex
Can obtain a global optimum or a proof that the
set of specifications is infeasible
Efficient implementation


Problem Formulation
Minimize 1
T
P (sum of powers)
Subject to



Can also add constraints such as
i
i
i
e i
R
W SIR
P R >
|
|
.
|

\
|
|
|
.
|

\
|
1
thresh i
R R s
0 P
min
P P
i
>
max
P P
i
s
Results
Sum of powers transmitted vs interference
Results
QoS vs. interference
Summary of adaptive CDMA
For optimization objective and given
constraints, an efficient solution exists

Not practical: centralized and complex

Is minimizing total power a good metric?

Optimization often applied to the problem
that can be solved
Rather than the problem that should be solved

Overall Summary
Multiuser OFDM assigns different subcarriers to different
users
Orthogonal subcarrier assignment prevents interference
between users
Subcarriers can be optimally assigned
Adaptive modulation on each subcarrier can be used
Orthogonality may be compromised in practice
Multiuser techniques like antenna array processing are
compromised due to ISI
OFDM used in these systems to remove ISI

MC-CDMA translates time operations to frequency
domain
Reduces complexity and increases spectral efficiency
Not used much in practice