Sum Capacity of One-Sided Parallel Gaussian Interference Channels

Authors:
Chi Wan Sung;K. W.K. Lui;K. W. Shum;H. C. So
Affiliations:
City Univ. of Hong Kong, Hong Kong;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 3

Parallel Gaussian interference channels are not always separable

IEEE Transactions on Information Theory
On the separability of parallel Gaussian interference channels

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Rate enhancement for the Gaussian Z-interference channel with transmitter cooperation

IEEE Communications Letters

Quantified Score

Hi-index	754.90

Visualization

Abstract

The sum capacity of the one-sided parallel Gaussian interference channel is shown to be a concave function of user powers. Exploiting the inherent structure of the problem, we construct a numerical algorithm to compute it. Two suboptimal schemes are compared with the capacity-achieving scheme. One of the suboptimal schemes, namely iterative waterfilling, yields close-to-capacity performance when the cross link gain is small.