Allerton 2015 Paper Abstract


Paper ThC2.5

Wu, Xiugang (Stanford University), Ozgur, Ayfer (Stanford University)

Cut-Set Bound Is Loose for Gaussian Relay Networks

Scheduled for presentation during the Invited Session "Recent Developments in Information Theory, Statistics and Probability I" (ThC2), Thursday, October 1, 2015, 14:50−15:10, Solarium

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on December 5, 2021

Keywords Information Theory


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.



All Content © PaperCept, Inc..

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2021 PaperCept, Inc.
Page generated 2021-12-05  09:54:34 PST  Terms of use