Capacity theorems for the relay channel
Citations
12,761 citations
Cites background from "Capacity theorems for the relay cha..."
...This example might correspond to a snapshot of a wireless network in which a higher level network protocol has allocated bandwidth to two terminals for transmission to their intended destinations or next hops....
[...]
...…i.e., achievable rates, via three structurally different random coding schemes: • facilitation [5, Theorem 2], in which the relay does not actively help the source, but rather, facilitates the source transmission by inducing as little interference as possible; • cooperation [5, Theorem 1],…...
[...]
...Such an approach might provide diversity in a wireless setting because, even if the fading is severe between and , the information might be successfully transmitted through ....
[...]
6,621 citations
Cites background from "Capacity theorems for the relay cha..."
...4, we consider a situation where users face statistically similar channels toward the BS, and we plot the probability of outage versus the service sustainability ratefor the equal rate point ( ), both for the cooperation and the no-cooperation schemes....
[...]
...It is also complicated by the fact that both partners have information of their own to send; this is not a simple relay [11], [12] problem....
[...]
4,385 citations
3,130 citations
Cites methods from "Capacity theorems for the relay cha..."
...The partners may be assigned mutually by the base station, or via some other technique....
[...]
2,842 citations
Cites background or result from "Capacity theorems for the relay cha..."
...We summarize the history of information theory for such channels, as well as some recent developments concerning coding strategies....
[...]
...Many other recent results can be found in [26]–[36], [38]–[76], and references therein (see especially [72]–[74] for new capacity theorems)....
[...]
References
4,165 citations
1,727 citations
498 citations
429 citations
423 citations