The Capacity Region of a Class of Semideterministic Interference Channels

Chong, Hon-Fah; Motani, Mehul

doi:10.1109/tit.2008.2009834

Cited by 21 publications

(17 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Property (iii) in the definition of the semi-deterministic IRC resembles a property of the semi-deterministic interference channel with common information [31]. One can interpret (30a, 30b) as partially strong interference condition: knowing X N k , receiver k together with relay k can deduce more information about one part of the message sent by transmitter l (conveyed by T N l ) than receiver l and relay l can, k, l ∈ {1, 2}, k = l. In Appendix B we show that choosing T k to represent the common message of transmitter k is capacity achieving.…”

Section: Theoremmentioning

confidence: 99%

Interfering Relay Channels

Hiep

Oechtering

Skoglund

et al. 2017

Entropy

View full text Add to dashboard Cite

This paper introduces and studies a model in which two relay channels interfere with each other. Motivated by practical scenarios in heterogeneous wireless access networks, each relay is assumed to be connected to its intended receiver through a digital link with finite capacity. Inner and outer bounds for achievable rates are derived and shown to be tight for new discrete memoryless classes, which generalize and unify several known cases involving interference and relay channels. Capacity region and sum capacity for multiple Gaussian scenarios are also characterized to within a constant gap. The results show the optimality or near-optimality of the quantize-bin-and-forward coding scheme for practically relevant relay-interference networks, which brings important engineering insight into the design of wireless communications systems.

show abstract

Section: Theoremmentioning

confidence: 99%

Interfering Relay Channels

Hiep

Oechtering

Skoglund

et al. 2017

Entropy

View full text Add to dashboard Cite

show abstract

“…July 2, 2018 DRAFT Sato alluded in [2] that (6) and (7) hold for all product input may be too restrictive, i.e., "This is a sufficient condition for the coincidence of the bounds, but may not be necessary." In [10], it was established indeed that for a DMIC, the very strong interference can be relaxed to be such that conditions (6) and (7) need to be satisfied only for input distribution achieving the boundary points of the capacity region. This simple generalization broadens the class of DMIC with very strong interference and is also consistent with the GIC counterpart -it was shown in [10] that (6) and (7) may be violated with non-Gaussian input even if (3) and (4) are satisfied.…”

Section: Very Strong Interferencementioning

confidence: 99%

“…Despite decades of intense research, the capacity region of IC remains unknown except for a few special cases. These include interference channels with strong and very strong interference [1]- [5]; classes of deterministic and semideterministic ICs [6], [7]; and classes of discrete degraded ICs [8], [9].…”

Section: Introductionmentioning

confidence: 99%

Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference Channels

Fang

Chen

2014

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

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.

show abstract

“…For the sufficiency, by symmetry, we need only to prove (8). The proof can be constructed in essentially the same way as that of [6,Lemma 1].…”

Section: Parallel Dmic With Strong Interferencementioning

confidence: 99%

“…This channel model was first mentioned in [1,Section 14] and its capacity region is generally unknown except for the following cases, (1) ICs with strong and very strong interference [2]- [6]; (2) classes of deterministic and semi-deterministic ICs [7], [8]; and (3) classes of discrete degraded ICs [9], [10].…”

Section: Introductionmentioning

confidence: 99%