Interference Channels with Rate-Limited Feedback

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Accepted for publication in the IEEE Transactions on Information Theory

Scientific paper

We consider the two-user interference channel with rate-limited feedback. Related prior works focus on the case where feedback links have infinite capacity, while no research has been done for the rate-limited feedback problem. Several new challenges arise due to the capacity limitations of the feedback links, both in deriving inner-bounds and outer-bounds. We study this problem under three different interference models: the El Gamal-Costa deterministic model, the linear deterministic model, and the Gaussian model. For the first two models, we develop an achievable scheme that employs three techniques: Han-Kobayashi message splitting, quantize-and-binning, and decode-and-forward. We also derive new outer-bounds for all three models and we show the optimality of our scheme under the linear deterministic model. In the Gaussian case, we propose a transmission strategy that incorporates lattice codes, inspired by the ideas developed in the first two models. For symmetric channel gains, we prove that the gap between the achievable sum-rate of the proposed scheme and our new outer-bounds is bounded by a constant number of bits, independent of the channel gains.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Interference Channels with Rate-Limited 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 Interference Channels with Rate-Limited Feedback, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interference Channels with Rate-Limited Feedback will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-707843

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.