1

0
05/19/202
Cooperative
Communications
GENERAL THREE NODE RELAY CHANNEL

SAEED JAWAD R
2014252003
Introduction 2

0
05/19/202
User Cooperative Communication :
 Form of communication in which users work together to deliver
their data

Diversity in Reception
 Remedy Channel Impairments
 Reduces risk of being in deep fade
Introduction 3

0
05/19/202
Cooperative Diversity:
 Diversity of received signal through a relay node offering alternate
transmission path

Diversity – Multiplexing Tradeoff:

 Redundant data sent over multiple channels – Diversity increases
 Independent data sent over multiple channels – Multiplexing
increases
User Cooperation in Cognitive 4

Systems

0
05/19/202
Cooperataion Types
 Secondary – Secondary
Enhance reliability and increase throughput
 Secondary – Primary
Secondary helps primary to transmit data soon so that spectrum hole is
created.
Relay Channels 5

0
05/19/202
 Relay – increase transmission range
Relay Channels 6

0
05/19/202
 Relay – Cooperative Diversity

(a) Single point – to – point

channel
(b) Broadcast Channel
(c) Multiple Access Channel
Relay Channels 7

0
05/19/202
 Why Relay ?
A General Three Node Relay 8

Channel

0
05/19/202
General Relay Channel
 Model
 Relaying Stratergy
 Coding
 Acheivable Rate
General Relay Channel – Model 9

0
05/19/202
 w – message signal
 X, XR – input signal from
Source and Relay
 Z, ZR – Zero mean normally
distributed random variables
at destination and relay
 hi,j – Channel effects
General Relay Channel – Relaying 10

Strategy

0
05/19/202
Strategies
 Amplify and Forward (AF)
 Decode and Forward (DF)
 Coded Cooperation (CC)
General Relay Channel – Relaying 11

Strategy

0
05/19/202
Comparing AF and DF Relaying Strategies

Amplify & Forward Decode & Forward

Relay sends scaled copy of received
noisy signal
Easy to implement
Noise at relay – amplified
Not suitable for multi-hop
transmission
Transmits decoded/re-encoded copy
to the destination
Increased Complexity
Reliable than AF transmission
Suitable for multi-hop transmissions
General Relay Channel – Coding 12

0
05/19/202
Ideal Case :
 Unlimited Capacity
 Zero delay
 Source and Relay fully synchronized

Cooperative Beamforming:
 Source & Relay allocate power according to channel condition
 At receiver, all the signal constructively adds maximizing SNR
General Relay Channel – Coding 13

0
05/19/202
Practical Strategies for DF coding
 Irregular Encoding / Successive Decoding
 Regular Encoding / Backward Decoding
 Regular Encoding / Sliding Window Decoding
General Relay Channel – Coding 14

0
05/19/202
Regular Encoding / Sliding Window Decoding

Nodes Time Slot Time Slot Time Slot Time Slot Time Slot Time Slot
1 2 3 4 5 6
Source X(w1) X(w2) X(w3) X(1) - -

Relay Xr(1) Xr(w1) Xr(w2) Xr(w3) - -

Destination - {X(w1),Xr(1)} {Xr(w1),X(w2 {Xr(w2),X(w3 {Xr(w3),X(1)} -

)} )}
General Relay Channel – Coding 15

0
05/19/202
Regular Encoding / Sliding Window Decoding

Nodes Time Slot Time Slot Time Slot Time Slot Time Slot Time Slot
1 2 3 4 5 6
Source X(w1) X(w2) X(w3) X(1) - -

Relay Xr(1) Xr(w1) Xr(w2) Xr(w3) - -

Destination - {X(w1),Xr(1)} {Xr(w1),X(w2 {Xr(w2),X(w3 {Xr(w3),X(1)} -

)} )}
General Relay Channel – Coding 16

0
05/19/202
Regular Encoding / Sliding Window Decoding

Nodes Time Slot Time Slot Time Slot Time Slot Time Slot Time Slot
1 2 3 4 5 6
Source X(w1) X(w2) X(w3) X(1) - -

Relay Xr(1) Xr(w1) Xr(w2) Xr(w3) - -

Destination - {X(w1),Xr(1)} {Xr(w1),X(w2 {Xr(w2),X(w3 {Xr(w3),X(1)} -

)} )}
General Relay Channel – Coding 17

0
05/19/202
Regular Encoding / Sliding Window Decoding

Nodes Time Slot Time Slot Time Slot Time Slot Time Slot Time Slot
1 2 3 4 5 6
Source X(w1) X(w2) X(w3) X(1) - -

Relay Xr(1) Xr(w1) Xr(w2) Xr(w3) - -

Destination - {X(w1),Xr(1)} {Xr(w1),X(w2 {Xr(w2),X(w3 {Xr(w3),X(1)} -

)} )}
General Relay Channel – 18

Achievable Rate

0
05/19/202
Channel Capacity
 Maximal Rate at which information can be sent over a channel
with low Pe.
 Maximum Mutual Information between X and Y maximized over
all possible input distributions

Where Mutual information is defined as,

General Relay Channel – 19

Achievable Rate

0
05/19/202
Channel Model
(a) Physical representation
(b) Probabilistic representation
General Relay Channel – 20

Achievable Rate

0
05/19/202
Water Filling Algorithm
 Fading Channel where ‘h’ is varying.
 CSI is known to both Transmitter and Receiver.

Power Allocation:
General Relay Channel – 21

Achievable Rate

0
05/19/202
Water Filling Algorithm
General Relay Channel – 22

Achievable Rate

0
05/19/202
Achievable Rate of Three Node Relay
Channel
(a) Non cooperative Relay Channel
(b) Cooperative Relay Channel
General Relay Channel – 23

Achievable Rate

0
05/19/202
Non cooperative Relay Channel
General Relay Channel – 24

Achievable Rate

0
05/19/202
Cooperative Relay Channel
 With aid of relay, the destination receives two copies of signal
 Max achievable rate @ destination, (only if SR channel supports
this rate)

Else,

 Combining results, we get

 25

0
05/19/202
Thank you