Noisy-interference Sum-rate Capacity of Parallel Gaussian Interference Channels
| dc.creator | Shang, Xiaohu | |
| dc.creator | Chen, Biao | |
| dc.creator | Kramer, Gerhard | |
| dc.creator | Poor, H. Vincent | |
| dc.date | 2009-03-03 | |
| dc.date.accessioned | 2026-07-07T12:48:45Z | |
| dc.date.available | 2026-07-07T12:48:45Z | |
| dc.description | 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. | |
| dc.description | 32 pages, 8 figures, submitted to IEEE trans. on Information Theory in Feb | |
| dc.identifier | https://arxiv.org/abs/0903.0595 | |
| dc.identifier | http://arxiv.org/abs/0903.0595 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/222165 | |
| dc.subject | Information Theory | |
| dc.title | Noisy-interference Sum-rate Capacity of Parallel Gaussian Interference Channels | |
| dc.type | text |