Cooperative Diversity in

Wireless Broadcast
Channels
Jingyi Shao
Rahul Tandra
May 13, 2004, EE224B Project
Dr. Tse, UC Berkeley

Overview
z
z

Problem and motivation

Case 1: slow fading
z Network model
z Outage probability and diversity
z Diversity and rate tradeoff
z Extension
Case 2: AWGN wireless channels
z Network model
z Rate region without cooperation
z Rate region with cooperation in Scheme 1
z Rate region with cooperation in Scheme 2
z Extension
Conclusion

Problem and Motivation

z

Wireless broadcast channel

z
z

Goal: to use cooperation to

exploit spatial diversity

Decrease outage probabilty in

slow fading
Increase achievable rate region
in AWGN wireless channels

Applications: sensor networks.

D_1
Source
D_2

One source sends the same

message to multiple destinations
Multipath fading

D_n

Slow Fading: Network Model

z

One source and two

destinations
Assumptions:
z
z

z
z

Slow fading
Channels independent
Rayleigh, hi ~ CN (0,1)
Half-duplex
i.i.d. Channel noise ~ CN (0, N 0 )

h1
S

D1

h3

h2

D2

Slow Fading: Cooperation

Scheme
z
z
z
z

Divide n channel uses (assuming the n channel uses is less than

the coherence time of the channel) into two equal slots.
During Slot 1, the source transmits at a fixed rate, R, and both of
the destinations listen.
The destinations also tracks the channel SNR through training
symbols.
Each of the destination decodes at the end of Slot 1, and if its
channel SNR is bigger than some threshold, b, the destination
will repeat the source signal in Slot 2; otherwise, it will listen.

S Tx, D1 and D2 Rx

D_i Tx iff SNR_i>b

Slot 1, n/2 channel uses

Slot 2, n/2 channel uses

n channel uses

Slow Fading: Outage

Probability Calculation
z

Similar to the selcetion decode in [Laneman et al]

Pr(outage at node 2)
= Pr(both Ch 1 and Ch 2 are bad during Slot 1)
+ Pr(only Ch 2 is bad during Slot 1 and Ch 3 is bad during Slot 2)

2R 1
2R 1
2
)  (| h2 | <
))
= Pr((| h1 | <
SNR
SNR
2R 1
2R 1
2R 1
2
2
2
)  (| h2 | >
)  (| h3 | <
))
+ Pr((| h1 | <
SNR
SNR
SNR

h1

2(2 1)
SNR 2
R

At high SNR, Pr(outage at node 2)

D1

h3

h2

D2

Slow Fading: Diversity Rate

Tradeoff
z
z
z

Diversity = 2
Rate =
Can we do get a higher rate?
No!
h1
S

D1

h3

h2

D2

Slow Fading: Extention to n

Desitinations
z

Similar scheme to achieve Diversity = n, rate = 1/(n+1).

D1

h1
S

h2

h3

D2

D3

AWGN: Network Model

z

z
z
z

Assume no fading, and all nodes

knows the channel gains.
Without loss of Generality, assume | h2 |>| h1 |
Assume i.i.d. channel noise ~ CN (0, N 0 )
S wants to send the same
message to both D1 and D2.
Half-duplex operations at all
S
nodes.
Each nodes has transmit power
constraint, P.

h1

D1

h3

h2

D2

AWGN: Achievable Rate

Region without Cooperation
z

The common rate is limited by the worse channel.

SNR1 = 0dB
SNR2 = 20dB

AWGN: Cooperation Scheme 1

z

Divide n channel uses into two slots, and let t be the

fraction of time for Slot 1, (1-t) be the fraction of time
for Slot 2.
During Slot 1, S allocates a fraction of its power for
the signal to D1, and (1-a) fraction of the power for
the signal to D2 using superposition coding with rate
R1 and R2.
D1
h1

| h1 |2 aP
R1 t{log(1 +
)}
2
| h1 | (1 a ) P + N 0

| h2 |2 (1 a ) P
| h1 |2 aP
h2
R2 t{log(1 +
) + log(1 +
)}
N0
| h1 |2 (1 a) P + N 0

h3
D2

AWGN: Cooperation Scheme 1

cont.
z

Both destinations can decode its portion of the

message. Note: D2 has a better channel, and
receives more bits than D1.
During Slot 2, S and D2 jointly transmit additional bits
to D1, so that D1 gets the same message as D2.
This is a multiple access channel, and the optimal
rate D1 gets in Slot 2 is

(| h1 | + | h3 | ) P
(1 t ) log(1 +
)
N0
2

h1

D1

h3

h2

D2

AWGN: Cooperation Scheme 1

cont.
z

Overall rate for D1 and D2

| h1 |2 aP
(| h1 |2 + | h3 |2 ) P
) + (1 t ) log(1 +
)
R1 t log(1 +
2
| h1 | (1 a) P + N 0
N0
| h2 |2 (1 a ) P
| h1 |2 aP
) + log(1 +
))
R2 t (log(1 +
2
| h1 | (1 a) P + N 0
N0
z
z
z

Want R1(t,a) = R2(t,a).

Solve t in terms of a.
Maximize R1 over 0<a<1.

AWGN: Cooperation Scheme 1

cont.

t = 0.5
SNR1 = 0dB
SNR2 = 20dB
SNR3 = 17dB

AWGN: Cooperation Scheme 2

z
z
z

Divide n channel uses into two slots.

| h2 |2 P
During the first slot, S transmits at R = log(1 +
)
N0
Note D2 can decode perfectly, but D1 cannot
decode perfectly. D1 will decode to a list of possible
codewords.
During the second time slot, D2 sends D1 some
additional information to help D1 fully decode.
The coding technique used here is similar to [Cover and Gamal 79],
which involves random coding and Slepian-Wolf partitioning.

AWGN: Cooperation Scheme 2

cont.
z

S, D1, and D2 forms a relay channel with D2 being

the relay.
Capacity (full duplex) is known [Cover and Gamal
79]
C=

sup min{I ( X S , X D 2 ; YD1 ), I ( X S ; YD 2 | X D 2 )}

p( X S , X D 2 )

D1

N1

D2

N-N1

AWGN: Cooperation Scheme 2

cont.
z

For AWGN degraded relay channels

P1 + P2 + 2 (1 a ) P1 P2
aP
), C ( 1 )}
C = max min{C (
0 a 1
N
N1
S
With P1

D1

N1

D2
With P2

N-N1

AWGN: Cooperation Scheme 2

cont.
z

In our case,
| h3 |2 P
a | h2 |2 P
a | h1 |2 P
), [C (
) + C(
)]}
R = 1 / 2 max min{C (
0 a 1
N0
N0
N0

h1
S

D1

h3

With Power P

h2

D2

AWGN: Cooperation Scheme 2

cont.
z

Comparing the achievable rate for the two schemes.

Conclusion
z

z
z

Use cooperation scheme to achieve full

diversity in slow fading wireless broadcast
network.
Diversity and rate tradeoff in slow fading
case.
Use two cooperation schemes to achieve
higher common rate region in AWGN
wireless broadcast network.
Future work.