Bounds on the Achievable Rate of Noisy feedback Gaussian Channels under Linear Feedback Coding Scheme

Details Bounds on the Achievable Rate of Noisy feedback Gaussian Channels under Linear Feedback Coding Scheme Bounds on the Achievable Rate of Noisy feedback Gaussian Channels under Linear Feedback Coding Scheme

2011-08-13

arxiv.org/abs/1108.2816v1

Computer Science

Information Theory

5 pages, 6 figures. Published in Proc. of International Symposium on Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bounds on the Achievable Rate of Noisy feedback Gaussian Channels under Linear Feedback Coding Scheme does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds on the Achievable Rate of Noisy feedback Gaussian Channels under Linear Feedback Coding Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the Achievable Rate of Noisy feedback Gaussian Channels under Linear Feedback Coding Scheme will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-637417