Upper Bound on the Capacity of Gaussian Channels with Noisy Feedback

Details Upper Bound on the Capacity of Gaussian Channels with Noisy Feedback Upper Bound on the Capacity of Gaussian Channels with Noisy Feedback

2012-01-07

arxiv.org/abs/1201.1588v1

Computer Science

Information Theory

6 pages. Published on the Forty-Ninth Annual Allerton Conference on Communication, Control, and Computing, September 28 - Sept

Scientific paper

We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization problem. With stationarity assumptions on Gaussian noise processes, we characterize the limit of the n-block upper bound and prove that this limit is the upper bound of the noisy feedback (shannon) capacity.

Affiliated with

Also associated with

No associations

Rating

Upper Bound on the Capacity of Gaussian Channels with Noisy Feedback 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 Upper Bound on the Capacity of Gaussian Channels with Noisy Feedback, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper Bound on the Capacity of Gaussian Channels with Noisy Feedback will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-64