The Approximate Capacity of the Gaussian N-Relay Diamond Network
Urs Niesen, Suhas Diggavi

TL;DR
This paper provides a near-accurate approximation of the capacity of the Gaussian N-relay diamond network, showing that simple bursty amplify-and-forward schemes are nearly optimal across various regimes.
Contribution
It introduces a capacity approximation with bounds independent of the number of relays, improving previous results and demonstrating the effectiveness of bursty amplify-and-forward.
Findings
Capacity approximated within 1.8 bits and a factor of 14.
Bursty amplify-and-forward is uniformly approximately optimal.
Achieves near-capacity in both symmetric and asymmetric networks.
Abstract
We consider the Gaussian "diamond" or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N^2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
