Chapter 3: Physical-Layer Transmission Techniques: Section 3.6

Outline
Introduction
Precoding
Scheduling (user selection)
Chapter 3: Physical-layer transmission techniques
Section 3.6: Space Division Multiple Access (SDMA)
Instructor: Nguyen Le Hung

Email: nlhung@dut.udn.vn; nnguyenlehung@yahoo.com
Department of Electronics & Telecommunications Engineering
Danang University of Technology, University of Danang
Mobile Communications - Chapter 3: Physical-layer transmissions Section 3.6: Space Division Multiple Access (SDMA) 1
Outline
Introduction
Precoding
1 Introduction
SDMA and OFDM
Multiuser transmission
2 Precoding
Precoding classification
An example of linear precoding
Power allocation in ZF precoding
Possible research problems
3 Scheduling (user selection)

Exhaustive selection
Greedy selection
Outline
Introduction SDMA and OFDM
Precoding Multiuser transmission
SDMA with OFDM

The integration of multi-antenna and OFDM techniques has
provided remarkable diversity and capacity gains in broadband
wireless communications.
In multiuser (MU) transmissions, the use of multiantenna array at
the base station (BS) enables simultaneous transmission of multiple
data streams to multiple users by exploiting spatial separations
among users.
AMS/UE1
AMS/UE2
AMS/UE
(b)
(a)
ABS/eNB
ABS/eNB
IFFT IFFT
SU-MIMO MU-MIMO
precoder precoder
Outline
Introduction SDMA and OFDM
Precoding Multiuser transmission
A simple example of multiuser (MU) transmission
Base Station
Antenna 1 h1,1
h1, 2 De-mod
y1
Channel
h1, M estimator
User 1
Antenna M
s1
h2,1
Modulation h2, 2
Coded bits De-mod

of user 1 h2, M y2
s2
Channel
estimator
Modulation
Coded bits
of user 2
User 2
𝑀
∑ 𝑀
∑ 𝑀
∑ 𝑀
∑
𝑦 1 = 𝑠1 ℎ1,𝑚 +𝑠2 ℎ1,𝑚 +𝑧1 , and 𝑦2 = 𝑠2 ℎ2,𝑚 +𝑠1 ℎ2,𝑚 +𝑧2
𝑚=1 𝑚=1 𝑚=1 𝑚=1
Outline Precoding classification
Introduction An example of linear precoding
Precoding Power allocation in ZF precoding
Scheduling (user selection) Possible research problems
Precoding classification
In the so-called space division multiple access (SDMA), multiuser
diversity is the primary factor that increases significantly the system
sum-rate (throughput).
As a result, an appropriate multiuser encoding technique (at the BS)
is indispensable to attain the considerable sum-rate gain in SDMA.
It is well-known that dirty paper coding (DPC) is an optimal
multiuser encoding strategy that achieves the capacity limit of MU
broadcast (BC) channels but at the cost of extremely high
computation burden as the number of users is large.
Recent studies have introduced several suboptimal multiuser
encoding techniques with lower complexity (relative to DPC) that
can be categorized into:
nonlinear precoding such as: vector perturbation, Tomlinson
Harashima techniques
linear precoding such as: minimum mean squared error (MMSE),
zero-forcing.
Multiuser transmission techniques
LTE (4G) system

Broadband communications
(high data rate and reliability)
Diversity
Multi- Signal
Time Space Freq.
user Space
Multipath channel
Modeling
g
Quasi-static Time-variant Random
CSI feedback Vector Grassmannian

BEMs AR quantization
Analog Digital
LBG
Scheduling Precoding
Exhaustive Random Greed or iterative Linear Non-linear Codebook-

search user selection search methods methods based ones
MMSE BD DPC THP VP PU2RC
An example of linear precoding

Base Station
Antenna 1 h1,1
X
h1, 2 De-mod
y1
w1,1 Channel
h1, M estimator
X
w1, 2
User 1
X
Antenna M
s1 w1, M
X
Modulation
h2,1
w2,1 h2, 2
Coded bits
of user 1
X
h2, M De-mod
w2, 2 y2
Channel
estimator
X
s2 w
2, M
Feedback link of User 2
Modulation channel state information (CSI)
Coded bits
of user 2
𝑀
∑ 𝑀
∑ 𝑀
∑ 𝑀
∑
𝑦1 = 𝑠1 𝑤1,𝑚 ℎ1,𝑚 +𝑠2 𝑤2,𝑚 ℎ1,𝑚 +𝑧1 , and 𝑦2 = 𝑠2 𝑤2,𝑚 ℎ2,𝑚 +𝑠1 𝑤1,𝑚 ℎ2,𝑚 +𝑧2
𝑚=1 𝑚=1 𝑚=1 𝑚=1
Inter-user interference
The received signals at user-𝑢 can be determined by
𝑀
∑ 𝑀
∑
𝑦 𝑢 = 𝑠𝑢 𝑤𝑢,𝑚 ℎ𝑢,𝑚 + 𝑠𝑢′ 𝑤𝑢′ ,𝑚 ℎ𝑢,𝑚 + 𝑧𝑢 , 𝑢, 𝑢′ ∈ {1, 2},
𝑚=1 𝑚=1
(1)
∑𝑀
where 𝑠𝑢′ 𝑚=1 𝑤𝑢′ ,𝑚 ℎ𝑢,𝑚 is called as inter-user interference
that would significantly degrade the performance of the system.
2
Precoding design is to find the weighting coefficients {𝑤𝑢,𝑚 }𝑢=1
that satisfy the following condition
𝑀
∑
𝑤𝑢′ ,𝑚 ℎ𝑢,𝑚 = 0 with 𝑢, 𝑢′ ∈ {1, 2} (2)
𝑚=1
∑𝑀
to eliminate the inter-user interference 𝑠′𝑢 𝑚=1 𝑤𝑢′ ,𝑚 ℎ𝑢,𝑚 .
The above technique is called as zero-forcing (ZF) precoding.
2
The problem of finding the weighting coefficients {𝑤𝑢,𝑚 }𝑢=1 can be
easily solved by expressing received signals in a vector form.
Zero forcing (ZF) precoding formulation

In the presence of two users, the previous equations become
⎡ ⎤
[ ] [ ] 𝑤1,1 𝑤2,1 [ ] [ ]
𝑦1 ℎ1,1 . . . ℎ1,𝑀 ⎢ . . ⎥ 𝑠1 𝑧1
= ⎣ . . .
. ⎦ 𝑠2 + 𝑧 2 .
𝑦2 ℎ2,1 . . . ℎ2,𝑀
𝑤1,𝑀 𝑤2,𝑀
In the presence of 𝑈 users, the received signal can be expressed by:
y = HWs + z, (3)
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
𝑦1 ℎ1,1 . . . ℎ1,𝑀 𝑠1
.. ⎥ ⎢ .. .. .. ⎢ .. ⎥
where y = ⎣ , H = , s =
⎢ ⎥
. ⎦ ⎣ . . . ⎦ ⎣ . ⎦
𝑦𝑈 ℎ𝑈,1 . . . ℎ𝑈,𝑀 𝑠𝑈
⎡ ⎤
𝑤1,1 . . . 𝑤𝑈,1
.. ..
W=⎣ ⎦ = [w1 , . . . , w𝑈 ] with
⎢ ⎥
. ... .
𝑤1,𝑀 . . . 𝑤𝑈,𝑀
w𝑢 = [𝑤𝑢,1 , . . . , 𝑤𝑢,𝑀 ]𝑇 , and z = [𝑧1 , . . . , 𝑧𝑈 ]𝑇 .
Zero-forcing precoding formulation (cont.)

To eliminate inter-user interference, precoding matrix W can be
determined by
)−1
W = H𝐻 HH𝐻 ≜ H†
(
(4)
so that
y = HWs + z = s + z. (5)
With precoding, the received signal can be written by
y = Hx + z, (6)
𝑇
where x = [𝑥1 , . . . , 𝑥𝑀 ] = Ws are the transmitted signals in a
vector form at 𝑀 antennas in the base station.
Under the power constraint of 𝑃max at the BS, one has
[ 𝑀 ]
∑ 2
∣𝑥𝑚 ∣ = 𝔼 ∥ x ∥2 ≤ 𝑃max ,
[ ]
𝔼 (7)
𝑚=1
Power allocation in ZF precoding

The power constraint (7) is equivalent to
𝑈
∑
𝜆𝑢 𝑃𝑢 ≤ 𝑃max . (8)
𝑢=1
[( )−1 ] √
where 𝜆𝑢 = HH𝐻 and 𝑠𝑢 = 𝑃𝑢 𝑠𝑢
𝑢,𝑢
After ZF precoding, the received signals at 𝑈 users are given by
⎡ ⎤ ⎡ √ ⎤ ⎡ ⎤
𝑦1 𝑃1 𝑠1 𝑧1
⎢ .. .. ⎥ ⎢ .. ⎥
y=⎣ . ⎦=⎣ ⎦+⎣ . ⎦ (9)
⎥ ⎢
√ .
𝑦𝑈 𝑃𝑈 𝑠𝑈 𝑧𝑈
Hence, the resultant sum-rate of the multiuser system is
𝑈
∑
𝐶= ∑𝑈 max log2 (1 + 𝑃𝑢 ) (bps/Hz) (10)
𝑃𝑢 : 𝑢=1 𝜆𝑢 𝑃𝑢 ≤𝑃max
𝑢=1
Power allocation in ZF precoding (cont.)

The optimal power allocation [𝑃𝑢 , 𝑢 ∈ {1, ..., 𝑈 }] in (10) can be
easily determined by the following waterfilling process
+
𝑃𝑢 = (𝜇/𝜆𝑢 − 1) (11)
where 𝑥+ denotes max(𝑥, 0), and the water level 𝜇 is chosen to

satisfy
∑𝑈
(𝜇 − 𝜆𝑢 )+ = 𝑃max . (12)
𝑢=1
Given a set of selected users Ω = {1, ..., 𝑈 }, the above precoding

process attempts to eliminate the inter-user interference and
maximize the system sum-rate.
The problem of how to perform user selection (finding the set
Ω = {1, ..., 𝑈 }) with a reasonable complexity for maximizing the
system sum-rate will be addressed in the next section.
Precoding in LTE downlink transmissions

Base Station (BS)
MQAM
mapper
Data bits Channel Layer OFDMA
Interleaver
of user N encoder mapper modulator
MQAM
mapper
Precoding
MQAM
mapper OFDMA
Data bits Channel Layer modulator
Interleaver
of user 1 encoder mapper
MQAM
mapper
Y= W*X
X W Multipath fading
Precoding matrix channel
generator
BER evaluator BER evaluator

of user 1 of user N Limited feedback
link
Channel State Channel

Information (CSI) Estimator
OFDMA
Demodulator
MIMO
Recovered data bits Channel decoder User N
demapper
OFDMA
Demodulator
User 1
Outline
Introduction Exhaustive selection
Precoding Greedy selection
Exhaustive selection
Given a precoding technique, scheduling (user selection) is to find a
set of users among all active users to maximize the system sum-rate.
Obviously, the simple optimal method for user selection is exhaustive
search but its complexity is impractically high as the number of users
is large.
Outline
Introduction Exhaustive selection
Precoding Greedy selection
Greedy selection
Greedy user selection algorithm
1 Initialization: Θ0 = {1, 2, ..., 𝑁𝑈 } is the set of all available users’
indices
Ω0 = {∅} is the set of selected users initially assigned to a null set.
𝜂 = 0 stands for the number of selected users, initially set to zero.
𝐶0 = 0 is the system sum-rate of selected users, initially set to zero.
2 Repetition: Assuming that selecting user 𝑢 in the set Θ𝜂
maximizes the resulting sum-rate of the system called 𝐶max .
𝜂 =𝜂+1
If 𝐶max < 𝐶𝜂−1 or 𝜂 > 𝑁𝑡 or 𝜂 > 𝑁𝑢 go to Step 3 otherwise do:
𝐶𝜂 = 𝐶max ∪
Ω𝜂 = Ω𝜂−1 {𝑢} (select one more user)
Θ𝜂 = Θ𝜂−1 ∖{𝑢} (ignore user-𝑢 in later consideration)
Go to Step 2.
3 Stop the user selection process and compute the ZF weighting
vectors based on the composite channel matrix of selected users.

Chapter 3: Physical-Layer Transmission Techniques: Section 3.6

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter 3: Physical-Layer Transmission Techniques: Section 3.6

Uploaded by

Copyright:

Available Formats

Outline

Chapter 3: Physical-layer transmission techniques

Section 3.6: Space Division Multiple Access (SDMA)

Instructor: Nguyen Le Hung

3 Scheduling (user selection)

SDMA with OFDM

A simple example of multiuser (MU) transmission

Coded bits De-mod

Multiuser transmission techniques

LTE (4G) system

CSI feedback Vector Grassmannian

Exhaustive Random Greed or iterative Linear Non-linear Codebook-

An example of linear precoding

Zero forcing (ZF) precoding formulation

Zero-forcing precoding formulation (cont.)

Power allocation in ZF precoding

Power allocation in ZF precoding (cont.)

where 𝑥+ denotes max(𝑥, 0), and the water level 𝜇 is chosen to

Given a set of selected users Ω = {1, ..., 𝑈 }, the above precoding

Precoding in LTE downlink transmissions

BER evaluator BER evaluator

Channel State Channel

You might also like