Papers
Topics
Authors
Recent
Search
2000 character limit reached

Achievable Rates in Two-user Interference Channels with Finite Inputs and (Very) Strong Interference

Published 18 Aug 2010 in cs.IT and math.IT | (1008.3035v1)

Abstract: For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all. To achieve this capacity, the channel inputs need to be Gaussian distributed. However, Gaussian signals are continuous and unbounded. Thus, they are not well suited for practical applications. In this paper, we investigate the achievable rates if the channel inputs are restricted to finite constellations. Moreover, we will show by numerical simulations that rotating one of these input alphabets in the complex plane can increase the achievable rate region. Finally, we show that the threshold at which the single-user rates are achieved also depends on this rotation.

Citations (16)

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.

Authors (2)

Collections

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