Noisy-Interference Sum-Rate Capacity for Vector Gaussian Interference Channels
From MaRDI portal
Publication:2989449
DOI10.1109/TIT.2012.2216502zbMATH Open1364.94453arXiv1108.0870OpenAlexW1997167847MaRDI QIDQ2989449FDOQ2989449
Authors: Xiaohu Shang, H. Vincent Poor 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: New sufficient conditions for a vector Gaussian interference channel to achieve the sum-rate capacity by treating interference as noise are derived, which generalize the existing results. More concise conditions for multiple-input-single-output, and single-input-multiple-output scenarios are obtained.
Full work available at URL: https://arxiv.org/abs/1108.0870
Recommendations
- Noisy-Interference Sum-Rate Capacity of Parallel Gaussian Interference Channels
- Capacity Regions and Sum-Rate Capacities of Vector Gaussian Interference Channels
- A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels
- Capacity Bounds for the Gaussian Interference Channel
- Capacity Region of Vector Gaussian Interference Channels With Generally Strong Interference
- Capacity Bounds for the $K$ -User Gaussian Interference Channel
- The Approximate Sum Capacity of the Symmetric Gaussian <inline-formula> <tex-math notation="TeX">$K$ </tex-math></inline-formula>-User Interference Channel
- Sum Capacity of One-Sided Parallel Gaussian Interference Channels
- 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 (1)
This page was built for publication: Noisy-Interference Sum-Rate Capacity for Vector Gaussian Interference Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989449)
