The Approximate Capacity of the Gaussian N-Relay Diamond Network

DOI10.1109/TIT.2012.2219154zbMATH Open1364.94305arXiv1008.3813OpenAlexW2548811864MaRDI QIDQ2989402FDOQ2989402

Authors: Urs Niesen, Suhas N. Diggavi 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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 amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as in the high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound. We also present approximation results for the asymmetric Gaussian N-relay diamond network. In particular, we show that bursty amplify-and-forward combined with optimal relay selection achieves a rate within a factor O(log^4(N)) of capacity with pre-constant in the order notation independent of the channel gains.

Full work available at URL: https://arxiv.org/abs/1008.3813

Recommendations

• Achieving the Capacity of the <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula>-Relay Gaussian Diamond Network Within log <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></
• Capacity Approximations for Gaussian Relay Networks
• Approximate Capacity of a Class of Gaussian Interference-Relay Networks
• On the Capacity of Large Gaussian Relay Networks
• Capacity Bounds for Diamond Networks With an Orthogonal Broadcast Channel
• Capacity of a Class of Deterministic Relay Channels
• “The Capacity of the Relay Channel”: Solution to Cover’s Problem in the Gaussian Case
• Wireless Network Simplification: The Gaussian <inline-formula> <tex-math notation="TeX">\(N\) </tex-math></inline-formula>-Relay Diamond Network
• The Gaussian Multiple Access Diamond Channel
• Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within $\frac{1}{2}$ Bit

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (2)

• Approximate Capacity of a Class of Gaussian Interference-Relay Networks
• Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes

This page was built for publication: The Approximate Capacity of the Gaussian $N$-Relay Diamond Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989402)