Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 18 Aug 2010 in cs.IT and math.IT

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

We haven't generated a summary for this paper yet.