Computer Science – Information Theory
Scientific paper
2007-12-12
Computer Science
Information Theory
20 pages, 8 figures, submitted to IEEE Trans. Inform. Theory,
Scientific paper
A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this paper. Specifically, it is shown that if the channel coefficients and power constraints satisfy a simple condition then single-user detection at each receiver is sum-rate optimal, i.e., treating the interference as noise incurs no loss in performance. This is the first concrete (finite signal-to-noise ratio) capacity result for the Gaussian interference channel with weak to moderate interference. Furthermore, for certain mixed (weak and strong) interference scenarios, the new outer bounds give a corner point of the capacity region.
Chen Biao
Kramer Gerhard
Shang Xiaohu
No associations
LandOfFree
A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels 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 A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-661938