Abstract
The multicast capacity of the Gaussian two-hop relay network with one source, N relays, and L destinations is studied. It is shown that a careful modification of the partial decode-forward coding scheme, in which the relays cooperate through degraded sets of message parts, achieves the cutset upper bound within log N bits regardless of the channel gains and power constraints. This scheme improves upon a previous scheme by Chern and Ozgur, which is also based on partial decode- forward yet has an unbounded gap from the cutset bound for L ≥ 2 destinations. As an added benefit, the achievable rate of the proposed scheme involves evaluating rate for L(N + 1) cuts out of the total L2N possible cuts.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
