Cut-Set Bound Is Loose for Gaussian Relay Networks
Preprint
Abstract
The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity of the Gaussian primitive relay channel which is tighter than the cut-set bound. Our proof is based on typicality arguments and concentration of Gaussian measure. Combined with a simple tensorization argument proposed by Courtade and Ozgur in 2015, our result also implies that the current capacity approximations for Gaussian relay networks, which have linear gap to the cut-set bound in the number of nodes, are order-optimal and leads to a lower bound on the pre-constant.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- The Approximate Capacity of the Gaussian $N$-Relay Diamond NetworkIEEE Transactions on Information Theory, 2012
- Network Information Theory2011
- Compute-and-Forward: Harnessing Interference Through Structured CodesIEEE Transactions on Information Theory, 2011
- Noisy Network CodingIEEE Transactions on Information Theory, 2011
- Wireless Network Information Flow: A Deterministic ApproachIEEE Transactions on Information Theory, 2011
- A Theory of Network Equivalence— Part I: Point-to-Point ChannelsIEEE Transactions on Information Theory, 2011
- Cooperative strategies and capacity theorems for relay networksIEEE Transactions on Information Theory, 2005
- Transportation cost for Gaussian and other product measuresGeometric and Functional Analysis, 1996
- Partial converse for a relay channelIEEE Transactions on Information Theory, 1988
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979