Capacity Approximations for Gaussian Relay Networks
- 17 July 2015
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 61 (9) , 4721-4734
Abstract
Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward-based strategies can achieve the capacity of this network within an additive gap. Here, the relays quantize their received signals at the noise level and map them to random Gaussian codebooks. The resultant gap to capacity is independent of the SNRs of the channels in the network and the topology, but is linear in the total number of nodes. In this paper, we provide an improved lower bound on the rate achieved by the compress-and-forward-based strategies (noisy network coding in particular) in arbitrary Gaussian relay networks, whose gap to capacity depends on the network not only through the total number of nodes but also through the degrees of freedom of the min cut of the network. We illustrate that for many networks, this refined lower bound can lead to a better approximation of the capacity. In particular, we demonstrate that it leads to a logarithmic rather than linear capacity gap in the total number of nodes for certain classes of layered networks. The improvement comes from quantizing the received signals of the relays at a resolution decreasing with the total number of nodes in the network. This suggests that the rule-of-thumb in the literature of quantizing the received signals at the noise level can be highly suboptimal.Keywords
Funding Information
- Stanford Graduate Fellowship
- NSF CAREER (1254786)
- NSF Center for Science of Information (CCF-0939370)
This publication has 17 references indexed in Scilit:
- Achieving the Capacity of the $N$ -Relay Gaussian Diamond Network Within log $N$ BitsIEEE Transactions on Information Theory, 2014
- Distributed decode-forward for multicast2014
- On the Optimal Compressions in the Compress-and-Forward Relay SchemesIEEE Transactions on Information Theory, 2013
- Computation Alignment: Capacity Approximation Without Noise AccumulationIEEE Transactions on Information Theory, 2013
- Optimizing Quantize-Map-and-Forward relaying for Gaussian diamond networks2012
- Ergodic Interference AlignmentIEEE Transactions on Information Theory, 2012
- Compute-and-Forward: Harnessing Interference Through Structured CodesIEEE Transactions on Information Theory, 2011
- Cooperative CommunicationsFoundations and Trends® in Networking, 2007
- Capacity of Multi‐antenna Gaussian ChannelsEuropean Transactions on Telecommunications, 1999
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979