Bounds on the Achievable Rate of Noisy feedback Gaussian Channels under Linear Feedback Coding Scheme
arXiv:1108.2816
Abstract
In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the upper and lower bounds on the largest achievable rate for this setup. We show that these two bounds can be obtained by solving two convex optimization problems. Finally, we present some simulations and discussion.
arXiv comment5 pages, 6 figures. Published in Proc. of International Symposium on Information Theory
Cited by in corpus (4)
- Information Flow Decomposition in Feedback Systems: General Case Study
- Youla Coding and Computation of Gaussian Feedback Capacity
- Information Flow Decomposition in Feedback Systems: Linear Time-Invariant Systems with Gaussian Channels
- Upper Bound on the Capacity of Gaussian Channels with Noisy Feedback