Professional Documents
Culture Documents
t9 PDF
t9 PDF
New Applications
Aria Nosratinia
Multiuser Diversity
Antenna Selection
Relay Selection
Multiuser Diversity
Multiuser diversity
Frequency-selective channels
subject to
1X
Pk,` = P
L
`
Relaxing the power constraint to a sum power constraint:
1 XX
Pk,` = KP
L
k `
0 otherwise
0 otherwise
|h|2 P
X
Rk < E log 1 +
N0
k
Multiuser Diversity
h
at
tp
es
ng
ro
St
rate
User 1
time
rate
User 2
time
User 1
User 2
time
Multiuser Diversity
The term multiuser diversity was coined by Knopp and Humblet [1]
Long term (average) power constraint: can save and reuse the
off-time power
Transmission by best user Csum ∼ log k.
1
Actually, it is enough for a fixed percentage of users to transmit
Aria Nosratinia Opportunistic Communication - Globecom’2013 14/ 133
Multiuser Diversity and Mobility
If users and objects around them are fixed, there are no channel
variations and no multiuser diversity (if we expect to serve all users).
∆C = Cfull−CSI − C1bit −→ 0
k→∞
Sum−rate capacity
7
6
Spectral efficiency (Nats/sec/Hz)
beam
best user
When base station has multiple antennas, one may use beamforming
with multiuser diversity.
Answer: use one bit for significance, rest for beamforming (Sanayei &
Nosratinia [5]).
For each beam choose user with a high gain and low cross-gain
In this case also, with 1-bit feedback per subchannel per user
(Sanayei/Nosratinia [7]):
∆C = Cfull−CSI − C1bit −→ 0
k→∞
2
Full CSI, ρ=0
1−Bit , ρ=0
TDMA , ρ=0
1
Full CSI, ρ=0.8
1−Bit , ρ=0.8
TDMA , ρ=0.8
0
0 100 200 300 400 500 600 700 800 900 1000
Number of users
ρ: subchannel correlation
Aria Nosratinia Opportunistic Communication - Globecom’2013 24/ 133
Delay and Fairness
Rk
3 Serve the user with largest Tk
4 Update Tk ’s.
We shall see the second approach in other contexts later in this talk.
In the downlink, sum capacity on the order Csum ∼ log(ρ log k).
Practical issues:
Channel estimation and feedback
Delay
Fairness
Acknowledgment: This section borrowed heavily from Tse and Viswanath [8]
Cost and power consumption of radios is mostly in the front end (RF
chain).
One can show that all diversity gain can be captured, and a good part
of capacity gains.
fading Signal
signals RF Chain Processing Output
and
Decoding
Selection
Diversity Analysis
2R − 1 N 2R − 1 N
= 1 − exp ≈
ρ ρ
Pe = P(e|o) Po + P(e|o) (1 − Po )
≤ Po + P(e|o)
The second term is upper bounded using a union bound (see [9]). It
can be shown under some mild conditions, it has at least the same
SNR exponent as the first term.
Some works skip the relation between outage and error. This is a
mistake, as sometimes this step may be significant.
Final result: d = N.
Selection Feedback
RF Chain RF Chain
Signal Signal
Input Processing RF H RF Processing Output
and Switch Switch and
Coding Decoding
RF Chain RF Chain
L M M L
T T R R Rx Selection
Tx Selection
14
10
4
Water−filling
Optimal Selection
2 Successive Selection
Norm−based selection
No CSI @ Tx
0
0 2 4 6 8 10 12 14 16 18 20
SNR (in dB)
C = M log ρ + O(1)
G =0 non-informed transmitter
M
Gwf = N log waterfilling
N
Gas = N log log M N-antenna selection
16
14 G
wf
12 Gas
Spectral efficiency Bits/sec/Hz
10
m log(ρ)
2 No CSI @ Tx
Ant. Sel. (optimal)
Ant. Sel. (successive)
Water−filling
0
0 2 4 6 8 10 12 14 16 18 20
SNR (dB)
Channel estimation errors and feedback delay can cause problems for
antenna selection.
Relay Selection
Source
Two-Hop Communication
Relay
Source
Relay Channel
Source
Relay
Decode-and-Forward (DF)
Compress-and-Forward (CF)
Partial Decode-and-Forward (PDF)
Amplify-and-Forward (AF)
Dynamic Decode-and-Forward (DDF)
Non-orthogonal Amplify-and-Forward (NAF)
Other protocols also exist, especially for multiple relays.
Amplify-and-Forward
X2 = c · Y2
1
IAF = log(1 + |h13 |2 + f (|h12 |2 , |h23 |2 ))
2
xy
f (x, y ) =
x +y +1
1
Note: we are operating in complex baseband. The factor 2 in front of
log is due to half-duplex operation.
Decode-and-Forward Diversity
Can calculate all terms (Hunter and Nosratinia [12]), but we limit
ourselves to diversity calculation.
Let’s use this opportunity to visit a useful tool: asymptotic analysis
with exponential equalities.
and from this we can directly conclude that DF has diversity two,
since log(Pe ) ∼ −2 log SNR.
Multi-Relay Scenario
With CSIT, relay selection can get diversity on the order of potential
transmission paths.
Exchange of CSIT
Explicit (e.g. feedback)
Implicit (e.g. backoff timers and channel sense)
Selection Metrics
Disadvantages:
Computational complexity
Complicated decision function → intractable performance analysis
Best Relay
γ = min{γ1 , γ2 }
γ1 γ2
γ=
γ1 + γ2
However, coordination by backoff timer can be problematic.
δ is independent of SNR...
Backoff Timer
Backoff Timer
Backoff Timer
Backoff Timer
Backoff Timer
wavefront
Backoff Timer
Backoff Timer
Backoff Timer
Backoff Timer
COLLISION!
Backoff Timer
Example for relay backoff timer error: 100 meter separation of relays
produces a 3 microsecond error.
For that, we need to visit the rate loss induced by relays, and the
concept of diversity multiplexing tradeoff.
2
Hot topic of current research
Aria Nosratinia Opportunistic Communication - Globecom’2013 67/ 133
Full-Duplex
Non-Orthogonal Half-Duplex
Orthogonal Half-Duplex
d(r)
2
AF,DF,CC
direct
0.5 1 r
d (r ) = 2(1 − 2r )+
Block 1 Block 2
time
Non-Orthogonal AF
Block 1 Block 2
Source
Relay
time
Dynamic DF
d(r)
2
NAF
AF
1
DDF
direct
0.5 1 r
d(r)
6
NAF
AF
DDF
1
direct
0.5 1 r
Multi-relay NAF and DDF are not close to the MISO bound.
Motivation for alternative solutions in multi-relay regimes.
d (r ) = 3(1 − r )+
1-bit
1-bit
1-bit
Source Relays Destination
log (1+M)
bits
n
Source sm issio Destination
tran
data
Best Relay
10
Direct
DSTC
8 DDF
ITRS
Diversity gain d(r)
0
0 0.2 0.4 0.6 0.8 1
Multiplexing gain r
Some approaches:
Isolated NAF relays (Yang and Belfiore [16])
Isolated DF relays (same principle)
Partially isolated AF relays and sequential transmission
...
Aria Nosratinia Opportunistic Communication - Globecom’2013 81/ 133
Summary of Relay Selection
Without direct link, close to MISO upper bound, but faces inter-relay
interference.
The throughput of the two options are complex functions of all five
channel gains.
Addressing Dependencies
Mode 1 Mode 2
New Framework
Mode 1
Mode n
Definition: A mode consists of a set of nodes and links such that the
message received in each node, conditioned on one source message, is
independent of all other source messages.
Lemma
In a system that opportunistically switches between n modes whose
conditional DMT is given by di0 (r )
Lemma
The DMT for opportunistically switching between n independent wireless
subsystems d(r ) is bounded by
d (r ) ≤ d1 (r ) + d2 (r ) + . . . + dn (r ), (1)
Lemma
The upper bounds of Lemma 1 and Lemma 2 are tight if the following two
conditions are asymptotically satisfied:
1 Each selected subsystem uses codebooks that achieve its individual
DMT.
2 Overall system is not in outage unless all subsystems are in outage.
Theorem
The DMT of a three-node simple relay channel, under either AF or DF,
subject to opportunistic relay selection, is given by:
d (r ) = (1 − r )+ + (1 − 2r )+ . (2)
Theorem
The opportunistic interference relay channel has the following DMT
characteristics: under orthogonal DF and non/orthogonal AF:
d (r ) = n(1 − r )+ + n(1 − 2r )+
8
CF
NAF/OAF/ODF
7 DDF1
DDF2
6
Diversity Gain d(r)
0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
Multiplexing Gain r
4 × 4 opportunistic IRC
Theorem
A DMT upper bound for genie-aided opportunistic shared relay channel is:
r
d (r ) ≤ (1 − )+ + (2n − 1)(1 − r )+
n
Theorem
For the 2-user shared relay channel, the following DMT can be achieved:
For NAF:
r +
d (r ) = max{2(1 − r )+ + 2(1 − 2r )+ , 1 − }
2
For DDF:
4(1 − r ) 0 < r ≤ 0.5 √
d (r ) = 2 1−r
r 0.5 < r ≤ 3 − 5
√
1 − 2r 3 − 5, r ≤ 2
4
Upper bound
NAF
3.5
DDF
CF
3
Diversity Gain d(r)
2.5
1.5
0.5
0
0 0.5 1 1.5 2
Multiplexing Gain r
Theorem
The opportunistic MARC has the following DMT: for the orthogonal AF
and DF:
d (r ) = (n + 1)(1 − 2r )+
for the NAF:
d (r ) = n(1 − r ) + (1 − 2r )+
for the DDF: (
n
(n + 1)(1 − r ) 0 < r ≤ n+1
d (r ) =
n (1−r
r
) n
n+1 < r ≤ 1
N+1
OAF/ODF
NAF
DDF
Upper bound/CF
0
0 0.25 0.5 0.75 1
Multiplexing Gain r
(a) (b)
(c) (d)
Theorem
The opportunistic 2 × 2 X-Relay Channel has the following achievable
DMT: for the orthogonal AF and DF as well as NAF:
d (r ) = 4(1 − r )+ + 2(1 − 2r )+
6
Upper bound
ODF/OAF
NAF
5 DDF
CF
Diversity Gain d(r)
0
0 0.2 0.4 0.6 0.8 1
Multiplexing Gain r
Our experience so far has been that selection criteria can be found to
construct reasonable achievability results from the DMT viewpoint.
Primary Primary
Gp Gp
Gs Gs
H H
Secondary Secondary
1
Set α = Θ(n− N+1 ) (for primary MAC replace N with M).
Determine eligible users, if less than ks = Γ/α, use all, if not, select
ks randomly.
6
Throughput (bit)
5
2 k =2
s
k =3
s
1
0
20 60 100 140 180 220 260 300 340 380
Number of secondary users
Example: Pp = Ps = 5, N = 2, m = 4, N = 2
Aria Nosratinia Opportunistic Communication - Globecom’2013 116/ 133
Theorem
Bounding the interference on primary by Θ(n−q ), the MAC throughput is:
m − qM
R= log n + O(1) primary MAC
M +1
m − qN
R= log n + O(1) primary BC
N +1
Throughput (bit)
q=0.2
q=0.1
4
2
50 100 150 200 250 300 350 400
Number of secondary users
1.5
q=0.2
q=0.1
1
Γ
0.5
50 100 150 200 250 300 350 400
Number of secondary users
Example: Γ = 2n−q
Broadcast Secondary
Primary Primary
Gp Gp
Gs Gs
H H
Secondary Secondary
2.5
Throughput (bit)
1.5
1
20 60 100 140 180 220 260 300 340 380
Number of secondary users
Example: Pp = Ps = 5, N = 2, m = 4, N = 2
Aria Nosratinia Opportunistic Communication - Globecom’2013 121/ 133
Broadcast: Secondary Capacity v. Interference
Throughput (bit)
q=0.5
1.5 q=0.8
0.5
50 100 150 200 250 300 350 400
Number of secondary users
1.5
q=0.5
1 q=0.8
Γ
0.5
0
50 100 150 200 250 300 350 400
Number of secondary users
Practically, this means path loss and shadowing are such that nodes
can still be considered “within the same network” and have some
non-trivial chance of being selected.
Primary nodes
G
Hp
H F
Amplify-forward relays
Relays in each group synchronize their input phase with one of the
TX antennas, and coherently transmit towards one RX antenna.
The result is virtual parallel pipes whose SIR grows with number of
relays.
M
Secondary throughput grows as 2 log n.
The philosophy is to use many relays with small power per relay
[1] R. Knopp and P. Humblet, “Multiuser diversity,” Eurecom Technical Report, May 2002. [Online]. Available:
http://www.eurecom.fr/util/publidownload.en.htm?id=607
[2] S. Sanayei and A. Nosratinia, “Opportunistic downlink transmission with limited feedback,” IEEE Trans. Inform. Theory,
vol. 53, no. 11, pp. 4363 –4372, Nov. 2007.
[3] D. Gesbert and M.-S. Alouini, “How much feedback is multi-user diversity really worth?” in IEEE International Conference
on Communications, vol. 1, Jun. 2004, pp. 234 – 238.
[4] D. Love, R. Heath, V. Lau, D. Gesbert, B. Rao, and M. Andrews, “An overview of limited feedback in wireless
communication systems,” IEEE J. Select. Areas Commun., vol. 26, no. 8, pp. 1341 –1365, Oct. 2008.
[5] S. Sanayei and A. Nosratinia, “Opportunistic beamforming with limited feedback,” IEEE Trans. Wireless Commun., vol. 6,
no. 8, pp. 2765 –2771, Aug. 2007.
[6] M. Sharif and B. Hassibi, “On the capacity of mimo broadcast channels with partial side information,” IEEE Trans.
Inform. Theory, vol. 51, no. 2, pp. 506 – 522, Feb. 2005.
[7] S. Sanayei, A. Nosratinia, and N. Aldhahir, “Opportunistic dynamic subchannel allocation in multiuser ofdm networks with
limited feedback,” in IEEE Information Theory Workshop, Oct. 2004, pp. 182 – 186.
[8] D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge University Press, 2005.
[9] L. Zheng and D. N. C. Tse, “Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels,” IEEE
Trans. Inform. Theory, vol. 49, no. 5, pp. 1073–1096, May 2003.
[10] S. Sanayei and A. Nosratinia, “Opportunistic beamforming with limited feedback,” in Asilomar Conference on Signals,
Systems and Computers, Nov. 2005, pp. 648 –652.
[11] J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: Efficient protocols and
outage behavior,” IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3062–3080, Dec. 2004.
[12] T. E. Hunter and A. Nosratinia, “Diversity through coded cooperation,” IEEE Trans. Wireless Commun., vol. 5, no. 2, pp.
283–289, Feb. 2006.
[13] A. Bletsas, A. Khisti, D. P. Reed, and A. Lippman, “A simple cooperative diversity method based on network path
selection,” IEEE J. Select. Areas Commun., vol. 24, no. 3, pp. 659–672, Mar. 2006.
[18] Y. Li and A. Nosratinia, “Capacity limits of multiuser multiantenna cognitive networks,” IEEE Trans. Inform. Theory,
2012. [Online]. Available: http://arxiv.org/abs/1008.3641
[19] N. Jamal, H. E. Saffar, and P. Mitran, “Asymptotic scheduling gains in point-to-multipoint cognitive networks.” [Online].
Available: http://arxiv.org/pdf/1001.3365
[20] R. Zhang and Y.-C. Liang, “Exploiting multi-antennas for opportunistic spectrum sharing in cognitive radio networks,”
Selected Topics in Signal Processing, IEEE Journal of, vol. 2, no. 1, pp. 88 –102, Feb. 2008.
[21] R. Zhang, S. Cui, and Y.-C. Liang, “On ergodic sum capacity of fading cognitive multiple-access and broadcast channels,”
IEEE Trans. Inform. Theory, vol. 55, no. 11, pp. 5161–5178, Nov. 2009.
[22] K. Hamdi, W. Zhang, and K. B. Letaief, “Opportunistic spectrum sharing in cognitive MIMO wireless networks,” IEEE
Trans. Wireless Commun., vol. 8, no. 8, pp. 4098–4109, Aug. 2009.
[23] Y. Li and A. Nosratinia, “Hybrid opportunistic scheduling in cognitive radio networks,” IEEE Trans. Wireless Commun.,
vol. 11, Jan. 2012.
[24] G. Zhao, J. Ma, G. Li, T. Wu, Y. Kwon, A. Soong, and C. Yang, “Spatial spectrum holes for cognitive radio with
relay-assisted directional transmission,” IEEE Trans. Wireless Commun., vol. 8, no. 10, pp. 5270 –5279, Oct. 2009.
[25] J. Mietzner, L. Lampe, and R. Schober, “Distributed transmit power allocation for multihop cognitive-radio systems,”
IEEE Trans. Wireless Commun., vol. 8, no. 10, pp. 5187 –5201, Oct. 2009.
[26] V. Asghari and S. Aissa, “Cooperative relay communication performance under spectrum-sharing resource requirements,”
in ICC, IEEE, May 2010.
[27] L. Li, X. Zhou, H. Xu, G. Li, D. Wang, and A. Soong, “Simplified relay selection and power allocation in cooperative
cognitive radio systems,” IEEE Trans. Wireless Commun., vol. 10, no. 1, pp. 33 –36, Jan. 2011.
[28] M. Naeem, D. Lee, and U. Pareek, “An efficient multiple relay selection scheme for cognitive radio systems,” in ICC, IEEE,
May 2010.
[29] Y. Zou, J. Zhu, B. Zheng, and Y.-D. Yao, “An adaptive cooperation diversity scheme with best-relay selection in cognitive
radio networks,” IEEE Trans. Signal Processing, vol. 58, no. 10, pp. 5438 –5445, Oct. 2010.
[30] J. Lee, H. Wang, J. Andrews, and D. Hong, “Outage probability of cognitive relay networks with interference constraints,”
IEEE Trans. Wireless Commun., vol. 10, no. 2, pp. 390 –395, Feb. 2011.
[31] H. Bolcskei, R. U. Nabar, O. Oyman, and A. J. Paulraj, “Capacity scaling laws in MIMO relay networks,” IEEE Trans.
Wireless Commun., vol. 5, no. 6, pp. 1433–1444, Jun. 2006.