Insufficiency of Linear-Feedback Schemes in Gaussian Broadcast Channels With Common Message

From MaRDI portal
Publication:2986205

DOI10.1109/TIT.2014.2329000zbMATH Open1360.94268arXiv1307.5549OpenAlexW2012814464MaRDI QIDQ2986205FDOQ2986205

Youlong Wu, Paolo Minero, Michèle Angela Wigger

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We consider the Kgeq2-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with a message point, in the spirit of Schalkwijk & Kailath's scheme for point-to-point channels or Ozarow & Leung's scheme for BCs with private messages, are strictly suboptimal for this setup. Even with perfect feedback, the largest rate achieved by these schemes is strictly smaller than capacity C (which is the same with and without feedback). In the extreme case where the number of receivers Koinfty, the largest rate achieved by linear-feedback schemes with a message point tends to 0. To contrast this negative result, we describe a scheme for emph{rate-limited} feedback that uses the feedback in an intermittent way, i.e., the receivers send feedback signals only in few channel uses. This scheme achieves all rates R up to capacity C with an L-th order exponential decay of the probability of error if the feedback rate Rextnormalfb is at least (L1)R for some positive integer L.


Full work available at URL: https://arxiv.org/abs/1307.5549







Cited In (1)





This page was built for publication: Insufficiency of Linear-Feedback Schemes in Gaussian Broadcast Channels With Common Message

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986205)