pith. sign in

arxiv: 1111.2430 · v1 · pith:2MUM37ZVnew · submitted 2011-11-10 · 💻 cs.IT · math.IT

Achievable Rates for a Two-Relay Network with Relays-Transmitter Feedbacks

classification 💻 cs.IT math.IT
keywords relayssenderbinningcooperationfeedbacklinksnetworkrelay
0
0 comments X
read the original abstract

We consider a relay network with two relays and two feedback links from the relays to the sender. To obtain the achievability results, we use the compress-and-forward and the decode-and-forward strategies to superimpose facility and cooperation analogue to what proposed by Cover and El Gamal for a relay channel. In addition to random binning, we use deterministic binning to perform restricted decoding. We show how to use the feedback links for cooperation between the sender and the relays to transmit the information which is compressed in the sender and the relays.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.