Noisy-Interference Sum-Rate Capacity of Parallel Gaussian Interference Channels
From MaRDI portal
Abstract: 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.
Recommendations
- Noisy-Interference Sum-Rate Capacity for Vector Gaussian Interference Channels
- A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels
- Sum Capacity of One-Sided Parallel Gaussian Interference Channels
- Capacity Bounds for the Gaussian Interference Channel
- Capacity Bounds for the K -User Gaussian Interference Channel
- Capacity Regions and Sum-Rate Capacities of Vector Gaussian Interference Channels
- The Approximate Sum Capacity of the Symmetric Gaussian <inline-formula> <tex-math notation="TeX">$K$ </tex-math></inline-formula>-User Interference Channel
- On the Optimality of Treating Interference as Noise for -User Parallel Gaussian Interference Networks
- Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference Channels
- Capacity of the discrete-time Gaussian channel with intersymbol interference
Cited in
(2)
This page was built for publication: Noisy-Interference Sum-Rate Capacity of Parallel Gaussian Interference Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281117)