Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference Channels
From MaRDI portal
Publication:2986247
DOI10.1109/TIT.2014.2322872zbMATH Open1360.94179arXiv1303.2087MaRDI QIDQ2986247FDOQ2986247
Authors: Fangfang Zhu, Biao Chen 
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class of channels is determined. As with the Gaussian case, the sum-rate capacity is achieved by letting the transceiver pair subject to interference communicate at a rate such that its message can be decoded at the unintended receiver using single user detection. It is also established that this class of discrete memoryless interference channels is equivalent in capacity region to certain degraded interference channels. This allows the construction of capacity outer-bounds using the capacity regions of associated degraded broadcast channels. The same technique is then used to determine the sum-rate capacity of discrete memoryless interference channels with mixed interference as defined in the paper. The obtained capacity bounds and sum-rate capacities are used to resolve the capacities of several new discrete memoryless interference channels.
Full work available at URL: https://arxiv.org/abs/1303.2087
Cited In (12)
- On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels
- Noisy-Interference Sum-Rate Capacity of Parallel Gaussian Interference Channels
- Sum Capacity of a Class of Symmetric SIMO Gaussian Interference Channels Within $ {\cal O}(1)$
- Ergodic Fading Interference Channels: Sum-Capacity and Separability
- On the Capacity Bounds for Poisson Interference Channels
- On the capacity of a cascade of identical discrete memoryless nonsingular channels (Corresp.)
- Noisy-Interference Sum-Rate Capacity for Vector Gaussian Interference Channels
- Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels
- Capacity Limits for Binary Codes in the Presence of Interference
- Discrete Sum Rate Maximization for MISO Interference Broadcast Channels: Convex Approximations and Efficient Algorithms
- Capacity of the discrete-time Gaussian channel with intersymbol interference
- Analysis of Deterministic Binary Interference Channels Via a General Outer Bound
This page was built for publication: Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986247)
