Sum capacity of one-sided parallel Gaussian interference channels

Chi Wan Sung; Kenneth W.K. Lui; Kennth W. Shum; H. C. So

doi:10.1109/TIT.2007.911178

Sum capacity of one-sided parallel Gaussian interference channels

Chi Wan Sung
, Kenneth W.K. Lui
, Kennth W. Shum
, H. C. So

Department of Electrical Engineering

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

9 Citations (Scopus)

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. © 2008 IEEE.

Original language	English
Pages (from-to)	468-472
Journal	IEEE Transactions on Information Theory
Volume	54
Issue number	1
DOIs	https://doi.org/10.1109/TIT.2007.911178
Publication status	Published - Jan 2008

Research Keywords

Gaussian interference channels
Iterative waterfilling
Sum capacity

Access Output

10.1109/TIT.2007.911178

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{d4f1b9495fba4445890711a495ed5a30,

title = "Sum capacity of one-sided parallel Gaussian interference channels",

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. {\textcopyright} 2008 IEEE.",

keywords = "Gaussian interference channels, Iterative waterfilling, Sum capacity",

author = "Sung, \{Chi Wan\} and Lui, \{Kenneth W.K.\} and Shum, \{Kennth W.\} and So, \{H. C.\}",

year = "2008",

month = jan,

doi = "10.1109/TIT.2007.911178",

language = "English",

volume = "54",

pages = "468--472",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE",

number = "1",

}

TY - JOUR

T1 - Sum capacity of one-sided parallel Gaussian interference channels

AU - Sung, Chi Wan

AU - Lui, Kenneth W.K.

AU - Shum, Kennth W.

AU - So, H. C.

PY - 2008/1

Y1 - 2008/1

N2 - 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. © 2008 IEEE.

AB - 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. © 2008 IEEE.

KW - Gaussian interference channels

KW - Iterative waterfilling

KW - Sum capacity

UR - https://www.scopus.com/pages/publications/38349156075

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-38349156075&origin=recordpage

U2 - 10.1109/TIT.2007.911178

DO - 10.1109/TIT.2007.911178

M3 - RGC 21 - Publication in refereed journal

SN - 0018-9448

VL - 54

SP - 468

EP - 472

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 1

ER -

Sum capacity of one-sided parallel Gaussian interference channels

Abstract

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this