Cut-Set Bound is Loose for Gaussian Relay Networks
Authors:
Open Access
- 26 July 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (2) , 1023-1037
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 uses Gaussian measure concentration to establish geometric relations, satisfied with high probability, between the n-letter random variables associated with a reliable code for communicating over this channel. We then translate these geometric relations into new information inequalities that can not be obtained with classical methods. Combined with a 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 preconstant.Keywords
All Related Versions
Funding Information
- NSF (CIF-1704624, CIF-1514538)
- Center for Science of Information, an NSF Science and Technology Center (CCF-0939370)
This publication has 33 references indexed in Scilit:
- Concentration of Measure Inequalities in Information Theory, Communications, and CodingFoundations and Trends® in Communications and Information Theory, 2013
- The Approximate Capacity of the Gaussian $N$-Relay Diamond NetworkIEEE Transactions on Information Theory, 2012
- 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
- Bounding $\bar{d}$-distance by informational divergence: a method to prove measure concentrationThe Annals of Probability, 1996
- Partial converse for a relay channelIEEE Transactions on Information Theory, 1988
- The Capacity of the Relay Channel1987
- A simple proof of the blowing-up lemma (Corresp.)IEEE Transactions on Information Theory, 1986
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- Spreading of Sets in Product Spaces and Hypercontraction of the Markov OperatorThe Annals of Probability, 1976