Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback

A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than ±1, the gap between the sum-rate that the scheme achieves and the full-cooperation bound vanishes as the signal-to-noise ratio tends to infinity. When...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 60; no. 1; pp. 54 - 71
Main Authors Gastpar, Michael, Lapidoth, Amos, Steinberg, Yossef, Wigger, Michele
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.01.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0018-9448
1557-9654
1557-9654
DOI10.1109/TIT.2013.2287531

Cover

More Information
Summary:A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than ±1, the gap between the sum-rate that the scheme achieves and the full-cooperation bound vanishes as the signal-to-noise ratio tends to infinity. When the correlation coefficient is -1, the gains afforded by feedback are unbounded and the prelog is doubled. When the correlation coefficient is +1, we demonstrate a dichotomy that if the noise variances are equal, then feedback is useless, and otherwise, feedback affords unbounded rate gains and doubles the prelog. The unbounded feedback gains, however, require perfect (noiseless) feedback. When the feedback links are noisy, the feedback gains are bounded, unless the feedback noise decays to zero sufficiently fast with the signal-to-noise ratio. Extensions to more receivers are also discussed as is the memoryless Gaussian interference channel with feedback.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9448
1557-9654
1557-9654
DOI:10.1109/TIT.2013.2287531