Noisy-interference Sum-rate Capacity of Parallel Gaussian Interference Channels

2009/03/03 by Shang, Xiaohu, Chen, Biao, Kramer, Gerhard +1
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.0903.0595

Abstract

The sum-rate capacity of the parallel Gaussian interference channel is shown to be achieved by independent transmission across sub-channels and treating interference as noise in each sub-channel if the channel coefficients and power constraints satisfy a certain condition. The condition requires the interference to be weak, a situation commonly encountered in, e.g., digital subscriber line transmission. The optimal power allocation is characterized by using the concavity of sum-rate capacity as a function of the power constraints.

Related

• Sum Capacity of the Gaussian Interference Channel in the Low Interference Regime
• New Outer Bounds on the Capacity Region of Gaussian Interference Channels
• Capacity Bounds and Sum Rate Capacities of a CLass of Discrete Memoryless Interference Channels
• Gaussian Interference Networks: Sum Capacity in the Low Interference Regime and New Outer Bounds on the Capacity Region
• The Capacity of Mixed and One-Sided Gaussian Interference Channels