Sum Capacity of One-Sided Parallel Gaussian Interference Channels

13 years 4 months ago

Download www.ee.cityu.edu.hk

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 capacityachieving scheme. One of the suboptimal schemes, namely iterative waterfilling, yields close-to-capacity performance when the cross link gain is small.

Chi Wan Sung, Kenneth Wing-Kin Lui, Kenneth W. Shu

Real-time Traffic

Parallel Gaussian Interference | Suboptimal Schemes | Sum Capacity | TIT 2008 |

claim paper

» On SumRate Capacity of Parallel Gaussian Symmetric Interference Channels

» SumCapacity and the Unique Separability of the Parallel Gaussian MACZBC Network

» Sum Capacity of MIMO Interference Channels in the Low Interference Regime

» Multiple Access Outerbounds and the Inseparability of Parallel Interference Channels

» Sum Capacity of the Gaussian Interference Channel in the Low Interference Regime

» On the Capacity and Generalized Degrees of Freedom of the X Channel

» On the Capacity of the 2user Gaussian MAC Interfering with a P2P Link

» Capacity Bounds for the Gaussian Interference Channel

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TIT
Authors	Chi Wan Sung, Kenneth Wing-Kin Lui, Kenneth W. Shum, Hing-Cheung So

Comments (0)

Sciweavers

Sum Capacity of One-Sided Parallel Gaussian Interference Channels

Parallel Gaussian Interference | Suboptimal Schemes | Sum Capacity | TIT 2008 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers