Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Symmetric $K$-user Interference Channels with Limited Feedback

Published 4 Mar 2014 in cs.IT and math.IT | (1403.0957v2)

Abstract: In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the linear deterministic model, and the Gaussian model. For the deterministic model, the proposed scheme achieves a symmetric rate that is the minimum of the symmetric capacity with infinite feedback, and the sum of the symmetric capacity without feedback and the symmetric amount of feedback. For the Gaussian interference channel, we use lattice codes to propose a transmission strategy that incorporates the techniques of Han-Kobayashi message splitting, interference decoding, and decode and forward. This strategy achieves a symmetric rate which is within a constant number of bits to the minimum of the symmetric capacity with infinite feedback, and the sum of the symmetric capacity without feedback and the amount of symmetric feedback. This constant is obtained as a function of the number of users, $K$. The symmetric achievable rate is used to characterize the achievable generalized degrees of freedom which exhibits a gradual increase from no feedback to perfect feedback in the presence of feedback links with limited capacity.

Citations (7)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.